How can we design better networks for DSM systems?

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

Volumn 1417, Issue , 1998, Pages 171-184

  Dai, Donglai ^a   Panda, Dhabaleswar K ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN; MEMORY ARCHITECTURE; TOPOLOGY;

BENCHMARK SUITES; BISECTION BANDWIDTH; COHERENCE PROTOCOL; DISTRIBUTED SHARED MEMORY; FUTURE GENERATIONS; NETWORK CONTENTION; PARAMETERIZED MODEL; THREE-STEP APPROACH;

INTERCONNECTION NETWORKS (CIRCUIT SWITCHING);

EID: 84957365714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69352-1_15     Document Type: Conference Paper

References (14)

1. S. Chandra, J. R. Larus, and A. Rogers. Where is time spent in message-passing and shared-memory programs? In Proceedings of the sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI), pages 61-73, San Jose, CA, October 1994.
2. D. Dai and D. K. Panda. Reducing Cache Invalidation Overheads in Wormhole DSMs Using Multidestination Message Passing. In Proceedings of the International Conference on Parallel Processing, pages 1:138-145, Chicago, IL, Aug 1996.
3. D. Dai and D. K. Panda. How Can We Design Better Networks for DSM Systems? Technical Report OSU-CISRC-3/97-TR19, The Ohio State University, March 1997.
4. D. Dai and D. K. Panda. How Much Does Network Contention Affect Distributed Shared Memory Performance? In Proceedings of the International Conference on Parallel Processing, Chicago, IL, Aug 1997.
5. W. J. Dally. Performance Analysis of k-ary n-cube Interconnection Network. IEEE Transactions on Computers, pages 775-785, June 1990.
6. J. Duato, S. Yalamanchili, and L. Ni. Interconnection Networks: An Engineering Approach. The IEEE Computer Society Press, 1997.
7. D. Lenoski et al. The Directory-Based Cache Coherence Protocol for the DASH Multiprocessor. In Proceedings of the 17th, Annual International Symposium on Computer Architecture, pages 148-159, May 1990.
8. D. Lenoski et al. The Stanford DASH Multiprocessor. IEEE Computer, pages 63-79, March 1992.
9. J. Kuskin et al. The Stanford FLASH Multiprocessor. In Proceedings of the 21st Annual International Symposium on Computer Architecture, pages 302-313, 1994.
10. S. C. Woo et al. The SPLASH-2 Programs: Characterization and Methodological Considerations. In Proceedings of the 22nd Annual International Symposium on Computer Architecture, pages 24-36, 1995.
11. K. Gharachorloo et al. Memory Consistency and Event Ordering in Scalable Shared-memory Multiprocessors. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 15-26, May 1990.
12. J. L. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, 1990.
13. D. Kroft. Lockup-free instruction fetch/prefetch cache organization. In Proceedings of the 8th, Annual International Symposium on Computer Architecture, pages 81-85, 1981.
14. A. Rogers and Kai Li. Software support for speculative loads. In The Fifth International Symposium on Architectural Support for Programming Languages and Operating Systems (ASPLOS-V), pages 38-50, October 1992.