This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Automata-Based Symbolic Scheduling for Looping DFGs
March 2001 (vol. 50 no. 3)
pp. 250-267

Abstract—This paper presents an exact technique for scheduling looping data-flow graphs that implicitly supports functional pipelining and loop winding. Automata-based symbolic modeling provides efficient representation of all causal executions of a given behavioral description subject to finite state bounds. Since a complete set of scheduling solutions is found, further incremental refinements, such as sequential interface protocol constraints, can be easily accommodated. Efficiency in the implementation is maintained by careful formulation of the automata and by judicious exploration techniques. Results are presented for traditionally referenced benchmarks, several large synthetic benchmarks, and a practical industrial example.

[1] L.-F. Chao, A. LaPaugh, and E. Sha, “Rotation Scheduling: A Loop Pipelining Algorithm,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 16, no. 3, pp. 229-239, Mar. 1997.
[2] R. MacGregor and M. H. Burstein,“Using a description classifier to enhance knowledge representation,”IEEE Expert, vol. 6, pp. 41–46, 1991.
[3] L. Dos Santos et al., “A Code-Motion Pruning Technique for Global Scheduling,” ACM Trans. Design Automation of Electronic Systems, vol. 5, no. 3, pp. 1-33, Jan. 2000.
[4] C.H. Gebotys, “Throughput Optimized Architectural Synthesis,” IEEE Trans. VLSI Systems, vol. 1, no. 3, pp. 254-261, Sept. 1993.
[5] E. Girczyc, “Loop Winding—A Data Flow Approach to Functional Pipelining,” Proc. Int'l Symp. Circuits and Systems, pp. 382-385, 1987.
[6] G. Goossens, J. Vandewalle, and H. De Man, "Lopp Optimization in Register-Transfer Scheduling for DSP-Systems," Proc. ACM/IEEE Design Automation Conf., 1989.
[7] S. Haynal and F. Brewer, “Efficient Encoding for Exact Symbolic Automata-Based Scheduling,” Proc. IEEE Int'l Conf. Computer-Aided Design, pp. 477-481, 1998.
[8] S. Haynal and F. Brewer, “Model for Scheduling Protocol-Constrained Components and Environments,” Proc. 36th ACM/IEEE Design Automation Conf., pp. 292-295, 1999.
[9] S. Haynal, “Automata-Based Symbolic Scheduling,” PhD dissertation, Dept. of Electrical and Computer Eng., Univ. of California, Santa Barbara, 2000.
[10] G. Hachtel and F. Somenzi, Logic Synthesis and Verification Algorithms. Kluwer Academic, 1996.
[11] http://bears.ece.ucsb.eduHome.html.
[12] C.-T. Hwang, J.-H. Lee, and Y.-C. Hsu, “Zone Scheduling,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 12, no. 7, pp. 926-934, July 1993.
[13] G. Lakshminarayana, K.S. Khouri, and N.K. Jha, “Wavesched: A Novel Scheduling Technique for Control-Flow Intensive Designs,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 18, no. 5, pp. 505-523, May 1999.
[14] T.-F. Lee, A.C.-H. Wu, D.D. Gajski, and Y.-L. Lin, “A Transformation-Based Method for Loop Folding,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 13, no. 4, pp. 439-450, Apr. 1994.
[15] D.J. Mallon and P.B. Denyer, “A New Approach to Pipeline Optimisation,” Proc. European Design Automation Conf. (EDAC-90), pp. 83-88, 1990.
[16] C. Monahan and F. Brewer, “Scheduling and Binding Bounds for RT-Level Symbolic Execution,” Proc. IEEE Int'l Conf. Computer-Aided-Design, pp. 230-235, 1997.
[17] P.G. Paulin and J.P. Knight, "Force-Directed Scheduling for the Behavioral Synthesis of ASIC's," IEEE Trans. Computer-Aided Design, vol. 8, June 1989.
[18] M. Potkonjakk and J. Rabaey, “Optimizing Resource Utilization Using Transformations,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 13, no. 3, pp. 277-292, Mar. 1994.
[19] I. Radivojevic and F. Brewer, “A New Symbolic Technique for Control-Dependent Scheduling,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 15, no. 1, pp. 45-57, Jan. 1996.
[20] I. Radivojevic, “Symbolic Scheduling Techniques,” PhD dissertation, Dept. of Electrical and Computer Eng., Univ. of California, Santa Barbara, 1996.
[21] F. Sanchez and J. Cortadella, “Time-Constrained Loop Pipelining,” Proc. IEEE Int'l Conf. Computer-Aided Design, pp. 592-596, 1995.
[22] A. Takach and W. Wolf, “An Automaton Model for Scheduling Constraints in Synchronous Machines,” IEEE Trans. Computers, vol. 44, no. 1, pp. 1-12, Jan. 1995.
[23] C.-Y. Wang and K. Parhi, “High-Level DSP Synthesis Using Concurrent Transformations, Scheduling, and Allocation,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 14, no. 3, pp. 274-295, Mar. 1995.
[24] J.C.-Y. Yang, G. De Micheli, and M. Damiani, “Scheduling and Control Generation with Environmental Constraints Based on Automata Representations,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, pp. 166-183, Feb. 1996.

Index Terms:
Scheduling, loop pipelining, Binary Decision Diagrams, high-level synthesis, nondeterminism, automata, symbolic model.
Citation:
Steve Haynal, Forrest Brewer, "Automata-Based Symbolic Scheduling for Looping DFGs," IEEE Transactions on Computers, vol. 50, no. 3, pp. 250-267, March 2001, doi:10.1109/12.910815
Usage of this product signifies your acceptance of the Terms of Use.