This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Interprocessor Traffic Scheduling Algorithm for Multiple-Processor Networks
April 1987 (vol. 36 no. 4)
pp. 396-409
R.P., Jr. Bianchini, Department of Electrical and Computer Engineering, Carnegie-Mellon University
Recent research on parallel systems has shown that the most difficult problem for system designers and users is interprocessor connection and communication. A methodology for the automated design and implementation of interprocessor communication for certain multiple-processor systems has been developed and is presented in this paper. For many application- specific and mission-oriented systems, the interprocessor communication is deterministic and can be specified at system inception. This specification can then be automatically mapped or complied onto a physical multiple-processor system using a network traffic scheduler. An algorithm for such a scheduler, which is capable of obtaining optimal network traffic patterns, has been developed. It is shown that the order of complexity of network scheduler components is polynomial, rather than expopential as in classical solutions.
Index Terms:
policy iteration optimization, Algorithmically oriented systems, application- specific systems, fixed topology distributed systems, multiple commodity fluid flow, network traffic scheduling
Citation:
R.P., Jr. Bianchini, J.P. Shen, "Interprocessor Traffic Scheduling Algorithm for Multiple-Processor Networks," IEEE Transactions on Computers, vol. 36, no. 4, pp. 396-409, April 1987, doi:10.1109/TC.1987.1676922
Usage of this product signifies your acceptance of the Terms of Use.