Tutorial: Compiling concurrent languages for sequential processors

ACM Transactions on Design Automation of Electronic Systems

Volumn 8, Issue 2, 2003, Pages 141-187

  Edwards, Stephen A ^a  

^a MC 0401 ^*  (United States)

Author keywords

Code generation; Communication; Compilation; Concurrency; Dataflow; Discrete event; Esterel; Lustre; Partial evaluation; Petri nets; Sequential; Verilog

Indexed keywords

CODES (SYMBOLS); DATA FLOW ANALYSIS; LINGUISTICS; PETRI NETS; PROGRAM INTERPRETERS; SEMANTICS;

CODE GENERATION;

PROGRAM COMPILERS;

EID: 0037646914     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/762488.762489     Document Type: Review

References (73)

1. ACKAD, C. 1998. Software synthesis from Statechart models for real time systems. In Proceedings of the International Workshop on Distributed and Parallel Embedded Systems (DIPES). IFIP Conference Proceedings, vol. 155, Kluwer, Paderborn University, Germany, 73-84.
2. BALARIN, F., CHIODO, M., GIUSTO, P., HSIEH, H., JURECSKA, A., LAVAGNO, L., SANGIOVANNI-VINCENTELLI, A., SENTOVICH, E. M., AND SUZUKI, K. 1999. Synthesis of software programs for embedded control applications. IEEE Trans. Comput. Aided Des. Integ. Circ. Syst. 18, 6 (June), 834-849.
3. BENVENISTE, A., CASH, P., EDWARDS, S. A., HALBWACHS, N., GUERNIC, P. L., AND DE SIMONE, R. 2003. The synchronous languages 12 years later. Proc. IEEE 91, 1 (Jan.), 64-83.
4. BERRY, G. 1992. Esterel on hardware. Philosoph. Trans. Roy. Soc. London. Ser. A 339, 1652, Mechanized Reasoning and Hardware Design, 87-103.
5. BERRY, G. 1999. The constructive semantics of pure Esterel. Draft book.
6. BERRY, G. 2000. The Esterel v5 Language Primer. Centre de Mathématiques Appliquées. Part of the Esterel compiler distribution.
7. BERRY, G. AND COSSERAT, L. 1984. The ESTEREL synchronous programming language and its mathematical semantics. In Seminar on Concurrency, S. D. Brooks, A. W. Roscoe, and G. Winskel, Eds. Springer-Verlag, Heidelberg, 389-448.
8. BERRY, G. AND GONTHIER, G. 1992. The Esterel synchronous programming language: Design, semantics, implementation. Sci. Comput. Programm. 19, 2 (Nov.), 87-152.
9. BERTIN, V., POIZE, M., AND PULOU, J. 1999. Une nouvelle méthode de compilation pour le language ESTEREL [A new method for compiling the Esterel language]. In Proceedings of GRAISyHM-AAA (Lille, France).
10. BHATTACHARYYA, S. S., BUCK, J. T., HA, S., MURTHY, P. K., AND LEE, E. A. 1993. A scheduling framework for minimizing memory requirements of multirate DSP systems represented as dataflow graphs. In Proceedings of the IEEE Workshop on VLSI Signal Processing VI. The Institute of Electrical and Electronics Engineers (IEEE), Veldhoven, The Netherlands, 188-196.
11. BHATTACHARYYA, S.S., LEUPERS, R., AND MARWEDEL, P. 2000. Software synthesis and code generation for signal processing systems. IEEE Trans. Circ. Syst. - II: Analog Digital Signal Process. 47, 9 (Sept.), 849-875.
12. BHATTACHARYYA, S. S., MURTHY, P. K., AND LEE, E. A. 1996. Software Synthesis from Dataflow Graphs. Kluwer, Boston.
13. BHATTACHARYYA, S. S., MURTHY, P. K., AND LEE, E. A. 1999. Synthesis of embedded software from synchronous dataflow specifications. J. VLSI Signal Process Syst. 21, 2 (June), 151-166.
14. BILSEN, G., ENGELS, M., LAUWEREINS, R., AND PEPERSTRAETE, J. A. 1995. Cyclo-static data flow. In Proceedings of the IEEE International Conference on Acoustics, Speech, & Signal Processing (ICASSP) (Detroit), 3255-3258.
15. BOUSSINOT, F. AND DOUMENC, G. 1992. RC reference manual.
16. BRIAND, L. P. AND ROY, D. M. 1999. Meeting Deadlines in Hard Real-Time Systems: The Rate Monotonic Approach. IEEE Computer Society Press, New York.
17. BRYANT, R. E. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35, 8 (Aug.), 677-691.
18. BRZOZOWSKI, J. A. 1964. Derivatives of regular expressions. J. ACM 11, 4 (Oct.), 481-494.
19. BUCK, J. T. 1993. Scheduling dynamic dataflow graphs with bounded memory using the token flow model. PhD Thesis, University of California, Berkeley. Available as UCB/ERL M93/69.
20. BUCK, J. T. 1994. Static scheduling and code generation from dynamic dataflow graphs with integer-valued control streams. In Conference Record of the Twenty-Eighth Asilomar Conference on Signals, Systems & Computers. The Institute of Electrical and Electronics Engineers (IEEE), Pacific Grove, CA, 508-513.
21. CARDELLI, L. AND PIKE, R. 1985. Squeak: A language for communicating with mice. In Proceedings of the Twelfth ACM Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH) (San Francisco), ACM, New York.
22. CASPI, P., PILAUD, D., HALBWACHS, N., AND PLAICE, J. A. 1987. LUSTRE: A declarative language for programming synchronous systems. In ACM Symposium on Principles of Programming Languages (POPL) (Munich), ACM, New York.
23. CHIODO, M., GIUSTO, P., JURECSKA, A., LAVAGNO, L., HSIEH, H., SUZUKI, K., SANGIOVANNI-VINCENTELLI, A., AND SENTOVICH, E. 1995. Synthesis of software programs for embedded control applications. In Proceedings of the 32nd Design Automation Conference (San Francisco), ACM, New York, 587-592.
24. CORTADELLA, J., KONDRATYEV, A., LAVAGNO, L., MASSOT, M., MORAL, S., PASSERONE, C., WATANABE, Y., AND SANGIOVANNI-VINCENTELLI, A. 1999. Task generation and compile-time scheduling for mixed data-control embedded software. Tech. Rep. LSI-99-47-R, Department of Software, Universitat Politècnica de Catalunya. November.
25. CORTADELLA, J., KONDRATYEV, A., LAVAGNO, L., MASSOT, M., MORAL, S., PASSERONE, C., WATANABE, Y., AND SANGIOVANNI-VINCENTELLI, A. 2000. Task generation and compile-time scheduling for mixed data-control embedded software. In Proceedings of the 37th Design Automation Conference (Los Angeles), ACM, New York, 489-494.
26. EDWARDS, S. A. 2000. Compiling Esterel into sequential code. In Proceedings of the 37th Design Automation Conference (Los Angeles), ACM, New York, 322-327.
27. EDWARDS, S. A. 2002. An Esterel compiler for large control-dominated systems. IEEE Trans. Comput. Aided Des. Integ. Circ. Syst. 21, 2 (Feb.), 169-183.
28. FERRANTE, J., OTTENSTEIN, K. J., AND WARREN, J. D. 1987. The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst. 9, 3 (July), 319-349.
29. FRENCH, R. S., LAM, M. S., LEVITT, J. R., AND OLUKOTUN, K. 1995. A general method for compiling event-driven simulations. In Proceedings of the 32nd Design Automation Conference (San Francisco), 151-156.
30. FUJIMOTO, R. M. 1980. Parallel discrete event simulation. Commun. ACM 33, 10 (Oct.), 30-53.
31. GONTHIER, G. 1988. Sémantiques et modèles d'exécution des langages réactifs synchrones; application à Esterel. [Semantics and models of execution of the synchronous reactive languages: application to Esterel]. Thèse d'informatique, Université d'Orsay.
32. HACHTEL, G. D. AND SOMENZI, F. 1996. Logic Synthesis and Verification Algorithms. Kluwer, Boston.
33. HALBWACHS, N. 1993. Synchronous Programming of Reactive Systems. Kluwer, Boston.
34. HALBWACHS, N., CASPI, P., RAYMOND, P., AND PILAUD, D. 1991a. The synchronous data flow programming language LUSTRE. Proc. IEEE 79, 9 (Sept.), 1305-1320.
35. HALBWACHS, N., RAYMOND, P., AND RATEL, C. 1991b. Generating efficient code from data-flow programs. In Proceedings of the Third International Symposium on Programming Language Implementation and Logic Programming (PLILP), Lecture Notes in Computer Science, vol. 528, Springer-Verlag, Passau, Germany.
36. HAREL, D. 1987. Statecharts: A visual formalism for complex systems. Sci. Comput. Program. 8, 3 (June), 231-274.
37. HAREL, D. AND NAAMAD, A. 1996. The Statemate semantics of Stateeharts. ACM Trans. Softw. Eng. Method. 5, 4 (Oct.), 293-333.
38. HOARE, C. A. R. 1985. Communicating Sequential Processes. Prentice-Hall, Upper Saddle River, NJ.
39. HOPCROFT, J. AND ULLMAN, J. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA.
40. HUDAK, P. 1998. Modular domain specific languages and tools. In Proceedings of the Fifth International Conference on Software Reuse (ICSR) (Victoria, Canada), 134-132.
41. IEEE COMPUTER SOCIETY. 1996. IEEE Standard Hardware Description Language Based on the Verilog Hardware Description Language. IEEE Computer Society, New York, 1364-1995.
42. JONES, N. D., GOMARD, C. K., AND SESTOFT, P. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Upper Saddle River, NJ.
43. KAHN, G. 1974. The semantics of a simple language for parallel programming. In Information Processing 74: Proceedings of IFIP Congress 74, North-Holland, Stockholm, 471-475.
44. KAHN, G. AND MACQUEEN, D. B. 1977. Coroutines and networks of parallel processes. In Information Processing 77: Proceedings of IFIP Congress 77. North-Holland, Toronto, 993-998.
45. LABROSSE, J. 1998. MicroC/OS-II. CMP Books, Lawrence, KS.
46. LE GUERNIC, P., GAUTIER, T., LE BORGNE, M., AND LE MAIRE, C. 1991. Programming real-time applications with SIGNAL. Proc. IEEE 79, 9 (Sept.), 1321-1336.
47. LEE, E. A. AND MESSERSCHMITT, D. G. 1987a. Static scheduling of synchronous data flow programs for digital signal processing. IEEE Trans. Comput. C-36, 1 (Jan.), 24-35.
48. LEE, E. A. AND MESSERSCHMITT, D. G. 1987b. Synchronous data flow. Proc. IEEE 75, 9 (Sept.), 1235-1245.
49. LEE, E. A. AND PARKS, T. M. 1995. Dataflow process networks. Proc. IEEE 83, 5 (May), 773-801.
50. LENGAUER, T. AND TARJAN, R. E. 1979. A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. 1, 1 (July), 121-141.
51. LIN, B. 1998. Efficient compilation of process-based concurrent programs without run-time scheduling. In Proceedings of Design, Automation, and Test in Europe (DATE) (Paris), 211-217.
52. MADISETTI, V. K., WALRAND, J. C., AND MESSERSCHMITT, D. G. 1991. Asynchronous algorithms for the parallel simulation of event-driven dynamical systems. ACM Trans. Model. Comput. Simul. 1, 3 (July), 244-274.
53. McMILLAN, K. L. 1992. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In Computer Aided Verification, Fourth International Workshop, Lecture Notes in Computer Science, vol. 663, Springer-Verlag, Montreal, 164-177.
54. McMILLAN, K. L. 1995. A technique of state space search based on unfolding. Formal Meth. Syst. Des. 6, 1 (Jan.), 45-65.
55. MURATA, T. 1989. Petri nets: Properties, analysis, and applications. Proc. IEEE 77, 4 (April), 541-580.
56. PARKS, T. M. 1995. Bounded scheduling of process networks. PhD Thesis, University of California, Berkeley. Available as UCB/ERL M95/105.
57. PETRI, C. A. 1962. Kommunikation mit automaten. PhD Thesis, Institutes für Instrumentelle Mathematik, Bonn, Germany. In German.
58. PLOTKIN, G. D. 1981. A structural approach to operational semantics. Tech. Rep. DAIMI FN-19, Aarhus University, Åarhus, Denmark.
59. RUDELL, R. 1993. Dynamic variable ordering for ordered binary decision diagrams. In Proceedings of the IEEE/ACM International Conference on Computer Aided Design (ICCAD) (San Jose, CA.), 42-47.
60. SGROI, M., LAVAGNO, L., AND SANGIOVANNI-VINCENTELLI, A. 1998. Quasi-static scheduling of free-choice Petri nets. Tech. Rep. UCB/ERL M98/9, University of California, Berkeley.
61. SGROI, M., LAVAGNO, L., WATANABE, Y., AND SANGIOVANNI-VINCENTELLI, A. 1999. Synthesis of embedded software using free-choice Petri nets. In Proceedings of the 36th Design Automation Conference (New Orleans), 805-810.
62. SHIPLE, T. R., BERRY, G., AND TOUATI, H. 1996. Constructive analysis of cyclic circuits. In Proceedings of the European Design and Test Conference (Paris), 328-333.
63. SILBERSCHATZ, A. AND GALVIN, P. B. 1998. Operating System Concepts, 5th ed. Addison-Wesley, Reading, MA.
64. SIMONS, B. AND FERRANTE, J. 1993. An efficient algorithm for constructing a control flow graph for parallel code. Tech. Rep. TR-03.465, IBM, Santa Teresa Laboratory, San Jose, CA, February.
65. STEENSGAARD, B. 1993. Sequentializing program dependence graphs for irreducible programs. Tech. Rep. MSR-TR-93-14, Microsoft. October.
66. STREHL, K., THIELEAND, L., ZIEGENBEIN, D., ERNST, R., AND TEICH, J. 1999. Scheduling hardware/software systems using symbolic techniques. In Proceedings of the Seventh International Workshop on Hardware/ Software Codesign (CODES '99) (Rome), 173-177.
67. TANENHAUM, A. S. 1992. Modern Operating Systems. Prentice-Hall, Upper Saddle River, NJ.
68. THIBAULT, S. A., MARLET, R., AND CONSEL, C. 1999. Domain-specific languages: From design to implementation application to video device drivers generation. IEEE Trans. Softw. Eng. 25, 3 (May), 363-377.
69. THOMAS, D. E. AND MOOREY, P. R. 1998. The Verilog Hardware Description Language, 4th ed. Kluwer, Boston.
70. ULRICH, E. G. 1965. Time-sequenced logic simulation based on circuit delay and selective tracing of active network paths. In Proceedings of the Twentieth ACM National Conference, 437-448.
71. ULRICH, E. G. 1969. Exclusive simulation of activity in digital networks. Commun. ACM 12, 2 (Feb.), 102-110.
72. WEIL, D., BERTIN, V., CLOSSE, E., POIZE, M., VENIER, P., AND PULOU, J. 2000. Efficient compilation of Esterel for real-time embedded systems. In Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES) (San Jose, CA), 2-8.
73. ZHU, X. AND LIN, B. 1999. Compositional software synthesis of communicating processes. In Proceedings of the IEEE International Conference on Computer Design (ICCD) (Austin, TX), 646-651.