Categorizing network traffic in update-based protocols on scalable multiprocessors

Categorizes the coherence traffic in update-based protocols and shows that, for most applications, more than 90% of all updates generated by such a protocol are unnecessary. We identify application characteristics that generate useless update traffic, and compare the isolated and combined effects of...

Full description

Saved in:
Bibliographic Details
Main Authors: Bianchini, R., LeBlanc, T.J., Veenstra, J.E.
Format: Conference Proceeding
Language:English
Subjects:
Application software
Character generation
Hardware
Program processors
Programming profession
Protocols
Software performance
Telecommunication traffic
Traffic control
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Categorizes the coherence traffic in update-based protocols and shows that, for most applications, more than 90% of all updates generated by such a 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.
DOI:10.1109/IPPS.1996.508050