B. , S. And-touati, and S. , Schedule-Sensitive register pressure reduction in innermost loops, basic blocks, and super-blocks, 2009.

B. , P. Cooper, K. D. And-torczon, and L. , Improvements to graph coloring register allocation, ACM Trans. Program. Lang. Syst, vol.16, issue.3, pp.428-455, 1994.

D. Werra, D. Eisenbeis, C. Lelait, S. And-marmol, and B. , On a graph-theoretical model for cyclic register allocation, Discrete Applied Mathematics, vol.93, issue.2-3, pp.2-3, 1999.
DOI : 10.1016/S0166-218X(99)00105-5

D. , K. And-touati, and S. , Efficient method for periodic task scheduling with storage requirement minimization, Proceedings of the 2nd International Conference on Combinatorial Optimization and Applications (COCOA'08, pp.438-447, 2008.

E. , A. Davidson, and E. S. , Efficient formulation for optimal modulo schedulers. SIGPLAN Not, pp.194-205, 1997.

E. , C. Lelait, S. And-marmol, and B. , The meeting graph: A new model for loop cyclic register allocation, Proceedings of the IFIP WG 10.3 Working Conference on Parallel Architectures and Compilation Techniques (PACT'95). L. Bic, W. Bohm, P. Evripidou, and J. L. Gaudiot Eds, pp.264-267, 1995.

F. , G. Fisher, J. A. Desoli, G. And-homewood, and F. , Lx: A technology platform for customizable VLIW embedded processing, Proceedings of the 27th Annual International Symposium on Computer Architecture (ISCA'00, pp.203-213, 2000.

F. , J. A. Faraboschi, A. Young, and C. , Embedded Computing: A VLIW Approach to Architecture , Compilers and Tools, 2005.

G. , C. Rastello, F. Bidault, T. And-bouchez, and F. , Procedure placement using temporalordering information: Dealing with code size expansion, J. Embed. Comput, vol.1, issue.4, pp.437-459, 2005.

H. , L. J. Gao, G. R. Altman, E. R. And-mukerji, and C. , A register allocation framework based on hierarchical cyclic interval graphs, Proceedings of the 4th International Conference on Compiler Construction (CC'92, pp.176-191, 1992.

N. , S. G. And, and R. Govindarajan, Register allocation and optimal spill code scheduling in software pipelined loops using 0-1 integer linear programming formulation, Proceedings of the 16th International Conference on Compiler Construction (CC'07) Held as Part of the Joint European Conference on Theory and Practice of Software (ETAPS'07, pp.126-140, 2007.

N. , A. Potasman, R. And-wang, and H. , Register allocation, renaming and their impact on fine-grain parallelism, Proceedings of the 4th International Workshop on Languages and Compilers for Parallel Computing, pp.218-235, 1992.

R. , R. B. Schlansker, M. S. And-tirumalai, and P. P. , Code generation schema for modulo scheduled loops, SIGMICRO Newslett, vol.23, pp.1-2, 1992.

R. , R. B. Lee, M. Tirumalaiand, P. P. And-schlansker, and M. S. , Register allocation for software pipelined loops, Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'92, pp.283-299, 1992.

R. , K. A. Magnanti, T. L. And-orlin, and J. B. , Network Flows: Theory, Algorithms, and Applications, 1991.

R. , J. Gao, G. R. Stoutchinin, A. And-lichtenstein, and W. , Software pipelining showdown: Optimal vs. heuristic methods in a production compiler, Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'96, pp.1-11, 1996.

T. , S. And-barthou, and D. , On the decidability of phase ordering problem in optimizing compilation, Proceedings of the ACM International Conference on Computing Frontiers, 2006.

T. , S. And-eisenbeis, and C. , Early periodic register allocation on ILP processors, Parall. Process. Lett, vol.14, issue.2, p.287, 2004.

W. , J. Eisenbeis, C. Jourdan, M. And-su, and B. , Decomposed software pipelining: A new perspective and a new approach, Int. J. Parall. Program, vol.22, issue.3, pp.351-373, 1994.