Software interleaving

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

Research output: Contribution to journalConference article

Abstract

In this paper, 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.

Original languageEnglish (US)
Pages (from-to)56-65
Number of pages10
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
StatePublished - Dec 1 1994
EventProceeedings of the 6th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA
Duration: Oct 26 1994Oct 29 1994

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Bianchini, R., Crovella, M. E., Kontothanassis, L., & LeBlanc, T. J. (1994). Software interleaving. IEEE Symposium on Parallel and Distributed Processing - Proceedings, 56-65.