Compiling Real-Time Programs With Timing Constraint Refinement and Structural Code Motion

IEEE Transactions on Software Engineering

Volumn 21, Issue 5, 1995, Pages 389-404

  Gerber, Richard ^a   Hong, Seongsoo ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

code motion; code scheduling; compiler optimization; gated single assignment; programming languages; Real time; static single assignment; timing analysis; trace scheduling

Indexed keywords

EID: 84937647239     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.387469     Document Type: Article

References (28)

1. A.V. Aho, R. Sethi, and J.D. Ullman, Compilers: Principles. Techniques, and Tools. Cambridge, Mass.: Addison-Wesley, 1986.
2. A. Aiken and A. Nicolau, “A development environment for horizontal microcode,” IEEE Trans. Software Engineering, pp. 584-594, May 1988.
3. J.D. Choi, R. Cytron, and J. Ferrante, “On the efficient engineering of ambitious program analysis,” IEEE Trans. Software Engineering, vol. 20, no. 2, pp. 105-114, Feb. 1994.
4. R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadeck, “Efficiently computing static single assignment form and the control dependence graph,” ACM Trans. Programming Languages and Systems, vol. 13, pp. 451-490, Oct. 1991.
5. B. Dasarathy, “Timing constraints of real-time systems: Constructs for expressing them, method for validating them,” IEEE Trans. Software Engineering, vol. 11, no. 1, pp. 80-86, Jan. 1985.
6. K. Ebcioglu and A. Nicolau, “A global resource-constrained parallelization technique,” Int'l Conf. on Supercomputing, pp. 154-163, June 1989.
7. J. Ferrante and K.J. Ottenstein, “The program dependence graph and its use in optimization,” ACM Trans. on Programming Languages and Systems, vol. 9, pp. 319-345, July 1987.
8. J.A. Fisher, “Trace scheduling: A technique for global microcode compaction,” IEEE Trans. on Computers, vol. 30, pp. 478-490, July 1981.
9. M.R. Garey and D.S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman and Co., 1979.
10. R. Gerber and S. Hong, “Semantics-based compiler transformations for enhanced schedulability,” Proc. IEEE Real-Time Systems Symp., pp. 232-242, Dec. 1993.
11. P. Gopinath and R. Gupta. “Applying compiler techniques to scheduling in real-time systems,” Proc. IEEE Real-Time Systems Symp., pp. 247-256, Dec. 1990.
12. M.G. Harmon, T.P. Baker, and D.B. Whalley, “A retargetable technique for predicting execution time,” Proc. IEEE Real-Time Systems Symp., pp. 68-77, Dec. 1992.
13. P. Havlak. Interprocedural Symbolic Analysis, PhD thesis, Dept. of Computer Science, Rice Univ., May 1994.
14. S. Hong and R. Gerber, “Scheduling with compiler transformations: The TCEL approach,” Proc. IEEE Workshop on Real-Time Operating Systems and Software, pp. 80-84., May 1993. IEEE RTTC Real-Time Newsletter, vol. 9, no. 1/2, pp. 80-84.
15. Y. Ishikawa, H. Tokuda, and C.W. Mercer, “Object-oriented real-time language design: Constructs for timing constraints,” Proc. OOPSLA 90, pp. 289-298, Oct. 1990.
16. F. Jahanian and Al Mok, “Safety analysis of timing properties in real-time systems,” IEEE Trans. Software Engineering, vol. 12, no. 9, pp. 890-904, Sept. 1986.
17. K.B. Kenny and K.-J. Lin, “Building flexible real-time systems using the Flex language,” Computer, pp. 70-78, May 1991.
18. I. Lee, P. Bremond-Gregoire, and R. Gerber, “A process algebraic approach to the specification and analysis of resource-bound real-time systems,” IEEE Proc., vol. 82, no. 1, Jan. 1994.
19. I. Lee and V. Gehlot, “Language constructs for real-time programming,” Proc. IEEE Real-Time Systems Symp., pp. 57-66, 1985.
20. S. Lira, Y. Bae, C. Jang, B. Rhee, S. Min, C. Park, H. Shin, K. Park, and C. Kim, “An accurate worst case timing analysis for risc processors,” Proc. IEEE Real-Time Systems Symp., pp. 97-108, Dec. 1994.
21. K.J. Lin and S. Natarajan, “Expressing and maintaining timing constraints in FLEX,” Proc. IEEE Real-Time Systems Symp, Dec. 1988.
22. T. Marlowe and S. Masticola, “Safe optimization for hard real-time programming,” Second Int'l Conf. Systems Integration, pp. 438-446, June 1992.
23. M. Merritt, F. Modungo, and M. Tuttle, “Time-constrained automata,” CONCUR '91, Aug. 1991.
24. V. Nirkhe. “Application of partial evaluation to hard real-time programming,” PhD thesis, Dept. of Computer Science, Univ. of Maryland at College Park, May 1992.
25. W. Pugh and D. Wonnacott, “Eliminating false data dependences using the Omega test,” Proc. ACM SIGPLAN '92 Conf. on Programming Language Design and Implementation, June 1992.
26. M. Smith, M. Horowitz, and M. Lam, “Efficient superscalar performance through boosting,” Fifth Int'l Conf. Architectural Support for Programming Languages and Operating Systems, pp. 248-259, Oct. 1992.
27. V. Wolfe, S. Davidson, and I. Lee, “RTC: Language support for real-time concurrency,” Proc. IEEE Real-Time Systems Symp., pp. 43-52, Dec. 1991.
28. N. Zhang, A. Burns, and M. Nicholson, “Pipelined processors and worst case execution times,” The J. of Real-Time Systems, vol. 5, no. 4, Oct. 1993.