Title :
Systolic algorithms for some scheduling and graph problems
Author :
Ibarra, Oscar H. ; Jiang, Tao ; Chang, Jik H. ; Palis, Michael A.
Author_Institution :
Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA
Abstract :
A simple model of a linear systolic array with serial input/output and one-way data communication is considered. It is shown that such an array can be used to solve some scheduling and graph problems efficiently. The systolic algorithms are developed in two stages. First an algorithm on a restricted type of sequential machine is constructed. Then the sequential machine algorithm is transformed into a systolic algorithm. The transformation can be done automatically and efficiently.<>
Keywords :
graph theory; parallel algorithms; scheduling; graph problems; linear systolic array; one-way data communication; scheduling; sequential machine; serial input/output; systolic algorithms; Bipartite graph; Clocks; Data communication; Fault tolerance; Job shop scheduling; Processor scheduling; Registers; Scheduling algorithm; Systolic arrays; Very large scale integration;
Conference_Titel :
Systolic Arrays, 1988., Proceedings of the International Conference on
Conference_Location :
San Diego, CA, USA
Print_ISBN :
0-8186-8860-2
DOI :
10.1109/ARRAYS.1988.18065
