Software interleaving

Author

Bianchini, Ricardo ; Crovella, Mark E. ; Kontothanassis, Leonidas ; LeBlanc, Thomas J.

Author_Institution

Dept. of Comput. Sci., Rochester Univ., NY, USA

fYear

1994

fDate

26-29 Oct 1994

Firstpage

56

Lastpage

65

Abstract

We investigate the costs and benefits of implementing memory interleaving in software. As our main contribution, we compare software memory interleaving to row-major allocation and logarithmic broadcasting. Our analysis demonstrates the clear superiority of software interleaving over row-major allocation in the presence of memory contention. Our analysis also indicates that the choice between software interleaving and logarithmic broadcasting is less clear, as it depends both on the type of synchronization used and the number of processors. We conclude that, on large-scale multiprocessors, software memory interleaving and lock-based synchronization is the most effective combination for reducing memory contention in matrix computations

Keywords

multiprocessing systems; performance evaluation; synchronisation; large-scale multiprocessors; lock-based synchronization; logarithmic broadcasting; matrix computations; memory contention; memory interleaving; row-major allocation; software interleaving; synchronization; Bandwidth; Broadcasting; Computer science; Contracts; Hardware; Interleaved codes; Large-scale systems; Linear algebra; Multiprocessor interconnection networks; Scalability;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on

Conference_Location

Dallas, TX

Print_ISBN

0-8186-6427-4

Type

conf

DOI

10.1109/SPDP.1994.346181

Filename

346181