Memory-intensive benchmarks: IRAM vs. cache-based machines

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Volumn , Issue , 2002, Pages 290-296

  Gaeke, B R ^a   Husbands, P ^b   Li, X S ^b   Oliker, L ^b   Yelick, K A ^a,b   Biswas, R ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^c NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78650753155     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2002.1015506     Document Type: Conference Paper

References (23)

1. Y. Abe. Present Status of Computer Simulation at IPP, in Proceedings of Supercomputing '88: vol 2, Science and Applications, 1988.
2. D.H. Bailey, J. Barton, T. Lasinski, and H.D. Simon (Eds.). The NAS parallel benchmarks. Tech. Rep. RNR-91-002, NASA Ames Research Center, Moffett Field, 1991.
3. K. Batcher. Sorting networks and their applications. Proc. AFIPS Spring Joint Compute Conf., 1968.
4. The Berkeley Intelligent RAM (IRAM) Project, Univ. of California, Berkeley,at http://iram.cs.berkeley.edu.
5. G.E. Blelloch, M.A. Heroux, and M. Zagha. Segmented operations for sparse matrix computation on vector multiprocessors. Tech. Rep. CMU-CS-93-173, Carnegie Mellon Univ., Pittsburgh, 1993.
6. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms, MIT Press, 1990.
7. E.Cuthill and J. McKee. Reducing the bandwidth of sparse symmetric matrices. Proc. ACM Natl. Conf., 1969, 157-192.
8. DIS Stressmark Suite, v 1.0. Titan Systems Corp., 2000, at http://www.aaec.com/projectweb/dis/
9. B.R. Gaeke. GUPS benchmark manual. Univ. of California, Berkeley,at http://iram.cs.berkeley.edu/-brg/.
10. M. Hall, et al. Mapping irregular applications to DIVA, a PIM-based data-intensive architecture. Proc. SC99, 1999.
11. E. Im and K.A. Yelick. Optimizing sparse matrix-vector multiplication for register reuse. Proc. Intl. Conf. on Computational Science, 2001.
12. B. Khailany, W. J. Dally, S. Rixner, U. J. Kapasi, P. Mattson, J. Namkoong, J. D. Owens, B. Towles, and A. Chang. "Imagine: Media Processing with Streams." IEEE Micro, Mar/April 2001.
13. D.R. Kincaid, T.C. Oppe, and D.M. Young. ITPACKV 2D user's guide. Tech. Rep. CAN-232, Univ. of Texas, Austin, 1989.
14. C. Kozyrakis. A media-enhanced vector architecture for embedded memory systems. Tech. Rep. UCB-CSD-99-1059, Univ. of California, Berkeley, 1999.
15. C. Kozyrakis, D. Judd, J. Gebis, S. Williams, D. Patterson, and K. Yelick. Hardware/compiler co-development for an embedded media processor. Proceedings of the IEEE, 2001.
16. The MathWorks. How do I vectorize my code? Tech. Note 1109, at http://www.mathworks.com.
17. Mitsubishi 32-bit Microcontrollers, at http://www.mitsubishichips.com.
18. L. Oliker and R. Biswas. Parallelization of a dynamic unstructured algorithm using three leading programming paradigms. IEEE Trans. Parallel and Distributed Systems, 11(9):931-940, 2000.
19. D. Patterson, T. Anderson, N. Cardwell, R. Fromm, K. Keeton, R. Thomas, C. Kozyrakis, K. Yelick. Intelligent RAM (IRAM): Chips that remember and compute. Proc. Intl. Solid-State Circuits Conf., 1997.
20. The SLIIC Project, at http://www.east.isi.edu/SLIIC/
21. T. Sterling. A hybrid technology multithreaded (HTMT) computer architecture for petaflops computing. Jet Propulsion Laboratory, Pasadena, 1997, at http://htmt.jpl.nasa.gov.
22. K. Suehiro, H. Murai, Y. Seo. Integer Sorting on Shared-Memory Vector Parallel Computers. In Proceedings of ICS '98, 1998.
23. R. Thomas and K.A. Yelick. Efficient FFTs on IRAM. Proc. Workshop on Media Processors and DSPs, 1999.