The performance of parallel matrix algorithms on a broadcast-based architecture

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Due to advances in fiber-optics and very large scale integration (VLSI) technology, interconnection networks which allow multiple simultaneous broadcasts are becoming feasible. This paper summarizes one such multiprocessor architecture called the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus). It also presents enhancements to the network interface and the cache and directory controllers which support cache block combining, capture and prefetch, and allow complete overlap of processing time with the communication time due to compulsory misses. The paper uses two fundamental matrix algorithms to characterize the impact of each enhancement on performance. Cache miss analysis and results from the execution of these programs on a SOME-Bus simulator show that block capture and prefetch combined with an effective block replacement policy succeed in significantly reducing the miss rate due to compulsory misses as the cache size increases, while a similar increase of cache size in traditional architectures leaves the miss rate due to compulsory misses unaffected. Copyright © 2005 John Wiley & Sons, Ltd.

Cite

CITATION STYLE

APA

Katsinis, C., Hecht, D., Zhu, M., & Narravula, H. (2006). The performance of parallel matrix algorithms on a broadcast-based architecture. Concurrency and Computation: Practice and Experience, 18(3), 271–303. https://doi.org/10.1002/cpe.920

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free