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

sortingdiskFFTpermutationtranspositionmatrix multiplicationinput/outputI/Osecondary memorydistributionsort

Mathematics Subject Classification ID

Related Items (23)

An external-memory algorithm for string graph construction ⋮ Algorithms for parallel memory. II: Hierarchical multilevel memories ⋮ I/O-efficient algorithms for graphs of bounded treewidth ⋮ Worst-case efficient external-memory priority queues ⋮ The buffer tree: A new technique for optimal I/O-algorithms ⋮ Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep ⋮ Analysis of simple randomized buffer management for parallel I/O ⋮ External matrix multiplication and all-pairs shortest path ⋮ Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep ⋮ ISB-tree: A new indexing scheme with efficient expected behaviour ⋮ The cost of cache-oblivious searching ⋮ Efficient out-of-core sorting algorithms for the parallel disks model ⋮ On the importance of cache tuning in a cache-aware algorithm: a case study ⋮ External-memory algorithms for processing line segments in geographic information systems ⋮ Representing graphs implicitly using almost optimal space ⋮ A comparison of sequential Delaunay triangulation algorithms. ⋮ Congruent Number Theta Coefficients to 1012 ⋮ RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS ⋮ An Input/Output Efficient Algorithm for Hessenberg Reduction ⋮ Dynamic dictionary matching in external memory ⋮ Unnamed Item ⋮ An external memory data structure for shortest path queries ⋮ An efficient external sorting algorithm

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

This page was built for publication: Algorithms for parallel memory, I: Two-level memories