Categorizing network traffic in update-based protocols on scalable multiprocessors

Ricardo Bianchini, Thomas J. LeBlanc, Jack E. Veenstra

Research output: Contribution to journalConference article

Abstract

In this paper we categorize the coherence traffic in update-based protocols and show that, for most applications, more than 90% of all updates generated by the protocol are unnecessary. We identify application characteristics that generate useless update traffic, and compare the isolated and combined effects of several software and hardware techniques for eliminating useless updates. These techniques include dynamic and static hybrid protocols, a data re-mapping strategy, and coalescing write buffers. Our simulations show that these techniques are effective for different types of useless updates. Overall, software caching (where dynamic data re-mapping is performed under programmer or compiler control) has the potential to significantly increase the percentage of useful traffic in applications. When software caching is not applicable, either the static or the dynamic protocol generates the least useless traffic. Although coalescing write buffers provide great reductions in the total number of messages transferred, these buffers do not necessarily increase the percentage of useful traffic.

Original languageEnglish (US)
Pages (from-to)142-151
Number of pages10
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
StatePublished - Jan 1 1996
EventProceedings of the 1996 10th International Parallel Processing Symposium - Honolulu, HI, USA
Duration: Apr 15 1996Apr 19 1996

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this