Analysis of interconnection networks with different arbiter designs
โ Scribed by Laxmi N. Bhuyan
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 995 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
โฆ Synopsis
In performance evaluation of interconnection networks, it is usually assumed that in the event of conflicts a request is accepted with equal probability. This paper ilhrstrates that this arbitration policy discriminates against remote or less frequent requests because it rejects them most of the time. A favorite memory environment is considered as an example and the network performance under various arbitration policies is examined. Policies of equal acceptance and priority to favorite and nonfavorite requests arc examined by defining three probabilities of acceptance. The networks considered are crossbar, multiple-bus, and multistage interconnection networks. For these networks arbiter designs that incorporate the priorities are presented. 0 1987 Academic Res$ Inc.
๐ SIMILAR VOLUMES
## Abstract Although cache control mechanisms for use in multiprocessors that use a multistage interconnection network (MIN) as the interconnecting network have been proposed in which a directory or the cache itself is built into the switches in the MIN, the structure of the switches in these metho