Controlled node splitting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1060, Issue , 1996, Pages 44-58

  Janssen, Johan ^a   Corporaal, Henk ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Compilation; Control flow graphs; Instruction level parallelism; Irreducibility; Node splitting; Reducibility

Indexed keywords

DATA FLOW ANALYSIS; EMBEDDED SYSTEMS; GRAPH THEORY; GRAPHIC METHODS; OPTIMIZATION; PROGRAM COMPILERS;

COMPILATION; CONTROL FLOW GRAPHS; INSTRUCTION LEVEL PARALLELISM; IRREDUCIBILITY; NODE-SPLITTING; REDUCIBILITY;

FLOW GRAPHS;

EID: 84957689064     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61053-7_52     Document Type: Conference Paper

References (14)

1. Jan Hoogerbrugge and Henk Corporaal. Transport-triggering vs. operation-triggering. In Lecture Notes in Computer Science 786, Compiler Construction, pages 435–449. Springer-Verlag, 1994.
2. D. Bernstein and M. Rodeh. Global instruction scheduling for superscalar machines. In Proc. of the ACM SIGPLAN1991 conference on Programming Language Design and Implementation, pages 241–255, June 1991.
3. Barbara G. Ryder and Marvin C. Paull. Elimination algorithms for data flow analysis. ACM Computing Surveys, 18(3):277–316, September 1986.
4. Ana M. Erosa and Laurie J. Hendren. Taming control flow: A structured approach to eliminating goto statements. In Proceedings of the 1994 International Conference on Computer Languages, pages 229–240, Toulouse, France, May 1994.
5. Zahira Ammarguellat. A control-flow normalization algorithm and its complexity. IEEE Transaction on software engineering, 18(3):237–251, March 1992.
6. John Cocke and Raymond E. Miller. Some analysis techniques for optimizing computer programs. In Proceedings of 2nd Hawaii Conference on System Sciences, pages 143–146, 1969.
7. Matthew S. Hecht. Flow Analysis of Computer Programs. Programming Languages Series. Elsevier North-Holland, 1977.
8. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Company, 1988.
9. J. Cocke. On certain graph-theoretic properties of programs. Technical Report Research Report RC-3391, T.J. Watson Research Center, 1971.
10. F.E. Allen. A basis for program optimization. In Proceedings of 1971 IFIP Congress, pages 385–390, Amsterdam, 1971. IEEE, North Holland Publ.
11. F.E. Allen and J. Cocke. A program data flow analysis procedure. Commun. ACM, 19(3):137–147, March 1976.
12. M.S. Hecht and J.D. Ullman. Flow graph reducibility. SIAM J. Computing, 1(2):188–202, 1972.
13. Johan Janssen and Henk Corporaal. Making graphs reducible with controlled node splitting. Technical Report JJ-9501, Delft University of Technology, Department of Electrical Engineering, 1995.
14. Henk Corporaal and Hans (J.M.) Mulder. MOVE: A framework for high- performance processor design. In Supercomputing-91, pages 692–701, Albuquerque, November 1991.