Categorizing network traffic in update-based protocols on scalable multiprocessors

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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)
Title of host publicationIEEE Symposium on Parallel and Distributed Processing - Proceedings
PublisherIEEE
Pages142-151
Number of pages10
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 10th International Parallel Processing Symposium - Honolulu, HI, USA
Duration: Apr 15 1996Apr 19 1996

Other

OtherProceedings of the 1996 10th International Parallel Processing Symposium
CityHonolulu, HI, USA
Period4/15/964/19/96

Fingerprint

Hardware

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Bianchini, R., LeBlanc, T. J., & Veenstra, J. E. (1996). Categorizing network traffic in update-based protocols on scalable multiprocessors. In IEEE Symposium on Parallel and Distributed Processing - Proceedings (pp. 142-151). IEEE.

Categorizing network traffic in update-based protocols on scalable multiprocessors. / Bianchini, Ricardo; LeBlanc, Thomas J.; Veenstra, Jack E.

IEEE Symposium on Parallel and Distributed Processing - Proceedings. IEEE, 1996. p. 142-151.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bianchini, R, LeBlanc, TJ & Veenstra, JE 1996, Categorizing network traffic in update-based protocols on scalable multiprocessors. in IEEE Symposium on Parallel and Distributed Processing - Proceedings. IEEE, pp. 142-151, Proceedings of the 1996 10th International Parallel Processing Symposium, Honolulu, HI, USA, 4/15/96.
Bianchini R, LeBlanc TJ, Veenstra JE. Categorizing network traffic in update-based protocols on scalable multiprocessors. In IEEE Symposium on Parallel and Distributed Processing - Proceedings. IEEE. 1996. p. 142-151
Bianchini, Ricardo ; LeBlanc, Thomas J. ; Veenstra, Jack E. / Categorizing network traffic in update-based protocols on scalable multiprocessors. IEEE Symposium on Parallel and Distributed Processing - Proceedings. IEEE, 1996. pp. 142-151
@inproceedings{53104e17e3f64dc7b7c8f553469e09ab,
title = "Categorizing network traffic in update-based protocols on scalable multiprocessors",
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.",
author = "Ricardo Bianchini and LeBlanc, {Thomas J.} and Veenstra, {Jack E.}",
year = "1996",
language = "English (US)",
pages = "142--151",
booktitle = "IEEE Symposium on Parallel and Distributed Processing - Proceedings",
publisher = "IEEE",

}

TY - GEN

T1 - Categorizing network traffic in update-based protocols on scalable multiprocessors

AU - Bianchini, Ricardo

AU - LeBlanc, Thomas J.

AU - Veenstra, Jack E.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029698985&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029698985&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0029698985

SP - 142

EP - 151

BT - IEEE Symposium on Parallel and Distributed Processing - Proceedings

PB - IEEE

ER -