Network Flows, pp.0-13, 1993. ,
Schedule-Sensitive Register Pressure Reduction in Innermost Loops, Basic Blocks and Super-Blocks, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00436348
Introduction to Algorithms, 1990. ,
The R Book, 2007. ,
Parametric computation of margins and of minimum cumulative register lifetime dates, Lecture Notes in Computer Science, vol.1239, pp.231-245, 1996. ,
DOI : 10.1007/BFb0017256
On a graph-theoretical model for cyclic register allocation, Discrete Applied Mathematics, vol.93, issue.2-3, pp.191-203, 1999. ,
DOI : 10.1016/S0166-218X(99)00105-5
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization, Proceedings of 2nd Annual International Conference on Combinatorial Optimization and Applications, 2008. ,
DOI : 10.1007/978-3-540-85097-7_41
URL : https://hal.archives-ouvertes.fr/inria-00637210
Minimizing Register Requirements of a Modulo Schedule via Optimum Stage Scheduling, International Journal of Parallel Programming, vol.7, issue.3, pp.103-132, 1996. ,
DOI : 10.1007/BF03356744
OPTIMAL SOFTWARE PIPELINING UNDER RESOURCE CONSTRAINTS, International Journal of Foundations of Computer Science, vol.12, issue.06, pp.697-718, 2001. ,
DOI : 10.1142/S0129054101000825
An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm, Journal of Algorithms, vol.22, issue.1, pp.1-29, 1992. ,
DOI : 10.1006/jagm.1995.0805
Finding Minimum-Cost Circulations by Successive Approximation, Mathematics of Operations Research, vol.15, issue.3, pp.430-466, 1990. ,
DOI : 10.1287/moor.15.3.430
A study of the cyclic scheduling problem on parallel processors, Discrete Applied Mathematics, vol.57, issue.2-3, pp.167-192, 1995. ,
DOI : 10.1016/0166-218X(94)00102-J
The Art of Computer Systems Performance Analysis : Techniques for Experimental Design, Measurement, Simulation, and Modeling, 1991. ,
Compilers Strategies for Transport Triggered Architectures, 2001. ,
The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955. ,
DOI : 10.1002/nav.3800020109
Optimal Cycles in Graphs and the Minimal Cost-To-Time Ratio Problem, pp.38-58, 1972. ,
DOI : 10.1007/978-3-7091-2652-3_3
A novel framework of register allocation for software pipelining, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, pp.29-42, 1993. ,
DOI : 10.1145/158511.158519
Register allocation for software pipelined loops, Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, pp.283-299, 1992. ,
DOI : 10.1145/143103.143141
Theory of Linear and Integer Programming, 1987. ,
Schedule-Independent Storage Mapping for Loops, ACM SIG-PLAN Notices, issue.11, pp.3324-3357, 1998. ,
DOI : 10.1145/291069.291015
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.4279
A unified framework for schedule and storage optimization, ACM SIGPLAN Notices, vol.36, issue.5, pp.232-242, 2001. ,
DOI : 10.1145/381694.378852
URL : https://hal.archives-ouvertes.fr/hal-00808285
Register Pressure in Instruction Level Parallelisme, 2002. ,
URL : https://hal.archives-ouvertes.fr/tel-00007405
On Periodic Register Need in Software Pipelining, IEEE Transactions on Computers, vol.56, issue.11, p.56, 2007. ,
DOI : 10.1109/TC.2007.70752
URL : https://hal.archives-ouvertes.fr/inria-00636095
Early Periodic Register Allocation on ILP Processors, Parallel Processing Letters, vol.14, issue.02, 2004. ,
DOI : 10.1142/S012962640400188X
URL : https://hal.archives-ouvertes.fr/hal-00130623
Periodic register saturation in innermost loops, Parallel Computing, vol.35, issue.4, pp.239-254, 2009. ,
DOI : 10.1016/j.parco.2008.12.001
URL : https://hal.archives-ouvertes.fr/inria-00636073