DocumentCode :
1589520
Title :
A framework for algebraic transformations in iterative algorithms
Author :
Shi, Jian-Feng ; Chao, Liang-Fang
Author_Institution :
Dept. of Electr. Eng. & Comput. Eng., Iowa State Univ., Ames, IA, USA
Volume :
4
fYear :
1996
Firstpage :
604
Abstract :
An iterative algorithm can be modeled by a cyclic data-flow graph. The bottleneck for scheduling cyclic data-flow graphs lies on dependencies that form cycles. The maximum computation-time-to-delay ratio among all the cycles in the graph, gives a lower bound on pipeline schedule length. In this paper, a framework for algebraic transformations is proposed to reduce the lower bound. A novel algorithm is proposed to apply transformations within iterations or over iteration boundaries. A set of beneficial transformations are chosen, and applied simultaneously in each pass of the algorithm. A measure of criticalness on loops is used to identify transformations leading to potential lower bound reduction. Experimental results show that substantial reductions on the lower bound are achieved, and shorter pipelined schedules are generated
Keywords :
iterative methods; algebraic transformations; cyclic data-flow graph; iterative algorithms; lower bound reduction; pipelined schedules; scheduling; Chaos; Data engineering; Delay; Flow graphs; Iterative algorithms; Pipeline processing; Processor scheduling; Signal processing algorithms; Throughput; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1996. ISCAS '96., Connecting the World., 1996 IEEE International Symposium on
Conference_Location :
Atlanta, GA
Print_ISBN :
0-7803-3073-0
Type :
conf
DOI :
10.1109/ISCAS.1996.542096
Filename :
542096
Link To Document :
بازگشت