Cache-oblivious priority queue and graph algorithm applications

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 268-276

  Arge, Lars ^a   Bender, Michael A ^a   Demaine, Erik D ^a   Holland Minkley, Bryan ^a   Munro, J Ian ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTATIONAL COMPLEXITY; COMPUTER GRAPHICS; MATHEMATICAL MODELS; QUEUEING THEORY;

GRAPH ALGORITHM; MEMORY TRANSFER; QUEUE DATA STRUCTURE;

DATA STRUCTURES;

EID: 0036038481     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509948.509950     Document Type: Conference Paper

References (38)

1. A functional approach to external graph algorithms
2. A model for hierarchical memory
3. Virtual memory algorithms
4. Hierarchical memory with block transfer
5. The input/output complexity of sorting and related problems
6. The uniform memory hierarchy model of computation
7. A simple randomized parallel algorithm for list-ranking
8. The buffer tree: A new technique for optimal I/O-algorithms
9. The I/O-complexity of ordered binary-decision diagram manipulation
10. External memory data structures
11. On external memory MST, SSSP and multi-way planar graph separation
12. Organization and maintenance of large ordered indexes
13. Cache-oblivious B-trees
14. A locality-preserving cache-oblivious dynamic dictionary
15. An analysis of dag-consistent distributed shared-memory algorithms
16. Cache oblivious search trees via binary trees of small height
17. Worst-case efficient external-memory priority queues
18. On external memory graph traversal
19. External-memory graph algorithms
20. Efficient parallel algorithms for some graph problems
21. Deterministic coin tossing with applications to optimal list-ranking
22. Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms
23. The ubiquitous B-tree
24. Heaps and heapsort on secondary storage
25. Cache-oblivious algorithms
26. A new data structure for representing sorted lists
27. Improved algorithms and data structures for solving graph problems in external memory
28. The influence of caches on the performance of heaps
29. I/O-complexity of graph algorithms
30. Shortest connection networks and some generalizations
31. Optimized predecessor data structures for internal memory
32. Extending the Hong-Kung model to memory hierachies
33. An efficient parallel biconnectivity algorithm
34. Locality of reference in LU decomposition with partial pivoting
35. On efficient parallel strong orientation
36. External memory algorithms and data structures: Dealing with MASSIVE data
37. Algorithms for parallel memory, II: Hierarchical multilevel memories