Algorithms for parallel memory, I: Two-level memories

DOI10.1007/BF01185207zbMath0917.68085WikidataQ67224677 ScholiaQ67224677MaRDI QIDQ1333432

Jeffrey Scott Vitter, E. A. M. Shriver

Publication date: 24 May 1999

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

sorting; disk; FFT; permutation; transposition; matrix multiplication; input/output; I/O; secondary memory; distributionsort

Mathematics Subject Classification ID

68P10: Searching and sorting

65T50: Numerical methods for discrete and fast Fourier transforms

65Y05: Parallel numerical computation

68W15: Distributed algorithms

Related Items

RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS, Representing graphs implicitly using almost optimal space, Dynamic dictionary matching in external memory, Algorithms for parallel memory. II: Hierarchical multilevel memories, Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep, An efficient external sorting algorithm, An external memory data structure for shortest path queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coding techniques for handling failures in large disk arrays
• Universal classes of hash functions
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• Time bounds for selection
• Tight Bounds on the Complexity of Parallel Sorting
• The Universality of the Shuffle-Exchange Network
• Parallel Processing with the Perfect Shuffle