The routing problem in transputer-based parallel systems

Abstract The availability of a robust and reliable routing support is of primary importance in transputer-based parallel systems. The difficulties in the design of such a software system lie mainly in the necessity of guaranteeing the absence of communication deadlocks between its component processes. Many techniques have recently been proposed in the literature for solving this problem, but until now they seem to have been rarely used in practical applications. The paper expounds the theory needed for setting up a general-purpose routing support. First, the essential features of a routing system are sketched and the main techniques and solutions available are briefly surveyed, highlighting their advantages and limits of applicability. Then a graphical representation of the program data exchanges, the I/O graph, which makes it possible to detect potential deadlock conditions, is introduced. Its application in the design of a deadlock-free routing system for squared mesh networks is given by way of an example. Finally, some transputer-dependent implementative issues are discussed, showing how to improve the routing support performance.

[1]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[2]  Charles L. Seitz,et al.  Concurrent VLSI Architectures , 1984, IEEE Transactions on Computers.

[3]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[4]  C. R. Jesshope,et al.  High performance communications in processor networks , 1989, ISCA '89.

[5]  John Wexler,et al.  Solving problems with transputers: background and experience , 1989, Microprocess. Microsystems.

[6]  Rob A. H. van Twist,et al.  A Novel Deadlock Free and Starvation Free Packet Switching Communication Processor , 1987, PARLE.

[7]  Bill Roscoe,et al.  Routing messages through networks: an exercise in deadlock avoidance , 1987 .

[8]  David May,et al.  The Transputer Implementation of Occam , 1984, Fifth Generation Computer Systems.

[9]  Corporate Inmos Limited.  Transputer instruction set - a compiler writer's guide , 1988 .

[10]  W. J. Dally,et al.  Finite-grain message passing concurrent computers , 1988, C3P.

[11]  Arie Shoshani,et al.  System Deadlocks , 1971, CSUR.

[12]  DAVID GELERNTER.  A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks , 1981, IEEE Transactions on Computers.

[13]  Alan Knowles,et al.  Message passing in a transputer system , 1989, Microprocess. Microsystems.

[14]  K. Gunther,et al.  Prevention of Deadlocks in Packet-Switched Data Transport Systems , 1981 .

[15]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.