Efficient memory access in large-scale computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 480 LNCS, Issue , 1991, Pages 26-41

  Vitter, Jeffrey Scott ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84958084953     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0020785     Document Type: Conference Paper

References (20)

1. A. Aggarwal, B. Alpern, A. K. Chandra and M. Snir, “A Model for Hierarchical Memory,” Proceedings of 19th Annual ACM Symposium on Theory of Computing (May 1987), 305-314.
2. A. Aggarwal and A. Chandra, “Virtual Memory Algorithms,” Proceedings of 20th Annual ACM Symposium on Theory of Computing (May 1988), 173-185.
3. A. Aggarwal, A. Chandra and M. Snir, “Hierarchical Memory with Block Transfer,” Proceedings of 28th Annual IEEE Symposium on Foundations of Computer Science (October 1987), 204-216.
4. A. Aggarwal and J. S. Vitter, “The Input/Output Complexity of Sorting and Related Problems,” Communications of the ACM (September 1988), 1116-1127, also appears in Proceedings of 14th Annual International Colloquium on Automata, Languages, and Programming, LNCS 267, Springer-Verlag, Berlin, 1987.
5. B. Alpern, L. Carter and E. Feig, “Uniform Memory Hierarchies,” Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (October 1990), 600-608.
6. B. Alpern, L. Carter and T. Selker, “Visualizing Computer Memory Architectures,” Proceedings of the 1990 IEEE Visualization Conference (October 1990).
7. R. W. Floyd, “Permuting Information in Idealized Two-Level Storage,” in Complexity of Computer Calculations, R. Miller and J. Thatcher, ed., Plenum, 1972, 105-109.
8. J. W. Hong and H. T. Kung, “I/O Complexity: The Red-Blue Pebble Game,” Proc. of the 13th Annual ACM Symposium on the Theory of Computing (May 1981), 326-333.
9. C. Icking, R. Klein and T. Ottmann, “Priority Search Trees in Secondary Memory,” Graph-Theoretic Concepts in Computer Science, Proceedings of the International Workshop WG ‘87 (1988), 84-93.
10. D. Knuth, in The Art of Computer Programming, Volume 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973.
11. T. Leighton, “Tight Bounds on the Complexity of Parallel Sorting,” IEEE Transactions on Computers C-34 (April 1985), 344-354, also appears in Proceedings of the 16th Annual ACM Symposium on Theory of Computing, (April 1983), 71-80.
12. E. E. Lindstrom and J. S. Vitter, “The Design and Analysis of BucketSort for Bubble Memory Secondary Storage,” IEEE Transactions on Computers C-34 (March 1985), 218-233.
13. F. Luccio and L. Pagli, “A Model of Sequential Computation Based on a Pipelined Access to Memory,” Proceedings of the 27th Annual Allerton Conference on Communication, Control, and Computing (September 1989).
14. M. H. Nodine, D. P. Lopresti and J. S. Vitter, “I/O Overhead and Parallel VLSI Architectures for Lattice Computations,” IEEE Transactions on Computers (to appear), also appears in Proceedings of the International Conference on Computers and Information, Niagara Falls (May 1990).
15. F.P. Preparata and M.I. Shamos, Computational Geometry, Springer-Verlag, New York, 1985.
16. J. H. Reif and L. G. Valiant, “A Logarithmic Time Sort on Linear Size Networks,” Journal of the ACM 34 (January 1987), 60-76, also appears in Proceedings of the 15th Annual ACM Symposium on Theory of Computing (April 1983), 10-16.
17. J. Savage and J. S. Vitter, “Parallelism in Space-Time Tradeoffs,” in Advances in Computing Research, Volume 4, F. P. Preparata, ed., JAI Press, 1987, 117-146, also appears in Proceedings of the International Workshop on Parallel Computing and VLSI, Amalfi, Italy (May 1984), P. Bertolazzi and F. Luccio, ed., Elsevier Science Press, 1985, 49-58.
18. J. D. Ullman and M. Yannakakis, “The Input/Output Complexity of Transitive Closure,” Proceedings of the 1990 ACM-SIGMOD International Conference on Management of Data (1990), 44-53, also appears in a special issue of Annals of Mathematics and Artificial Intelligence, S. Naqvi, ed., to appear.
19. J. S. Vitter and Ph. Flajolet, “Average-Case Analysis of Algorithms and Data Structures,” in Handbook of Theoretical Computer Science, Jan van Leeuwen, ed., North-Holland, 1990, 431-524.
20. J. S. Vitter and E. A. M. Shriver, “Optimal Disk I/O with Parallel Block Transfer,” Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (May 1990), 159-169.