Resource scheduling for local computer systems with a multiaccess network

A study of resource scheduling based on a distributed state-dependent discipline for a system of processors connected by a local multiaccess network is made. The scheduling problem is reduced to the identification of the extremum from a set of physically dispersed random numbers. The authors propose an efficient method of utilizing the primitive operations of collision detection and broadcast in multiaccess networks to efficiently distribute status information and to identify the extremum. The optimal performance of extremum identification is found to be constant and on the average independent of the number of contending processors. The protocol can be implemented either by minor hardware modification of existing multiaccess-network interfaces or in software.

[1]  Walter H. Kohler,et al.  Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System , 1979, IEEE Transactions on Computers.

[2]  William R. Franta,et al.  An Efficient Collision-Free Protocol for Prioritized Access-Control of Cable or Radio Channels , 1983, Comput. Networks.

[3]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part I - Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics , 1975, IEEE Transactions on Communications.

[4]  Donald F. Towsley,et al.  Window Random Access Protocols for Local Computer Networks , 1982, IEEE Transactions on Computers.

[5]  Benjamin W. Wah.  A Comparative Study of Distributed Resource Sharing on Multiprocessors , 1984, IEEE Trans. Computers.

[6]  David D. Redell,et al.  Evolution of the Ethernet Local Computer Network , 1982, Computer.

[7]  Yechiam Yemini,et al.  Multiple-access protocols and time-constrained communication , 1984, CSUR.

[8]  Kai Hwang,et al.  A Unix-Based Local Computer Network with Load Balancing , 1982, Computer.

[9]  Donald F. Towsley,et al.  Queuing Network Models with State-Dependent Routing , 1980, JACM.

[10]  Benjamin W. Wah,et al.  Design of Distributed Databases on Local Computer Systems with a Multiaccess Network , 1985, IEEE Transactions on Software Engineering.

[11]  Donald F. Towsley,et al.  Random Multiple-Access Communication and Group Testing , 1984, IEEE Trans. Commun..

[12]  J. Capetanakis,et al.  Generalized TDMA: The Multi-Accessing Tree Protocol , 1979, IEEE Trans. Commun..

[13]  Nachum Shacham.  A Protocol for Preferred Access in Packet-Switching Radio Networks , 1983, IEEE Trans. Commun..

[14]  Pierre A. Humblet,et al.  A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels , 1985, IEEE Trans. Commun..

[15]  Aloysius K. Mok,et al.  Distributed Broadcast Channel Access , 1979, Comput. Networks.

[16]  K. Arrow,et al.  On Partitioning a Sample with Binary-Type Questions in Lieu of Collecting Observations , 1981 .

[17]  Lionel M. Ni,et al.  Prioritizing packet transmission in local multiaccess networks , 1983, SIGCOMM 1983.

[18]  Donald F. Towsley,et al.  On Adaptive Tree Polling Algorithms , 1984, IEEE Trans. Commun..

[19]  Robert Metcalfe,et al.  Ethernet: distributed packet switching for local computer networks , 1976, CACM.

[20]  M. Sobel,et al.  Group testing to eliminate efficiently all defectives in a binomial sample , 1959 .

[21]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[22]  Mischa Schwartz,et al.  A Family of Window Protocols for Time Constrained Applications in CSMA Networks , 1983, INFOCOM.

[23]  Fouad A. Tobagi,et al.  Carrier Sense Multiple Access with Message-Based Priority Functions , 1982, IEEE Trans. Commun..

[24]  John Ippocratis Capetanakis.  The multiple access broadcast channel : protocol and capacity considerations. , 1977 .

[25]  J. Hayes,et al.  An Adaptive Technique for Local Distribution , 1978, IEEE Trans. Commun..