Parallel Algorithm For Network Traffic Scheduling In Application-Specific Architectures

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.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. 116 / SPIE Vol. 880 High Speed Computing (1988) Downloaded From: http://proceedings.spiedigitallibrary.org/ on 06/20/2016 Terms of Use: http://spiedigitallibrary.org/ss/TermsOfUse.aspxapproach and the use of automated design tools ensures that these special -purpose systems can be cost -effectively designed and implemented.This methodology employs an architecture compilation procedure which performs the mapping from the target architecture, specifying the application, to a host architecture which is the customizable physical system. A key component of this compilation procedure is the task of scheduling and routing of interprocessor traffic in the communication network. The network traffic scheduler functions as the "...