ACM Home Page
Please provide us with feedback. Feedback
A multiaccess bus arbitration scheme for VLSI-densed distributed systems
Full text PdfPdf (893 KB)
Source AFIPS Joint Computer Conferences archive
Proceedings of the July 9-12, 1984, national computer conference and exposition table of contents
Las Vegas, Nevada
SESSION: Computer hardware and architectures table of contents
Pages 13-22  
Year of Publication: 1984
ISBN ~ ISSN:0095-6880 , 0-88283-043-0
Authors
Jie-Yong Juang  Purdue University, West Lafayette, Indiana
Benjamin W. Wah  Purdue University, West Lafayette, Indiana
Sponsor
AFIPS : American Federation of Information Processing Societies
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 30,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1499310.1499314
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Control Data Corporation. "Technical Information: Control Data Cyber-plus." News Release and Fact Sheet, Oct. 1983.
4
 
5
Baer, J. Computer Systems Architecture, Rockville, Md.: Computer Science Press, 1980.
 
6
7
 
8
Tobagi, F. A. "Multiaccess Protocols in Packet Communication Systems." IEEE Transactions on Communications, COM-28 (1980), pp. 468--488.
 
9
Wah, B. W. and Y. Y. Juang, "Load Balancing on Local Multiaccess Networks." Proceedings of 8th Conference on Local Computer Networks, Minneapolis, Minn.: IEEE, 1983, pp. 55--61.
 
10
Juang, J. Y., and B. W. Wah. "Unified Window Protocol for Local Multiaccess Networks." Proceedings of Third Annual Joint Conference of the IEEE Computer and Communications Societies. San Francisco, California: IEEE, 1984, pp. 97--104.
11
Collaborative Colleagues:
Jie-Yong Juang: colleagues
Benjamin W. Wah: colleagues