Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/29534
Citations | ||
Scopus | Web of ScienceĀ® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Understanding buffer management for cut-through 1D rings |
Author: | Izu, M. Beivide, R. |
Citation: | Euro-Par 2004 parallel processing : 10th International Euro-Par conference / Marco Danelutto, Domenico Laforenza, Marco Vanneschi (eds.), pp. 908-915 |
Publisher: | Springer |
Publisher Place: | Berlin, Germany |
Issue Date: | 2004 |
Series/Report no.: | Lecture notes in computer science, 3149 |
ISBN: | 3540229248 |
ISSN: | 0302-9743 1611-3349 |
Conference Name: | International Euro-Par Conference (10th : 2004 : Pisa, Italy) |
Editor: | Danelutto, M. Laforenza, D. Vanneschi, M. |
Statement of Responsibility: | Cruz Izu and Ramon Beivide |
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. |
Description: | The original publication is available at www.springerlink.com |
DOI: | 10.1007/b99409 |
Published version: | http://www.springerlink.com/content/h8763an499hpqnub/ |
Appears in Collections: | Aurora harvest 2 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.