This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Automaton Model for Scheduling Constraints in Synchronous Machines
January 1995 (vol. 44 no. 1)
pp. 1-12

Abstract—We present a finite-state model for scheduling constraints in digital system design. We define a two-level hierarchy of finite-state machines: a behavior FSM's input and output events are partially ordered in time; a register-transfer FSM is a traditional FSM whose inputs and outputs are totally ordered in time. Explicit modeling of scheduling constraints is useful for both high-level synthesis and verification—we can explicitly search the space of register-transfer FSM's which implement a desired schedule. State-based models for scheduling are particularly important in the design of control-dominated systems. This paper describes the BFSM model, describes several important operations and algorithms on BFSM's and networks of communicating BFSM's, and illustrates the use of BFSM's in high-level synthesis.

[1] K. Keutzer,“Three competing design methodologies for ASIC's: Architectural synthesis, logic synthesis and module generation,”inProc., 26th Design Automat. Conf., ACM/IEEE, June 1989, pp. 308–313.
[2] C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall, Englewood Cliffs, N.J., 1985.
[3] M. A. Jackson,“Constructive methods of program design,”inJSP and JSD: The Jackson Approach to Software Development,second ed., J. Camerson, Ed. Washington, DC: IEEE Computer Society Press, 1989. Reprinted fromLecture Notes in Computer Science,vol. 44, 1976.
[4] M. C. McFarland, A. C. Parker, and R. Camposano,“The high-level synthesis of digital systems,”Proc. IEEE,vol. 78, pp. 301–318, Feb. 1990.
[5] D.L. Dietmeyer, Logic Design of Digital Systems, Allyn and Bacon, Boston, 1971.
[6] E. A. Snow,“Automation of module set independent register-transfer level design,”Ph.D. thesis, Carnegie-Mellon Univ., Apr. 1978.
[7] M. C. McFarland, S. J.,“The value trace: A database for automated digital design,”Master's thesis, Camegie-Mellon Univ., Dec. 1978.
[8] D. W. Knapp and A. C. Parker,“A data structure for VLSI synthesis and verification,”Tech. Rep., Comput. Res. Inst., Univ. of Southern California, Aug. 1985.
[9] A. Orailoglu and D.D. Gajski, "Flow Graph Representation," Proc. 23rd Design Automation Conf., IEEE CS Press, 1986, pp. 503-506.
[10] G. De Micheli and D. C. Ku.,“HERCULES—A system for high-level synthesis,”inProc. 25th Design Automat. Conf., ACM/IEEE, June 1988, pp. 483–498.
[11] R. Camposano and W. Rosenstiel,“Synthesizing circuits from behavioral descriptions,”IEEE Trans. Comput.-Aided Design of Integrat. Circ. Syst.,vol. 8, no. 2, pp. 171–180, Feb. 1989.
[12] R. Milner, Communication and Concurrency. Prentice Hall, 1989.
[13] W. Wolf,“The FSM network model for behavioral synthesis of control-dominated machines,”inProc. 27 Design Automat. Conf., ACM Press, June 1990, pp. 692–697.
[14] W. Wolf,“Automata-theoretic aids to scheduling,”inVLSI Logic Synthesis and Design,R. W. Dutton, Ed. Amsterdam: IOS Press, 1991, Proc. Second Sasimi Workshop, Kyoto, Japan.
[15] ——,“Rescheduling for cycle time by reverse engineering,”inProc. ACM Tau '90 Workshop,Univ. of British Columbia, Aug. 1990.
[16] M. Leeser, A. Takach, and W. Wolf,“Behavior FSM's for high-level synthesis and verification,”inFormal Methods in VLSI Design,P. A. Subrahmanyam, Ed. New York: Springer-Verlag, 1991.
[17] J. S. Ostroff and W. M. Wonham,“Modeling, specifying and verifying real-time embedded computer systems,”inProc. Real-Time Syst. Symp., IEEE Computer Society Press, 1987, pp. 124–132.
[18] D. K. Probst and Hon F. Li,“Using partial-order semantics to avoid the state explosion problem in asynchronous systems,”in Robert Kurshan and E. M. Clarke, editors,Workshop on Computer-Aided Verification,DIMACS, 1990.
[19] S. Devadas and K. Keutzer,“An automata-theoretic approach to behavioral equivalence,”inProc. ICCAD-90, IEEE Computer Society Press, 1990, pp. 30–33.
[20] S.-K. Chin and E. P. Stabler,“Synthesis of arithmetic hardware using hardware metafunctions,”IEEE Trans. Comput.-Aided Design of Integrat. Circ. Syst.,vol. 9, no. 8, pp. 793–803, Aug. 1990.
[21] G. M. Brown and M. E. Leeser,“Synthesizing correct sequential circuits,”inProceedings of the Ninth IFIP Symposium on Computer Hardware Description Languages and their Applications,J. A. Darringer and F. J. Rammig, Eds. Amsterdam: North-Holland, 1990, pp. 169–182.
[22] D. A. Basin, G. M. Brown, and M. E. Leeser,“Formally verified synthesis of combinational CMOS circuits,”inFormal VLSI Specification and Synthesis,L. J. M. Claesen, ed. Amsterdam: North-Holland, 1990, pp. 197–206.
[23] M. Aagaard and M. Leeser,“A formally verified system for logic synthesis,”inInt. Conf. Comput. Design,IEEE, Oct. 1991.
[24] S. D. Johnson, R. M. Wehrmeister, and B. Bose,“On the interplay of synthesis and verification,”inFormal VLSI Specification and Synthesis,L. J. M. Claesen, Ed. Amsterdam: North-Holland, 1990, pp. 117–136.
[25] R. Composano,“Behavior-preserving transformations for high-level synthesis,”inProceedings of the MSI Workshop on Hardware Specification, Verification and Synthesis: Mathematical Aspects. New York: Springer Verlag, 1990, LNCS 408, pp. 106–128.
[26] T. Amon and G. Borriello,“On the specification of timing behavior,”inProc. ACM Tau '90 Workshop,Aug. 1990.
[27] W. Wolf, A. Takach, C.-Y. Huang, R. Manno, and E. Wu,“The Princeton University Behavioral Synthesis System,”inProc. 29th Design Automation Conf.,IEEE Computer Society Press, 1992.
[28] R. Tarjan, "Data Structures and Network Algorithms," SIAM,Philadelphia, Penn., 1983.
[29] W. H. Wolf and A. E. Dunlop,“Symbolic layout and compaction,”inPhysical Design Automation of VLSI Systems,ch. 6, B. T. Preas and M. J. Lorenzetti, Eds. Menlo Park, CA: Benjamin-Cummings, 1988, pp. 211–281.
[30] Z. Kohavi,Switching and Finite Automata Theory,second ed. New York: McGraw-Hill, 1978.
[31] R. Lipsett, C. Schaefer, and C. Ussery, VHDL: Hardware Description and Design, Kluwer Academic Press, Norwell, Mass., 1989.
[32] A. Takach and W. Wolf,“Scheduling constraint generation for communicating processes,”submitted toIEEE Trans. VLSI Syst., preliminary version presented at 1992 ACM High-Level Synthesis Workshop, Dec. 1992.
[33] F. Corella,“Automated high level verification against clocked algorithmic specifications,”inProc. CHDL-93. New York: Elesevier Science, 1993, pp. 135–142.
[34] W. Wolf, A. Takach and T.-C. Lee,“Architectural optimization methods for control dominated machines,”inHigh-Level VLSI Synthesis, R. Composano and W. Wolf, Ed. New York: Kluwer Academic, 1991.
[35] M. Leeser,R. Chapman,M. Aagaard,M. Linderman,, and S. Meier,“High level synthesis and generating FPGAs with the BEDROC system,” J. of VLSI Signal Processing, vol. 6, no. 2, pp. 193-216, Aug. 1993.
[36] W. Wolf and R. Manno,“High-level modeling and synthesis of communicating processes using VHDL,”IEICE Trans. Inform. Syst.,vol. E76-D, no. 9, pp. 1039–1046, Sept. 1993.
[37] A. R. Takach and W. Wolf,“Modular scheduling constraint specification,”inProc. ISCAS '92, IEEE Circ. and Syst. Soc., 1992.
[38] T.-Y. Yen and W. Wolf,“Optimal scheduling of finite-state machines,”inProc. ICCD '93. Washington, DC: IEEE Computer Society Press, 1993, pp. 366–369.
[39] W. Wolf,“Scheduling don't-cares,”Tech. Rep. CEW93-20, Princeton Univ. Comput. Eng., Preliminary version presented at the 1992 Int. Workshop on High-Level Synthesis., Feb. 1993.

Citation:
Andrés Takach, Wayne Wolf, Miriam Leeser, "An Automaton Model for Scheduling Constraints in Synchronous Machines," IEEE Transactions on Computers, vol. 44, no. 1, pp. 1-12, Jan. 1995, doi:10.1109/12.368014
Usage of this product signifies your acceptance of the Terms of Use.