This Article 
 Bibliographic References 
 Add to: 
A Contention-Based Bus-Control Scheme for Multiprocessor Systems
September 1991 (vol. 40 no. 9)
pp. 1046-1053

The authors study contention-based bus-control schemes for scheduling processors in using a bit-parallel shared bus. The protocol is designed under the requirements that each processor exhibit a random access behavior, that there be no centralized bus control in the system, and that access be granted in real time. The proposed scheme is based on splitting algorithms used in conventional contention-resolution schemes, and utilizes two-state information obtained from collision detection. Two versions of the bus-control scheme are studied. The static one resolves contentions of N requesting processors in an average of O(log/sub W/2/N) iterations, where W is the number of bits in the bit-parallel bus. An adaptive version resolves contentions in an average time that is independent of N.

[1] D. Bersekas and R. Gallager,Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987.
[2] S. H. Bokhari, "Finding maximum on an array processor with a global bus,"IEEE Trans. Comput., vol. C-33, pp. 133-139, Feb. 1984.
[3] J. I. Capetanakis, "Tree algorithms for packet broadcast channels,"IEEE Trans. Inform. Theory, vol. IT-25, pp. 505-515, Sept. 1979.
[4] I. Chlamtac and W. R. Franta, "Message-based priority access to local networks,"Comput. Commun., vol. 3, no. 2, pp. 77-84, Apr. 1980.
[5] R. Dechter and L. Kleinrock, "Broadcast Communications and Distributed Algorithms,"IEEE Trans. Comput., vol. C-35, pp. 210-219, Mar. 1986.
[6] Institute of Electrical and Electronics Engineers, "Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Local Area Network," ANSI/IEEE Std. 802.3, 1985.
[7] K.P. Eswaran, V.C. Hamacher, and G. S. Shedler, "Collision-free access control for computer communication bus networks,"IEEE Trans. Software Eng., vol. SE-7, Nov. 1981.
[8] M. Fine and F. A. Tobagi, "Demand assignment multiple access schemes in broadcast bus local area networks,"IEEE Trans. Comput., vol. C-33, pp. 1130-1159, Dec. 1984.
[9] J. F. Hayes,Modeling and Analysis of Computer Communication Networks. New York: Plenum, 1984.
[10] M. G. Hluchyj, "Multiple access communication: The finite user population problem," Tech. Rep. LIDS-TH-1162, Massachusetts Instit. of Technol., Cambridge, MA, Nov. 1981.
[11] J. Y. Juang and B. W. Wah, "A multiaccess bus-arbitration scheme for VLSI-densed distributed systems", inProc. Nat. Comput. Conf., July 1984, pp. 13-22, AFIPS Press.
[12] J. Y. Juang, "Resource allocation in computer networks," Ph.D dissertation, School of Elec. Eng., Purdue Univ., West Lafayette, IN, Aug. 1985.
[13] J. Y. Juang and C. C. Lee, "A maximum a priori estimation of channel laod," inProc. Princeton Conf. Inform. Sci. Syst., Mar. 1986.
[14] J. Y. Juang and B. W. Wah, "A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback,"Inform. Sci., vol. 48, no. 3, pp. 253-287, 1989.
[15] J. W. Mark, "Distributed scheduling conflict-free multiple access for local area communications networks,"IEEE Trans. Commun., vol. COM-28, pp. 1968-1976, Dec. 1980.
[16] R. M. Metcalfe and D. R. Boggs, "Ethernet: Distributed packet switching for local computer networks,"Commun. ACM, vol. 19, no. 7, pp. 395-404, 1976.
[17] K. Mittal and A. Venetsanopoulos, "On the dynamic control of the urn scheme for multiple access broadcast communication systems,"IEEE Trans. Commun., vol. COM-29, pp. 962-970, July 1981.
[18] J. Moseley and P. Humblet, "A class of efficient contention resolution algorithms for multiple access channels,"IEEE Trans. Commun., vol. C-35, pp. 145-157, Feb. 1985.
[19] L. M. NI and X. Li, "A prioritized packet transmission in local multiaccess networks," inProc. 8th Data Commun. Symp., Oct. 1983, pp. 234-244.
[20] R. Rom and F. A. Tobagi, "Message-based priority function in local multiaccess communication systems,"Comput. Networks, pp. 273-286, 1981.
[21] Q. F. Stout, "Mesh connected computers with broadcasting,"IEEE Trans. Comput., vol. C-32, pp. 826-830, Sept. 1983.
[22] K. J. Thurberet al., "A systematic approach to the design of digital bussing structures," inProc. AFIPS Conf., vol. 41, AFIPS Press, 1972, pp. 719-740.
[23] F. A. Tobagi, "Carrier sense multiple access with message-based priority functions,"IEEE Trans. Commun., vol. COM-30, no. 1, pp. 185-200, Jan. 1982.
[24] B. W. Wah and J. Y. Juang, "Resource scheduling for local computer systems with a multiaccess network,"IEEE Trans. Comput., vol. C-34, pp. 1144-1157, Dec. 1985.
[25] B. W. Wah and Y. N. Lien, "Design of distributed databases on local computer systems with a multiaccess network,"IEEE Trans. Software Eng., vol. SE-11, pp. 606-619, July 1985.
[26] B. W. Wah and J. Y. Juang, "An efficient contention resolution protocol for local multiaccess networks," Patent 4630264, Filed Sept. 21, 1984, Granted Dec. 16, 1986.
[27] T. Znati and L. M. Ni, "A prioritized multiaccess protocol for distributed real-time applications," inProc. COMPSAC, 1987, pp. 324-331.

Index Terms:
contention-based; bus-control schemes; scheduling processors; bit-parallel; shared bus; computational complexity; multiprocessing systems; multiprocessor interconnection networks; scheduling.
J.-Y. Juang, B.W. Wah, "A Contention-Based Bus-Control Scheme for Multiprocessor Systems," IEEE Transactions on Computers, vol. 40, no. 9, pp. 1046-1053, Sept. 1991, doi:10.1109/12.83647
Usage of this product signifies your acceptance of the Terms of Use.