(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*

This guide provides a more detailed description of the syntax that is supported along with examples.

This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.

Concept Search - What can I type?

For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.

Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.

Publishing Venue

Related People

Abstract

Disclosed is an effective run allocation algorithm that also takes into account the marginal return of allocating runs to an incoming merge to reduce the mean response time for concurrent mergesorts, where a merge has multiple sorted runs residing on disks.

Country

United States

Language

English (United States)

This text was extracted from an ASCII text file.

This is the abbreviated version, containing approximately
68% of the total text.

Effective Run Allocation Algorithm for Concurrent
External Mergesorts

Disclosed is
an effective run allocation algorithm that also
takes into account the marginal return of allocating runs to an
incoming merge to reduce the mean response time for concurrent
mergesorts, where a merge has multiple sorted runs residing on disks.

Traditional
approaches to dynamic run allocation for concurrent
merges determine the maximum number of runs and the corresponding
prefetch quantity based only on the current buffer availability (i.e,
the number of runs currently committed).
The marginal return of
allocating runs is not considered.
However, a substantial
performance improvement can be achieved if the marginal return is
also taken into account in the run allocation.
For example, if the
total number of runs requested is 60, allocating 50 or 51 may make
little difference, since more than one merge step is needed in both
cases. However, increasing the number of
runs from 59 to 60 can make
a tremendous difference, because the merge can be completed in a
single step, instead of 2, if 60 runs are allocated.

Proposed is
an improved run allocation algorithm which takes
into account both buffer availability and marginal gain. Let
(M + k - 1)/k be the high return
points for a merge, where M is
the total number of runs requested, k = 1, 2, ... M-1 is the number
of steps to complete the merge if
(M + k - 1)/k runs are allocated. It...