Algorithms for parallel memory. II: Hierarchical multilevel memories

DOI10.1007/BF01185208zbMath0917.68086MaRDI QIDQ1333433

E. A. M. Shriver, Jeffrey Scott Vitter

Publication date: 13 October 1994

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

sortingmatrix transpositionmemory hierarchiesdistribution sortFFT matrix multiplicationmultilevel memory

Mathematics Subject Classification ID

Related Items (15)

Markov analysis of multiple-disk prefetching strategies for external merging ⋮ The uniform memory hierarchy model of computation ⋮ Algorithms for parallel memory, I: Two-level memories ⋮ I/O-efficient algorithms for graphs of bounded treewidth ⋮ MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗ ⋮ A bridging model for multi-core computing ⋮ Two-dimensional substring indexing. ⋮ The cost of cache-oblivious searching ⋮ On the limits of cache-oblivious rational permutations ⋮ On the importance of cache tuning in a cache-aware algorithm: a case study ⋮ Two-Dimensional partitioning problems ⋮ The expressiveness of a family of finite set languages ⋮ Computing with pipelined block transfer ⋮ Bicriteria Data Compression ⋮ An external memory data structure for shortest path queries

Cites Work

• The uniform memory hierarchy model of computation
• Algorithms for parallel memory, I: Two-level memories
• Large-scale sorting in uniform memory hierarchies
• A model of sequential computation with Pipelined access to memory

This page was built for publication: Algorithms for parallel memory. II: Hierarchical multilevel memories