Network Traffic Scheduling Algorithm for Application-Specific Architectures

  • Ronald P. BianchiniJr.
  • John Paul Shen


For many application-specific and mission-oriented multiple processor systems, the interprocessor communication is deterministic and can be specified at system inception. This specification can be automatically mapped onto a physical system using a network traffic scheduler. An iterative network traffic scheduler is presented which, given the arbitrary topology of the communication network, translates the deterministic communication into a network traffic routing pattern. Previous work has shown the existence of a network traffic scheduling algorithm based on a fluid-flow model that converges to an optimal solution. Issues of iteration complexity and convergence rate of the algorithm are discussed in this paper along with the overall methodology of application-specific architecture design. An upper bound on the traffic scheduling time can be determined. It is further shown that incremental traffic pattern changes can be more efficiently scheduled than total system rescheduling. Such incremental changes can model slowly-changing nondeterministic interprocessor communication. Hence, the algorithm presented in this paper can function as a (pseudo) dynamic traffic scheduler.


Traffic Flow Traffic Pattern Network Traffic Critical Path Traffic Volume 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Ben-Ari, Principles of Concurrent Programming, Prentice Hall, Englewood Cliffs, NJ, 1984.Google Scholar
  2. [2]
    A. Benveniste, P. Bournai, T. Gautier, P. Le Guernic, SIGNAL: A Data Flow Oriented Language for Signal Processing, Technical Report 378, Institut de Recherche en Informatique et Systems Aleatoires, March, 1985.Google Scholar
  3. [3]
    R. P. Bianchini, Jr and M. S. Schlansker, A High Performance Interconnect for Concurrent Signal Processing, In VLSI Signal Processing, pp. 39–49, IEEE, November, 1984.Google Scholar
  4. [4]
    R. P. Bianchini, Jr. and J. P. Shen, Automated Compilation of Interprocessor Communication for Multiple Processor Systems, In IEEE International Conference on Computer Design, IEEE, October, 1986.Google Scholar
  5. [5]
    R. P. Bianchini, Jr. and J. P. Shen, Interprocessor Traffic Scheduling Algorithm for Multiple-Processor Networks, IEEE Transactions on Computers,C-36(4):396–409, April, 1987.Google Scholar
  6. [6]
    R. P. Bianchini, Jr. and J. P. Shen, Complexity Considerations of a Network Traffic Scheduling Algorithm, Technical Report, Dept. of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburg, PA, 15213, July, 1987.Google Scholar
  7. [7]
    M. Breternitz Jr and J. P. Shen, ASPD: Application-Specific Processor Design, Technical Report, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburg, PA 15213, May, 1987.Google Scholar
  8. [8]
    M. A. Breuer (editor), Design Automation of Digital Systems, Prentice Hall, Englewood Cliffs, NJ, 1972.Google Scholar
  9. [9]
    T. Cobourn and M. Johnson, Data Switch Chip, Technical Report, Department of Electrical and Computer Engineering, Carnegie Mellon, Pittsburg, PA 15213, May, 1987.Google Scholar
  10. [10]
    G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.Google Scholar
  11. [11]
    L. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton Universty Press, Princeton, NJ, 1962.Google Scholar
  12. [12]
    N. H. Gehani abd W. D. Roome, Concurrent C, Technical Report, AT and T Bell Laboratories, Murray Hill, NJ, 1985.Google Scholar
  13. [13]
    S. H. Hosseini, J. G. Kuhl and S. M. Reddy, A Diagnosis Algorithm for Distributed Computing Systems with Dynamic Failure and Repair, IEEE Transactions on Computers, C-33(3):223–233, March, 1984.Google Scholar
  14. [14]
    K. Hwang, F. A. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill Book Company, New York, 1984.Google Scholar
  15. [15]
    J. L. Kennington and R. V. Helgason, Algorithms for Network Programming, J. Wiley, New York, NY 1980.Google Scholar
  16. [16]
    E. A. Lee and D. G. Messerschmitt, Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing, IEEE Transactions on Computers, C-36(1):24–35, January, 1987.Google Scholar
  17. [17]
    E. Minieka, Optimization Algorithms for Networks and Graphs, Marcel Dekker, Inc., New York, New York and Basel, 1978.Google Scholar
  18. [18]
    G. F. Newell, Traffic Flow on Transportation Networks, The MIT Press, Cambridge, Massachusetts, 1980.Google Scholar
  19. [19]
    M. A. Schuette and J. P. Shen, Processor Control Flow Monitoring Using Signature Instruction Streams, IEEE Transactions on Computers, C36(3):264–276, March, 1987.Google Scholar
  20. [20]
    B. Smith-Thomas, Managing I/O in Concurrent Programming: The Concurrent C Window Manager, Technical Report, University of North Carolina at Greensboro, Greensboro, N.C. 27412, 1985.Google Scholar
  21. [21]
    E. E. Swartzlander, Jr and G. Hallnor, High Spewed FFT Processor Implementation, In VLSI Signal Processing, pp. 27–34, IEEE, November, 1984.Google Scholar
  22. [22]
    R. E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.CrossRefGoogle Scholar
  23. [23]
    K. D. Wilkin and J. P. Shen, Embedded Signature Monitoring: Analysis and Technique, In International Test Conference, September, 1987.Google Scholar

Copyright information

© Plenum Press, New York 1988

Authors and Affiliations

  • Ronald P. BianchiniJr.
    • 1
  • John Paul Shen
    • 1
  1. 1.Carnegie Mellon UniversityPittsburghUSA

Personalised recommendations