Efficient memory access in large-scale computation

DOI10.1007/BFB0020785MaRDI QIDQ4035655zbMATH OpenFDO

Authors Jeffrey Scott Vitter

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0020785

zbMATH Keywords

communication bottlenecklarge-scale computationparallel multilevel hierarchical memories

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18)

Recommendations

• Algorithms for parallel memory, I: Two-level memories
• Large-scale sorting in uniform memory hierarchies
• scientific article; zbMATH DE number 1424311
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• scientific article; zbMATH DE number 1792107

Cited in

(26)

• Merging sorted runs using large main memory
• A new model for large memories
• Algorithms for parallel memory, I: Two-level memories
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• Optimizing database architecture for the new bottleneck: memory access
• Large-scale sorting in uniform memory hierarchies
• Array organization in parallel memories
• A comparison of sequential Delaunay triangulation algorithms.
• scientific article; zbMATH DE number 1696521 (Why is no real title available?)
• On characterizing the data access complexity of programs
• Cache and I/O efficent functional algorithms
• Strong I/O lower bounds for binomial and FFT computation graphs
• Delegating RAM Computations
• scientific article; zbMATH DE number 3854475 (Why is no real title available?)
• Efficient computation of optimal space-time performance curves for memory hierarchies
• scientific article; zbMATH DE number 4020488 (Why is no real title available?)
• scientific article; zbMATH DE number 1305503 (Why is no real title available?)
• scientific article; zbMATH DE number 1550513 (Why is no real title available?)
• The buffer tree: A new technique for optimal I/O-algorithms
• Topology B-trees and their applications
• A general lower bound on the I/O-complexity of comparison-based algorithms
• scientific article; zbMATH DE number 5049786 (Why is no real title available?)
• Trade-offs between communication throughput and parallel time
• Extending the Hong-Kung model to memory hierarchies
• Out-of-core computing on mesh connected computers
• Efficient data storage in large nanoarrays

This page was built for publication: Efficient memory access in large-scale computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035655)