Journal Article10.1137/0206001
Optimal Polyphase Sorting
12
TL;DR: A read-forward polyphase merge algorithm is described which performs the poly phase merge starting from an arbitrary string distribution and it is shown to be asymptotically optimal.
read more
Abstract: A read-forward polyphase merge algorithm is described which performs the polyphase merge starting from an arbitrary string distribution. This algorithm minimizes the volume of information moved. Since this volume is easily computed, it is possible to construct dispersion algorithms which anticipate the merge algorithm. Two such dispersion techniques are described. The first algorithm requires that the number of strings to be dispersed be known in advance; this algorithm is optimal. The second algorithm makes no such requirement, but is not always optimal. In addition, performance estimates are derived and both algorithms are shown to be asymptotically optimal.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Survey of Analysis Techniques for Discrete Algorithms
TL;DR: This survey includes an introduction to the concepts of problem complexity, analysis of algorithms to find bounds on complexity, average-case behavior, and approximation algomthms.
Lower Bounds for Selection in X + Y and Other Multisets
TL;DR: A lower bound of f~(max(n, K 1/2 log K) is given for selecting the Kth element in X + X, and thus in X and Y, for K selecting the first through the median element Selection of gaps, that is, consecutive differences in a sorted order, is shown to be f ~(n log n) for all K.
40
Intelligent database caching through the use of page-answers and page-traces
Nabil Kamel,Roger King +1 more
TL;DR: An efficient heuristic to select a near optimal set of page-answers and page-traces to populate the main memory has been developed, implemented, and tested and quantitative measurements of performance benefits are reported.
18
Organization of clustered files for consecutive retrieval
TL;DR: It is shown that, for certain types of multilevel clustered files, there exists a storage organization such that the objects in each cluster, for all clusters in each level of the clustering, appear in consecutive locations.
12
Memory-constrained task scheduling on a network of dual processors
Ken Fuchs,Dennis Kafura +1 more
TL;DR: In this paper a model with limited sharing (only two processors connected to each memory) is analyzed and its performance compared with the performance of two other models that have appeared in the literature is analyzed.
4
References
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
TL;DR: A container closure assembly for maintaining a sterile sealed container is provided having a ferrule having a central opening in the top annular portion, upwardly projecting locking portions about the periphery of the opening and a weakening line radially outwardly of and concentric with the locking portions.
2.8K
•Book
Limit Distributions for Sums of Independent Random Variables
B. W. Gnedenko,A. N. Kolmogorov +1 more
- 01 Jan 1954
2.3K
•Book
Sorting and Searching
Donald E. Knuth
- 01 Jan 1973
TL;DR: The first revision of this third volume is a survey of classical computer techniques for sorting and searching that extends the treatment of data structures to consider both large and small databases and internal and external memories.
1.7K