Simulation of dynamic input buffer space in multistage interconnection networks

Citation
H. Diab et al., Simulation of dynamic input buffer space in multistage interconnection networks, ADV EN SOFT, 31(1), 2000, pp. 13-24
Citations number
11
Categorie Soggetti
Computer Science & Engineering
Journal title
ADVANCES IN ENGINEERING SOFTWARE
ISSN journal
09659978 → ACNP
Volume
31
Issue
1
Year of publication
2000
Pages
13 - 24
Database
ISI
SICI code
0965-9978(200001)31:1<13:SODIBS>2.0.ZU;2-D
Abstract
This paper presents a simulation study of a new dynamic allocation of input buffer space in multistage interconnection networks (MINs). MINs are compo sed of an interconnected set of switching elements (SEs), connected in a sp ecific topology. The SEs are composed of input and output buffers which are used to store received and forwarded packets, respectively. The performanc e of these networks depend on the design of these internal buffers and the clock mechanism in synchronous MINs. Various cycle models exist which inclu de the big cycle, small cycle and the smart cycle, each of which provides a more efficient cycle timing. The smart cycle model achieves a superior per formance by using output buffers and acknowledgement. However, it suffers f rom lost and out-of-order packets at high traffic loads. This paper, presen ts a variation of the smart cycle model, whereby, the input buffer space of each SE is allocated dynamically as a function of traffic load, in order t o overcome the above-mentioned drawbacks. A shared buffer pool is provided, which supplies the required input buffer space as required by each SE. Sim ulation results are presented, which show the required buffer pool for vari ous network sizes and for different network loads. Also, comparison with a static allocation scheme shows an increased network throughput, and the eli mination of lost and out-of-order packets at high traffic loads. (C) 2000 E lsevier Science Ltd. All rights reserved.