The uniform memory hierarchy model of computation
From MaRDI portal
Cites work
- Algorithms for parallel memory. II: Hierarchical multilevel memories
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Organizing matrices and matrix operations for paged memory systems
- The program dependence graph and its use in optimization
Cited in
(12)- Methods for message routing in parallel machines
- Algorithms for parallel memory. II: Hierarchical multilevel memories
- The latency-of-data-access model for analyzing parallel computation
- MODELS AND RESOURCE METRICS FOR PARALLEL AND DISTRIBUTED COMPUTATION∗
- Bicriteria data compression
- A blocked all-pairs shortest-paths algorithm
- Turing machines with two-level memory: a deep look into the input/output complexity
- Turing machines with two-level memory: new computational models for analyzing the input/output complexity
- A bridging model for multi-core computing
- The cost of cache-oblivious searching
- Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model
- On the limits of cache-oblivious rational permutations
This page was built for publication: The uniform memory hierarchy model of computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333430)