Improving fine-grained irregular shared-memory benchmarks by data reordering

Proceedings of the International Conference on Supercomputing

Volumn 2000-November, Issue , 2000, Pages

  Hu, Y Charlie ^a   Cox, Alan ^a   Zwaenepoel, Willy ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; BENCHMARKING;

CLOSE PROXIMITY; DATA REORDERING; FALSE SHARING; FINE GRAINED; HARDWARE AND SOFTWARE; PERFORMANCE; PHYSICAL SYSTEMS; SHARED MEMORY; SHARED MEMORY SYSTEM; SPATIAL LOCALITY;

MEMORY ARCHITECTURE;

EID: 17644383969     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.2000.10009     Document Type: Conference Paper

References (35)

1. C. Amza, A. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel. TreadMarks: Shared memory computing on networks of workstations. IEEE Computer, 29(2):18-28, Feb. 1996.
2. J. Barnes and P. Hut. A hierarchical O (N log N) force calculation algorithm. Nature, 324:446-449, 1986.
3. T. Bially. Space-filling curves: Their generation and their application to bandwidth reduction. IEEE Trans. Inform. Theory, IT-15:658 - 664, November 1969.
4. B. Brooks, R. Bruccoleri, B. Olafson, D. States, S. Swaminathan, and M. Karplus. Charmm: A program for macromolecular energy, minimization, and dynamics calculations. Journal of Computational Chemistry, 4:187, 1983.
5. A. R. Butz. Convergence with Hilbert's space filling curve. J. of Computer and System Sciences, 3:128 - 146, May 1969.
6. B. Calder, C. Krintz, S. John, and T. Austin. Cache conscious data placement. In Proceedings of the 8th Symposium on Architectural Support for Programming Languages and Operating Systems, Oct. 1998.
7. S. Carr, K. McKinley, and C.-W. Tseng. Compiler optimizations for improving data locality. In Proceedings of the 6th Symposium on Architectural Support for Programming Languages and Operating Systems, Oct. 1994.
8. T. Chilimbi, B. Davidson, and J. Larus. Cache-conscious structure definition. In Proceedings of the ACM SIGPLAN 99 Conference on Programming Language Design and Implementation, May 1999.
9. T. Chilimbi, M. Hill, and J. Larus. Cache-conscious structure layout. In Proceedings of the ACM SIGPLAN 99 Conference on Programming Language Design and Implementation, May 1999.
10. A. L. Cox, E. de Lara, C. Hu, and W. Zwaenepoel. A performance comparison of homeless and home-based lazy release consistency protocols in software shared memory. In Proceedings of the Fifth International Symposium on High-Performance Computer Architecture, pages 279-283, Jan. 1999.
11. R. Das, M. Uysal, J. Saltz, and Y.-S. Hwang. Communication optimizations for irregular scientific computations on distributed memory architectures. Journal of Parallel and Distributed Computing, 22(3):462-479, Sept. 1994.
12. C. Ding and K. Kennedy. Improving cache performance of dynamic applications with computation computation and data layout transformations. In Proceedings of the ACM SIGPLAN 99 Conference on Programming Language Design and Implementation, May 1999.
13. S. Dwarkadas, K. Gharachorloo, L. Kontothanassis, D. J. Scales, M. L. Scott, and R. Stets. Comparative evaluation of fine- and coarse-grain approaches for software distributed shared memory. In Proceedings of the Fifth International Symposium on High-Performance Computer Architecture, pages 260-269, Jan. 1999.
14. D. Gannon, W. Jalby, and K. Gallivan. Strategies for cache and local memory management by global program transformation. Journal of Parallel and Distributed Computing, 5:587-616, Jan. 1988.
15. E. Granston and H. Wijshoff. Managing pages in shared virtual memory systems: Getting the compiler into the game. In Proceedings of the 1993 ACM International Conference on Supercomputing, July 1993.
16. L. Greengard. The Rapid Evaluation of Potential Fileds in Particle Systems. MIT Press, 1988.
17. D. Hilbert. Über die stetige Abbildung einer Linie auf Flächenstück. Math. Ann., pages 459-460, 1891.
18. Y. C. Hu and S. L. Johnsson. Data parallel performance optimizations using array aliasing. In M. Heath, A. Ranade, and R. Schreiber, editors, Algorithms for Parallel Processing, pages 213-245. IMA Volumes in Mathematics and its Applications, Volume 105, Springer-Verlag, 1999.
19. T. Jeremiassen and S. Eggers. Reducing false sharing on shared memory multiprocessors through compile time data transformations. In Proceedings of the 5th Symposium on the Principles and Practice of Parallel Programming, July 1995.
20. D. Jiang, H. Shan, and J. Singh. Application restructuring and performance portability on shared virtual memory and hardware-coherent multiprocessors. In Proceedings of the 6th Symposium on the Principles and Practice of Parallel Programming, June 1997.
21. D. Jiang and J. Singh. Scalability of home-based shared virtual memory on clusters of SMPs. In Proceedings of the 1999 International Conference on Supercomputing, May 1999.
22. D. Jiang and J. Singh. Scaling application performance on a cache-coherent multiprocessor. In Proceedings of the 26th International Symposium on Computer Architectures, May 1999.
23. J. Laudon and D. Lenoski. The SGI origin: a CCNUMA highly scalable server. In Proceedings of the 24th International Symposium on Computer Architectures, June 1997.
24. J. Mellor-Crummey, D. Whalley, and K. Kennedy. Improving memory hierarchy performance for irregular applications. In Proceedings of the 1999 International Conference on Supercomputing, June 1999.
25. S. Mukherjee, S. Sharma, M. Hill, J. Larus, A. Rogers, and J. Saltz. Efficient support for irregular applications on distributed memory machines. In Proceedings of the 5th Symposium on the Principles and Practice of Parallel Programming, July 1995.
26. D. O'Hallaron, J. Shewchuk, and T. Gross. Architectural implications of a family of irregular applications. In Proceedings of the Fourth International Symposium on High-Performance Computer Architecture, Jan. 1998.
27. H. Samet. Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
28. D. Scales, K. Gharachorloo, and C. Thekkath. Shasta: A low overhead software-only approach for supporting fine-grain shared memory. In Proceedings of the 7th Symposium on Architectural Support for Programming Languages and Operating Systems, Oct. 1996.
29. J. Singh, W.-D. Weber, and A. Gupta. SPLASH: Stanford parallel applications for shared-memory. Technical Report CSL-TR-91-469, Stanford University, Apr. 1991.
30. J. Singh, W.-D. Weber, and A. Gupta. SPLASH: Stanford parallel applications for shared-memory. Computer Architecture News, 20(1):2-12, Mar. 1992.
31. Y. Song and Z. Li. New tiling techniques to improve cache temporal locality. In Proceedings of the ACM SIGPLAN 99 Conference on Programming Language Design and Implementation, May 1999.
32. M. E. Wolfe and M. S. Lam. A data locality optimizing algorithm. In Proceedings of the ACM SIGPLAN 91 Conference on Programming Language Design and Implementation, June 1991.
33. S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. The SPLASH-2 programs: characterization and methodological considerations. In Proceedings of the 22nd Annual International Symposium on Computer Architecture, pages 24-36, June 1995.
34. M. Zekauskas, W. Sawdon, and B. Bershad. Software write detection for distributed shared memory. In Proceedings of the First USENIX Symposium on Operating System Design and Implementation, pages 87-100, Nov. 1994.
35. Y. Zhou, L. Iftode, and K. Li. Performance evaluation of two home-based lazy release consistency protocols for shared virtual memory systems. In Proceedings of the Second USENIX Symposium on Operating System Design and Implementation, pages 75-88, nov 1996.