An Architecture for a Local Network Providing Multiple Supercomputer Access

Abstract An architecture for a non-homogeneous local network cormecting a large number of users(workstations) to a numberofservers (some of them supercomputers) is described in this paper.A connecdonless communication model is assumed and a high speed broadcast channel is used asthe imerconnection network among the servers and the users of the network. The AvailabilityDriven Multiple Access Architecture is based upon the correlation of the channel allocationstrategy with server availability, by means of scheduling protocols. A scheduling protocoldefines a communication discipline in which servers capable ofproviding services, compete forconttol of the communication channel by using a multiple access algorithm in one of thefollowing classes: random, limited contention or contention free multi-access.When in controlofthe channel, a serverperforms a sequence ofdifferent activities, including a broadcastmessageofits willingness to provide certain types ofservices, thus inviting all users to send their servicerequests. Then, a multi-accessalgoriilim is used to give each user a chance to send its request tothe remote server.

[1]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

[2]  J. Massey Collision-Resolution Algorithms and Random-Access Communications , 1981 .

[3]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

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

[5]  F. G. Foster On the Stochastic Matrices Associated with Certain Queuing Processes , 1953 .

[6]  Wojciech Szpankowski,et al.  Stability Problems in Local Area Networks: A Qualitative Approach , 1985 .

[7]  Paul J. Kühn,et al.  Comparison of Communication Services with Connection-Oriented and Connectionless Data Transmission , 1985, MMB.

[8]  Philippe A. Janson,et al.  Connection-oriented versus connectionless protocols: A performance study , 1985, IEEE Transactions on Computers.

[9]  P. J. Kuehn,et al.  Multiqueue systems with nonexhaustive cyclic service , 1979, The Bell System Technical Journal.

[10]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[11]  Leonard Kleinrock,et al.  On queueing problems in random-access communications , 1985, IEEE Trans. Inf. Theory.

[12]  R. Tweedie The existence of moments for stationary Markov chains , 1983, Journal of Applied Probability.

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