Phase-Coupled Mapping of Data Flow Graphs to Irregular Data Paths

作者: Steven Bashford , Rainer Leupers

DOI: 10.1023/A:1008966522714

关键词:

摘要: Many software compilers for embedded processors produce machine code of insufficient quality. Since most applications must meet tight speed and size constraints, is still largely developed in assembly language. In order to eliminate this bottleneck enable the use high-level language also software, new generation optimization techniques are required. This paper describes a novel technique with irregular data path architectures, such as typically found fixed-point DSPs. The proposed maps flow graph representation program into highly efficient target processor modeled by instruction set behavior. High quality ensured coupling different phases. contrast earlier works, mainly based on heuristics, our approach constraint-based. An initial constraints prescribed given model. Further arise during decisions concerning selection, register allocation, scheduling. Whenever possible, postponed until sufficient information about good decision has been collected. active "background" guarantee local satisfiability at any point time generation. mechanism permits simultaneously cope special-purpose registers level parallelism. We describe detailed integration implementation constraint logic programming (CLP) ECLiPSe. For standard DSP, we show that generated comes close hand-written code. input model can be edited user, retargetability achieved within certain class.

参考文章(54)
David Gordon Bradlee, Retargetable instruction scheduling for pipelined processors University of Washington. ,(1991)
Pierre G. Paulin, Marco Cornero, Clifford Liem, François Naçabal, Chris Donawa, Shailesh Sutarwala, Trevor May, Carlos Valderrama, Trends In Embedded Systems Technology Springer Netherlands. pp. 311- 337 ,(1996) , 10.1007/978-94-009-0187-2_13
Thomas S. Brasier, Philip H. Sweany, Steve Carr, Steven J. Beaty, CRAIG: a practical framework for combining instruction scheduling and register assignment international conference on parallel architectures and compilation techniques. pp. 11- 18 ,(1995) , 10.5555/224659.224671
Dennis Shasha, Kaizhong Zhang, Tree pattern matching Pattern matching algorithms. pp. 341- 371 ,(1997)
Ravi Sethi, Jeffrey D. Ullman, Alfred V. Aho, Compilers: Principles, Techniques, and Tools ,(1986)
Steven Novack, Alexandru Nicolau, Mutation Scheduling: A Unified Approach to Compiling for Fine-Grain Parallelism languages and compilers for parallel computing. pp. 16- 30 ,(1994) , 10.1007/BFB0025868
Wolfgang Ambrosch, M. Anton Ertl, Felix Beer, Andreas Krall, Dependence-conscious global register allocation international conference on programming languages and system architectures. pp. 125- 136 ,(1994) , 10.1007/3-540-57840-4_28
Cindy Norris, Lori L. Pollock, Register allocation sensitive region scheduling international conference on parallel architectures and compilation techniques. pp. 1- 10 ,(1995) , 10.5555/224659.224668
A. Nicolau, R. Potasman, H. Wang, Register Allocation, Renaming and Their Impact on Fine-Grain Parallelism languages and compilers for parallel computing. pp. 218- 235 ,(1991) , 10.1007/BFB0038667