P. Faraboschi, G. Brown, J. A. Fisher, G. Desoli, and F. Homewood, Lx: a technology platform for customizable VLIW embedded processing, The 27th Annual International Symposium on Computer architecture 2000, pp.203-213, 2000.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, 1991.

N. Gloy and M. D. Smith, Procedure placement using temporal-ordering information, ACM Transactions on Programming Languages and Systems (TOPLAS), vol.21, issue.5, pp.977-1027, 1999.

H. Amir, D. R. Hashemi, B. Kaeli, and . Calder, Efficient procedure mapping using cache line coloring, Proceedings of the 1997 ACM SIGPLAN Conference on Programming Language Design and Implementation, pp.171-182, 1997.

J. Kalamatianos and D. R. Kaeli, Temporal-based procedure reordering for improved instruction cache performance, Proceedings of the Fourth International Symposium on HighPerformance Computer Architecture, pp.244-253, 1998.

C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimisation, Algorithms and Complexity, 1982.

K. Pettis and R. C. Hansen, Profile guided code positioning, ACM SIGPLAN Notices, vol.25, issue.6, pp.16-27, 1990.

, Algorithm 10 procedure Cycle-Merge(I) ??Array-New(n) Matching-Greedy(I, ?) N cycles ?Simple-Merge(I, ?) if N cycles > 1 then Final-Merge(I, ?) return ?