Title
Space-Time Representation of Iterative Algorithms and the Design of Regular Processor Arrays
Abstract
A novel space-time representation of iterative algorithms, which can be expressed in nested loop form and may include non-constant dependencies is proposed and a systematic methodology for their mapping onto regular processor arrays is presented. In contrast to previous design methodologies, the execution time of any variable instance is explicitly expressed in the Dependence Graph, by the construction of the Space-Time Dependence Graph (STDG). This approach avoids the uniformization step of the algorithm and the requirement for fully indexing the variables.
Year
DOI
Venue
1993
10.1109/ICPP.1993.167
ICPP
Keywords
Field
DocType
previous design methodology,novel space-time representation,execution time,regular processor array,systematic methodology,dependence graph,regular processor arrays,space-time representation,nested loop form,non-constant dependency,space-time dependence graph,iterative algorithm,iterative algorithms,process design,vectors,difference equations,algorithm design and analysis,parallel processing,very large scale integration
Space time,Uniformization (set theory),Computer science,Search engine indexing,Theoretical computer science,Very-large-scale integration,Distributed computing,Graph,Algorithm design,Parallel computing,Algorithm,Process design,Nested loop join
Conference
ISSN
ISBN
Citations 
0190-3918
0-8493-8983-6
1
PageRank 
References 
Authors
0.36
8
3
Name
Order
Citations
PageRank
Efstathios D. Kyriakis-bitzaros182.91
O. Koufopavlou225628.43
C. E. Goutis39714.78