Optimal code size reduction for software-pipelined and unfolded loops

Authors:
Qingfeng Zhuge;Bin Xiao;Zili Shao;Edwin H.-M. Sha;Chantana Chantrapornchai
Affiliations:
University of Texas at Dallas, Richardson, Texas;University of Texas at Dallas, Richardson, Texas;University of Texas at Dallas, Richardson, Texas;University of Texas at Dallas, Richardson, Texas;Silpakorn University, Nakorn Pathom, Thailand
Venue:
Proceedings of the 15th international symposium on System Synthesis
Year:
2002

Citing 6
Cited 0

Software pipelining: an effective scheduling technique for VLIW machines

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Code generation schema for modulo scheduled loops

MICRO 25 Proceedings of the 25th annual international symposium on Microarchitecture
Static scheduling for synthesis of DSP algorithms on various models

Journal of VLSI Signal Processing Systems
Optimizing Overall Loop Schedules Using Prefetching and Partitioning

IEEE Transactions on Parallel and Distributed Systems
Minimizing Average Schedule Length under Memory Constraints by Optimal Partitioning and Prefetching

Journal of VLSI Signal Processing Systems
Scheduling Data-Flow Graphs via Retiming and Unfolding

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Software pipelining and unfolding are commonly used techniques to increase parallelism for DSP applications. However, these techniques expand the code size of the application significantly. For most DSP systems with limited memory resources, code size becomes one of the most critical concerns for the high-performance applications. In this paper, we present the code size reduction theory based on retiming and unfolding concepts. We propose a code size reduction framework to achieve the optimal code size of software-pipelined and unfolded loops by using conditional registers. The experimental results on several well-know benchmarks show the effectiveness of our code size reduction technique in controlling the code size of optimized loops.