A multiaccess bus arbitration scheme for VLSI-densed distributed systems

  • Authors:
  • Jie-Yong Juang;Benjamin W. Wah

  • Affiliations:
  • Purdue University, West Lafayette, Indiana;Purdue University, West Lafayette, Indiana

  • Venue:
  • AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

A VLSI-densed shared-bus distributed system is a computer system consisting of a large number of VLSI processing units (VPUs) connected to one another by a high-speed bus. Data traffic in such a system is characterized by three distinct features: large population, bursty transmission, and task-dependent accesses with priority. A bus arbitration scheme is required to resolve contentions when several VPUs generate requests simultaneously. Conventional schemes such as daisy chaining, polling, and independent requests are shown to be inadequate. In this paper, a multiaccess code-deciphering (MACD) scheme is proposed. Two versions of the scheme are studied. The first version is a load-dependent scheme that can resolve contentions of N VPUs in an average time of O(logK/2N) steps where K is equal to the bus width. The second version estimates the number of contending VPUs and resolves contention in a constant average time independent of load. The proposed schemes can support task-dependent accesses with priority.