Access Restriction

Author Wang, Randolph Y. ♦ Culler, David E. ♦ Krishnamurthy, Arvind ♦ Anderson, Thomas E. ♦ Martin, Richard P.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract In this paper, we study how to minimize the latency of a message through a network that consists of a number of store-and-forward stages. This research is especially relevant for today's low overhead communication systems that employ dedicated processing elements for protocol processing. We develop an abstract pipeline model that reveals a crucial performance tradeoff involving the effects of the overhead of the bottleneck stage and the bandwidth of the remaining stages. We exploit this tradeoff to develop a suite of fragmentation algorithms designed to minimize message latency. We also provide an experimental methodology that enables the construction of customized pipeline algorithms that can adapt to the specific system characteristics and application workloads. By applying this methodology to the Myrinet-GAM system, we have improved its latency by up to 51%. Our theoretical framework is also applicable to pipelined systems beyond the context of high speed networks.
Description Affiliation: Computer Science Division, University of California, Berkeley (Wang, Randolph Y.; Krishnamurthy, Arvind; Martin, Richard P.; Culler, David E.) || Department of Computer Science and Engineering, University of Washington, Seattle (Anderson, Thomas E.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2014-01-10
Publisher Place New York
Journal ACM SIGMETRICS Performance Evaluation Review (PERV)
Volume Number 26
Issue Number 1
Page Count 11
Starting Page 22
Ending Page 32

Open content in new tab

   Open content in new tab
Source: ACM Digital Library