Synchronous bus arbitration with constant logic per module

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A novel technique for distributed synchronous bus arbitration is presented in this paper. The proposed scheme is based on two orthogonal arbitration functions, one that employs bounded-weight binary codes, and another that employs unitary codes. This scheme trades off bus-width with arbitration-time and arbitration time and arbitration logic (per device) can be reduce by increasing bus width. Alternatively, this method allows the number of devices connected to a bus to be increased without changing the arbitration logic of each device (or the number of arbitration steps)., only the width of the arbitration bus must be increased in this case.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
PublisherPubl by IEEE
Pages35-41
Number of pages7
ISBN (Print)0818656026
Publication statusPublished - 1 Jan 1994
Externally publishedYes
EventProceedings of the 8th International Parallel Processing Symposium - Cancun, Mex
Duration: 26 Apr 199429 Apr 1994

Other

OtherProceedings of the 8th International Parallel Processing Symposium
CityCancun, Mex
Period26/4/9429/4/94

Fingerprint

Orthogonal functions
Binary codes

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Alnuweiri, H. (1994). Synchronous bus arbitration with constant logic per module. In Proceedings of the International Conference on Parallel Processing (pp. 35-41). Publ by IEEE.

Synchronous bus arbitration with constant logic per module. / Alnuweiri, Hussein.

Proceedings of the International Conference on Parallel Processing. Publ by IEEE, 1994. p. 35-41.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Alnuweiri, H 1994, Synchronous bus arbitration with constant logic per module. in Proceedings of the International Conference on Parallel Processing. Publ by IEEE, pp. 35-41, Proceedings of the 8th International Parallel Processing Symposium, Cancun, Mex, 26/4/94.
Alnuweiri H. Synchronous bus arbitration with constant logic per module. In Proceedings of the International Conference on Parallel Processing. Publ by IEEE. 1994. p. 35-41
Alnuweiri, Hussein. / Synchronous bus arbitration with constant logic per module. Proceedings of the International Conference on Parallel Processing. Publ by IEEE, 1994. pp. 35-41
@inproceedings{7b7b4edb224b43d2921aaad06941cc0b,
title = "Synchronous bus arbitration with constant logic per module",
abstract = "A novel technique for distributed synchronous bus arbitration is presented in this paper. The proposed scheme is based on two orthogonal arbitration functions, one that employs bounded-weight binary codes, and another that employs unitary codes. This scheme trades off bus-width with arbitration-time and arbitration time and arbitration logic (per device) can be reduce by increasing bus width. Alternatively, this method allows the number of devices connected to a bus to be increased without changing the arbitration logic of each device (or the number of arbitration steps)., only the width of the arbitration bus must be increased in this case.",
author = "Hussein Alnuweiri",
year = "1994",
month = "1",
day = "1",
language = "English",
isbn = "0818656026",
pages = "35--41",
booktitle = "Proceedings of the International Conference on Parallel Processing",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Synchronous bus arbitration with constant logic per module

AU - Alnuweiri, Hussein

PY - 1994/1/1

Y1 - 1994/1/1

N2 - A novel technique for distributed synchronous bus arbitration is presented in this paper. The proposed scheme is based on two orthogonal arbitration functions, one that employs bounded-weight binary codes, and another that employs unitary codes. This scheme trades off bus-width with arbitration-time and arbitration time and arbitration logic (per device) can be reduce by increasing bus width. Alternatively, this method allows the number of devices connected to a bus to be increased without changing the arbitration logic of each device (or the number of arbitration steps)., only the width of the arbitration bus must be increased in this case.

AB - A novel technique for distributed synchronous bus arbitration is presented in this paper. The proposed scheme is based on two orthogonal arbitration functions, one that employs bounded-weight binary codes, and another that employs unitary codes. This scheme trades off bus-width with arbitration-time and arbitration time and arbitration logic (per device) can be reduce by increasing bus width. Alternatively, this method allows the number of devices connected to a bus to be increased without changing the arbitration logic of each device (or the number of arbitration steps)., only the width of the arbitration bus must be increased in this case.

UR - http://www.scopus.com/inward/record.url?scp=0028058326&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028058326&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0028058326

SN - 0818656026

SP - 35

EP - 41

BT - Proceedings of the International Conference on Parallel Processing

PB - Publ by IEEE

ER -