scientific article; zbMATH DE number 176491
From MaRDI portal
Publication:4035655
Recommendations
Cited in
(23)- scientific article; zbMATH DE number 4020488 (Why is no real title available?)
- Merging sorted runs using large main memory
- Delegating RAM Computations
- Out-of-core computing on mesh connected computers
- scientific article; zbMATH DE number 5049786 (Why is no real title available?)
- Cache and I/O efficent functional algorithms
- A general lower bound on the I/O-complexity of comparison-based algorithms
- scientific article; zbMATH DE number 1696521 (Why is no real title available?)
- Efficient computation of optimal space-time performance curves for memory hierarchies
- A comparison of sequential Delaunay triangulation algorithms.
- Optimizing database architecture for the new bottleneck: memory access
- On characterizing the data access complexity of programs
- Large-scale sorting in uniform memory hierarchies
- Array organization in parallel memories
- scientific article; zbMATH DE number 3854475 (Why is no real title available?)
- Strong I/O lower bounds for binomial and FFT computation graphs
- Trade-offs between communication throughput and parallel time
- The buffer tree: A new technique for optimal I/O-algorithms
- Topology B-trees and their applications
- scientific article; zbMATH DE number 1550513 (Why is no real title available?)
- Extending the Hong-Kung model to memory hierarchies
- A new model for large memories
- Efficient data storage in large nanoarrays
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035655)