Optimal organizations for pipelined hierarchical memories

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2002, Pages 109-116

  Bilardi, Gianfranco ^a   Ekanadham, Kattamuri ^b   Pattnaik, Pratap ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Scalable pipeline hierarchical memory processor

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; PROGRAM COMPILERS; RANDOM ACCESS STORAGE;

ACCESS FUNCTION; PIPELINED HIERARCHICAL RANDOM ACCESS MACHINE;

PIPELINE PROCESSING SYSTEMS;

EID: 0036954483     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/564870.564886     Document Type: Conference Paper

References (32)

1. A. Aggarwal, B. Alpern, A.K. Chandra and M. Snir. A Model for Hierarchical Memory. In Proc. of the 19th ACM Symposium on Theory of Computing, (1987), 305-314.
2. A. Aggarwal, A.K. Chandra and M. Snir. Hierarchical Memory with Block Transfer. In Proc. 28th Annual Symposium on Foundations of Computer Science, (1987), 204-216.
3. B. Alpern, L. Carter, E. Feig and T. Selker. The Uniform Memory Hierarchy Model of Computation. In Algorithmica, vol. 12, (1994), 72-129.
4. R. Alverson, D. Callahan, D Cummings, B. Koblenz, A. Porterfield, B. Smith. The Tera Computer System. ACM International Conference on Supercomputing, pp. 1-6, June 1990.
5. N.M. Amato, J. Perdue, A. Pietracaprina, G. Pucci, and M. Mathis. Predicting performance on SMP's. A case study: The SGI Power Challenge. In Proc. International Parallel and Distributed Processing Symposium, IPDPS 2000, Cancun, MEX, pages 729-737, May 2000.
6. G. Bilardi, K. Ekanadham, P. Pattnaik. Pipelined Memory Hierarchies: Scalable Organizations and Application Performance. Proceedings of International Workshop on Innovative Architectures (IWIA01), A. Veidenbaum and H. Joe Eds., IEEE Computer Press, (2001).
7. G. Bilardi, K. Ekanadham, P. Pattnaik. On the Computational Power of Pipelined Hierarchical Memories. In Proc. of the 19th ACM Symposium on Parallel Algorithms and Architectures, Crete, Greece (2001).
8. G. Bilardi, K. Ekanadham, P. Pattnaik. SPORT: A Scalable Computer with a Pipelined Memory Hierarchy. Manuscript, November 2001.
9. G. Bilardi and F.P. Preparata. Horizons of Parallel Computation. Journal on Parallel and Distributed Computing, Vol. 27, 172-182, 1995.
10. G. Bilardi and F.Preparata Processor-time tradeoffs under bounded-speed message propagation. Part I: upper bounds. Theory of Computing Systems, Vol. 30, 523-546, 1997.
11. G. Bilardi and F.Preparata Processor-time tradeoffs under bounded-speed message propagation. Part II: lower bounds. Theory of Computing Systems, Vol. 32, 531-559, 1999.
12. G. Bilardi and E. Peserico An Approach toward an Analytical Characterization of Locality and its Portability. Proceedings of International Workshop on Innovative Architectures (IWIA01), A. Veidenbaum and H. Joe Eds., IEEE Computer Press, (2001).
13. G. Bilardi and E. Peserico A Characterization of Temporal Locality and its Portability Across Memory Hierarchies. ICALP 2001, International Colloquium on Automata, Languages, and Programming, Crete, July 2001.
14. G. Bilardi, A. Pietracaprina, and P. D'Alberto. On the space and access complexity of computation dags. 26th Workshop on Graph-Theoretic Concepts in Computer Science, Konstanz, Germany, June 2000.
15. B. Chazelle and L. Monier. A Model of Computation for VLSI with Related Complexity Results. Journal of the ACM, 32(3):573-588, July 1985.
16. S.A. Cook and R.A. Reckhow. Time Bounded Random Access Machines. Journal of Computer System Science, 7:354-375, 1973.
17. J. Fotheringham. Dynamic storage allocation in the ATLAS computer, including an automatic use of a backing store. Communication of the ACM, 4, 10, pp. 435-436, (1961).
18. M. Frigo, C.E. Leiserson, H. Prokop, and S. Ramachandran. Cache-Oblivious Algorithms. Proc. 40th Annual Symposium on Foundations of Computer Science, (1999).
19. F. Abolhassan, R. Drefenstedt, J. Keller, W.J. Paul, and D. Scheerer. On the Physical Design of PRAMs. Computer Journal, 36(8), pp. 756-762, December 1993.
20. D.S. Henry, B.C. Kuszmaul. and V. Viswanath The Ultrascalar Processor: An Asymptotically Scalable Superscalar Microarchitecture. Proceedings ARVLSI'99, Atlanta GA, March 21-24, pp. 256-273, IEEE Computer Society, 1999.
21. C. Leiserson Area-Efficient VLSI Computation. Ph.D. Thesis, Department of Computer Science, Carnegie Mellon University, October 1981.
22. F. Luccio and L. Pagli. A model of sequential computation with pipelined access to memory. Mathematical Systems Theory, 26(4), 343-356, 1993.
23. C. Metcalf. Data prefetching: a cost/performance analysis. Area Exam, MIT, October 1993.
24. R.L. Mattson, J. Gecsei, D.R. Slutz, and I.L. Traiger. Evaluation Techniques for Storage Hierarchies. IBM System Journal, No. 2, 78-117, 1970.
25. V. Milutinovic and M. Valero (Guest Eds.) Special Issue on Cache Memory and Related Problems. IEEE Transactions on Computers, February 1999.
26. S.S. Przybylski. Cache and Memory Hierarchy Design. A Performance Directed Approach. Morgan Kaufmann Publishers, Inc. Palo Alto, CA 1990.
27. Smithv, B. J.: Architecture and applications of the HEP multiprocessor system, Signal Processing IV, 298 (1981), 241-248.
28. J.E. Savage. Models of Computation. Exploring the Power of Computing Addison-Wesley, Reading, MA, 1998.
29. Valiant, L.G.: General purpose parallel architectures, Handbook for Theor. Computer Science (J.v. Leeuwen, ed.), Elsevier-MIT Press, 1990.
30. J.S Vitter. External Memory Algorithms. Invited paper in Proc. 6th Annual European Symposium on Algorithms. (G.Bilardi et al. Eds.), Springer Verlag, Venic, August 1998, 1-25.
31. M. Wolfe High Performance Compilers for Parallel Computing. Addison-Wesley, 1995.
32. R.C.Whaley and J.J.Dongarra. Automatically Tuned Linear Algebra Software. http://www.netlib.org/atlas/index.html