Share Email Print

Proceedings Paper

Parallel Algorithm For Network Traffic Scheduling In Application-Specific Architectures
Author(s): Ronald P Bianchini Jr.; John Paul Shen
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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. However, this algorithm assumes an external host that performs centralized scheduling. This paper presents a parallel version of the algorithm which can be executed in a parallel fashion by the network switching nodes themselves without requiring an external host. Hence, using such an algorithm a communication network can perform self scheduling of interprocessor traffic. Furthermore, with the self-scheduling capability, a network will be able to perform traffic routing and scheduling concurrently and on-line network reconfiguration.

Paper Details

Date Published: 20 April 1988
PDF: 26 pages
Proc. SPIE 0880, High Speed Computing, (20 April 1988); doi: 10.1117/12.944044
Show Author Affiliations
Ronald P Bianchini Jr., Carnegie Mellon University (United States)
John Paul Shen, Carnegie Mellon University (United States)

Published in SPIE Proceedings Vol. 0880:
High Speed Computing
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top