Abstract
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 illustrates 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 are 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
