Understanding buffer management for cut-through 1D rings
Date
2004
Authors
Izu, M.
Beivide, R.
Editors
Danelutto, M.
Laforenza, D.
Vanneschi, M.
Laforenza, D.
Vanneschi, M.
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Euro-Par 2004 parallel processing : 10th International Euro-Par conference / Marco Danelutto, Domenico Laforenza, Marco Vanneschi (eds.), pp. 908-915
Statement of Responsibility
Cruz Izu and Ramon Beivide
Conference Name
International Euro-Par Conference (10th : 2004 : Pisa, Italy)
DOI
Abstract
This paper describes the impact that buffer management has on network performance for a cut-through 1D ring. Such network provides only one routing alternative between each pair of nodes. The network is kept simple to illustrate the significance of buffer management for all virtual cut-through networks. Besides, 2D and 3D torus, among other networks, can be seen as a collection of interlinked 1D rings. The simulation results will show that the key to maximum sustained throughput is to reserve half of our buffer capacity for transit packets. This increases link utilization by maximising packets at the sending node and empty buffers at the receiving node.
School/Discipline
Dissertation Note
Provenance
Description
The original publication is available at www.springerlink.com