Integrating fine-grained message passing in cache coherent shared memory multiprocessors

Journal of Parallel and Distributed Computing

Volumn 33, Issue 2, 1996, Pages 172-188

  Poulsen, David K ^a   Yew, Pen Chung ^b  

^a Kuck and Associates Inc   (United States)

^b University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030584614     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0036     Document Type: Article

References (28)

1. 1. Callahan, D., Kennedy, K., and Porterfield, A. K. Software prefetching. Proc. 4th International Conference on Architectural Support for Programming Languages and Operating Systems. 1991, pp. 40-52.
2. 2. Mowry, T. C., Lam, M. S., and Gupta, A. Design and evaluation of a compiler algorithm for prefetching. Proc. 5th International Conference on Architectural Support for Programming Languages and Operating Systems. 1992, pp. 62-73.
3. 3. Tullsen, D. M., and Eggers, S. J. Limitations of cache prefetching on a bus-based multiprocessor. Proc. 20th Annual International Symposium on Computer Architecture. 1993, pp. 278-288.
4. 4. Mowry, T. C., and Gupta, A. Tolerating latency through software-controlled prefetching in shared-memory multiprocessors. J. Parallel Distrib. Comput. 12, 2 (June 1991), 87-106.
5. 5. Kuck, D., et al. The Cedar system and an initial performance study. Proc. 20th Annual International Symposium on Computer Architecture. 1993, pp. 213-223.
6. 6. Poulsen, D. K., and Yew, P.-C. Data prefetching and data forwarding in shared memory multiprocessors. Proc. 1994 International Conference on Parallel Processing. 1994, pp. II-276-280.
7. 7. Andrews, J. B., Beckmann, C. J., and Poulsen, D. K. Notification and multicast networks for synchronization and coherence. J. Parallel Distrib. Comput. 15, 4 (Aug. 1992), 332-350.
8. 8. Poulsen, D. K. Memory latency reduction via data prefetching and data forwarding in shared memory multiprocessors. Ph.D. dissertation, CSRD Report 1377, Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Sept. 1994.
9. 9. Poulsen, D. K., and Yew, P.-C. Execution-driven tools for parallel simulation of parallel architectures and applications. Proc. Super computing '93. 1993, pp. 860-869.
10. 10. Berry, M., et al. The Perfect Club bench marks: Effective performance evaluation of supercomputers. Inter nat. J. Super comput. Appl. 3, 3 (Fall 1989), 5-40.
11. 11. Padua, D., et al. The Cedar Fortran project. CSRD Report 1262, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, Oct. 1992.
12. 12. Poulsen, D. K., and Yew, P.-C. EPG source code instrumentation tools - user manual. CSRD Report, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, 1994.
13. 13. Polychronopoulos, C. D., et al. Parafrase-2: An environment for parallelizing, partitioning, synchronizing and scheduling programs on multiprocessors. Proc. 1989 International Conference on Parallel Processing. 1989, pp. II-39-48.
14. 14. Lenoski, D. E., et al. The Stanford Dash multiprocessor. IEEE Computer 25,3 (Mar. 1992), 63-79.
15. 15. Frank, M. I., and Vernon, M. K. A hybrid shared memory/message passing parallel machine. Proc. 1993 International Conference on Parallel Processing. 1993, pp. I-232-236.
16. 16. Hill, M. D., et al. Cooperative shared memory: Software and hardware for scalable multiprocessors. Proc. 5th International Conference on Architectural Support for Programming Languages and Operating Systems. 1992, pp. 262-273.
17. 17. Su, H.-M., and Yew, P.-C. Efficient doacross synchronization on distributed shared-memory multiprocessors. Proc. Supercomputing '91. 1991, pp. 842-853.
18. 18. Lee, J., and Ramachandran, U. Architectural primitives for a scalable shared memory multiprocessor. Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures. 1991, pp. 103-114.
19. 19. Goodman, J. R., Vernon, M. K., and Woest, P. J. Efficient synchronization primitives for large-scale cache-coherent multiprocessors. Proc. 3rd International Conference on Architectural Support for Programming Languages and Operating Systems. 1989, pp. 64-75.
20. 20. Weber, W.-D., and Gupta, A. Analysis of cache invalidation patterns in multiprocessors. Proc. 3rd International Conference on Architectural Support for Programming Languages and Operating Systems. 1989, pp. 243-256.
21. 21. Mounes-Toussi, F., and Lilja, D. J. The potential of compile-time analysis to adapt the cache coherence enforcement strategy to the data sharing characteristics. IEEE Trans. Parallel Distrib. Systems 6, 5 (May 1995), 470-481.
22. 22. KSR1 Principles of Operation Kendall Square Research Corporation, 1991.
23. 23. Mowry, T. C. Tolerating latency through software-controlled data prefetching Ph.D. dissertation, Department of Electrical Engineering, Stanford University, Mar. 1994.
24. 24. Chen, T.-F. Data prefetching for high-performance processors. Ph.D dissertation, Tech. Rep. 93-07-01, Department of Computer Science and Engineering, University of Washington, July 1993.
25. 25. Kroft, D. Lockup-free instruction fetch/prefetch cache organization. Proc. 8th Annual International Symposium on Computer Architecture. 1981, pp. 81-87.
26. 26. Kruskal, C. P., and Snir, M. The performance of multistage interconnection networks for multiprocessors. IEEE Trans. Comput. C-32, 12 (Dec. 1983), 1091-1098.
27. 27. Gupta, A., Weber, W.-D., and Mowry, T. Reducing memory and traffic requirements for scalable directory-based cache coherence schemes. Proc. 1990 International Conference on Parallel Processing. 1990, pp. I-312-321.
28. 28. Koufaty, D. A., et al. Data forwarding in scalable shared-memory multiprocessors. Proc. 1989 International Conference on Supercomputing. 1995, pp. 255-264.