A comparative analysis of different arbitration protocols for multiple-bus multiprocessors

Earlier performance studies of multiple-bus multiprocessor systems assume a random selection of competing requests for bus assignment and ignore the effects of realistic bus arbitration schemes on the performance of such systems. In this paper, we present performance analysis of the multiple-bus sys...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer science and technology 1996-05, Vol.11 (3), p.313-325
Hauptverfasser: Chung, Chi-Ming, Chiang, Ding-An, Yang, Qing
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Earlier performance studies of multiple-bus multiprocessor systems assume a random selection of competing requests for bus assignment and ignore the effects of realistic bus arbitration schemes on the performance of such systems. In this paper, we present performance analysis of the multiple-bus systems with different arbitration protocols. The priority protocols considered are random selection, fixed priority, rotating priority, round-robin and FIFO. Analytical models are developed for each of these five different priority protocols. Each of our analyses models exactly the behavior of the corresponding priority protocol with little computation cost. The analytical models are validated through extensive simulations and are then used to carry out performance analysis and comparison of different priority protocols. Numerical results obtained from our models show that the round-robin protocol performs the best among the five protocols in the system with a few buses.
ISSN:1000-9000
1860-4749
DOI:10.1007/BF02943137