DocumentCode :
1370199
Title :
An optimal systolic array for the algebraic path problem
Author :
Lewis, Paul S. ; Kung, Sun-Yuan
Author_Institution :
Los Alamos Nat. Lab., NM, USA
Volume :
40
Issue :
1
fYear :
1991
fDate :
1/1/1991 12:00:00 AM
Firstpage :
100
Lastpage :
105
Abstract :
A systolic array design for the algebraic path problem (APP) is presented that is both simpler and more efficient than previously proposed configurations. This array uses N2 orthogonally connected processing elements and requires 2N I/O connections. Total computation time is 5N-2, which is the minimum time possible in a systolic implementation. The data pipelining rate is one, so no pipeline interleave is required. For multiple problem instances a block pipeline rate of N can be achieved, which is optimal for an array of N2 processing elements
Keywords :
logic design; systolic arrays; algebraic path problem; optimal systolic array; orthogonally connected processing elements; processing elements; systolic implementation; Algorithm design and analysis; Automata; Computer architecture; Equations; Gaussian processes; Parallel processing; Pipeline processing; Shortest path problem; Systolic arrays; Very large scale integration;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.67325
Filename :
67325
Link To Document :
بازگشت