Resource-Constrained Algebraic Transformation for Loop Pipelining

Authors:
Jian-Feng Shi;Liang-Fang Chao
Affiliations:
-;-
Venue:
GLSVLSI '96 Proceedings of the 6th Great Lakes Symposium on VLSI
Year:
1996

Citing 0
Cited 3

Efficient algorithms for debugging timing constraint violations

Proceedings of the 8th ACM/IEEE international workshop on Timing issues in the specification and synthesis of digital systems
A strongly polynomial-time algorithm for over-constraint resolution: efficient debugging of timing constraint violations

Proceedings of the tenth international symposium on Hardware/software codesign
Provably efficient algorithms for resolving temporal and spatial difference constraint violations

ACM Transactions on Design Automation of Electronic Systems (TODAES)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Loop pipelining can be applied to a cyclic data-flow graph to reduce the iteration bound, which is the maximum computation-time-to-delay ratio among all the cycles in the data flow graph. Algebraic transformations can reduce the iteration bound substantially. However, resource constrained algebraic transformations for loop pipelining remains a hard problem because of the inherent nature of loop pipelining. In this paper, we propose a new method based on distribution graphs to solve this problem. A novel algorithm for algebraic transformation with resource constraints is provided, which works for non-pipelined schedules as well. Experimental results show that our algorithm is promising.