A bus arbitration scheme with smoothly-distributed waiting time

  • Sang-Man Moh
  • Suk-Han Yoon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1225)


A shared bus is a frequently-used interconnection channel, to which multiple masters can be connected. It is a single resource which can carry only one transaction at a time. So the protocol of shared buses must include a sequence of operations called arbitration which selects a unique commander. In this paper, we propose a coded self arbitration scheme that provides smoothly-distributed waiting time to all bus masters. In the proposed scheme, when there are more than one request on the shared bus, the bus master with the longest waiting time wins and the bus is allocated to the master. Each bus master requires a ⌈log2 n⌉-bit counter where n is the number of bus masters. And we have evaluated the proposed scheme and compared it with starvationfree arbitration schemes studied so far. According to our simulation, the proposed scheme shows the best distribution of waiting time reguardless of bus request rates.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. L. Dexter, Microcomputer Bus Structures and Bus Interface Design, pp.41–69, Marcel Dekker, New York, 1986.Google Scholar
  2. 2.
    D. Tabak, Multiprocessors, pp.67–102, Prentice Hall, Englewood Cliffs, New Jersey, 1990.Google Scholar
  3. 3.
    C. Y. Choi, K.-W. Rim, B. K. Park, and H. Shin, “Design and Performance of a Highly Pipelined Bus for Shared Memory Multiprocessor,” Proc. 20th EUROMI-CRO Conf., pp.451–456, Liverpool, England, Sep. 5–8, 1994.Google Scholar
  4. 4.
    D. Del Corso, H. Kirrman, and J. D. Nicoud, Microcomputer Buses and Links, pp.127–161, Academic Press, London, 1986.Google Scholar
  5. 5.
    G. Cioffi and P. Velardi, “A Fully Distributed Arbiter for Multiprocessor Systems,” Microprocessing and Microprogramming, Vol.11, No.1, pp.15–22, Jan. 1983.Google Scholar
  6. 6.
    W. W. Plummer, “Asynchronous Arbiters,” IEEE Trans. on Computers, Vol.C-21, No.1, pp.37–42, Jan. 1972.Google Scholar
  7. 7.
    A. B. Kovaleski, “High-Speed Bus Arbiter for Multiprocessors,” IEE Proc., Vol.130, Pt.E, No.2, pp.49–56, Mar. 1983.Google Scholar
  8. 8.
    D. M. Taub, “Arbitration and Control Acquisition in the Proposed IEEE 896 Futurebus,” IEEE Micro, Vol.4, No.4, pp.28–41, Aug. 1984.Google Scholar
  9. 9.
    D. E. Thomas and P. Moorby, The Verilog Hardware Description Language, pp.25–97, Kluwer Academic Publishers, Boston, 1991.Google Scholar
  10. 10.
    Cadence Design Systems, Inc., Verilog-XL Reference Manual, Vol.2, pp.23.1–24.62, Mar. 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Sang-Man Moh
    • 1
  • Suk-Han Yoon
    • 1
  1. 1.Electronics and Telecommunications Research InstituteTaejonKorea

Personalised recommendations