{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T17:32:51Z","timestamp":1693071171517},"reference-count":22,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1051\/ro\/2013036","type":"journal-article","created":{"date-parts":[[2013,7,4]],"date-time":"2013-07-04T08:54:00Z","timestamp":1372928040000},"page":"223-249","source":"Crossref","is-referenced-by-count":1,"title":["How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations"],"prefix":"10.1051","volume":"47","author":[{"given":"Sid-Ahmed-Ali","family":"Touati","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Briais","sequence":"additional","affiliation":[]},{"given":"Karine","family":"Deschinkel","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2013,7,4]]},"reference":[{"key":"R1","unstructured":"F. Bouchez, A. Darte, C. Guillon and F. Rastello, Register Allocation: What does the NP-Completeness Proof of Chaitin et al. Really Prove?, inInternational Workshop on Languages and Compilers for Parallel Computing (LCPC\u201906), SpringerLect. Notes Comput. Sci.(2006) 283\u2013298."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"F. Bouchez, A. Darte and F. Rastello, On the Complexity of Register Coalescing, inInternational Symposium on Code Generation and Optimization (CGO\u201907). IEEE Computer Society Press (2007) 102\u2013114.","DOI":"10.1109\/CGO.2007.26"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"F. Bouchez, A. Darte and F. Rastello, On the complexity of spill everywhere under SSA form, inACM SIGPLAN\/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES\u201907). ACM Press (2007) 103\u2013112.","DOI":"10.1145\/1254766.1254782"},{"key":"R4","unstructured":"S. Briais, S.-A.-A. Touati and K. Deschinkel, Ensuring Lexicographic-Positive Data Dependence Graphs in the SIRA Framework. Technical Report HAL-INRIA-00452695, University of Versailles Saint-Quentin en Yvelines (2010). Research report. http:\/\/hal.archives-ouvertes.fr\/inria-00452695."},{"key":"R5","unstructured":"T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein,Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company (2001)."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"B. Dupont de Dinechin, Parametric Computation of Margins and of Minimum Cumulative Register Lifetime Dates, inLCPC \u201996: Proceedings of the 9th International Workshop on Languages and Compilers for Paral. Comput., London, UK. Springer-Verlag (1997) 231\u2013245.","DOI":"10.1007\/BFb0017256"},{"key":"R7","unstructured":"de Werra D., Eisenbeis C., Lelait S. and Marmol B., On a graph-theoretical model for cyclic register allocation.Discrete Appl. Math.93(1999) 191\u2013203."},{"key":"R8","unstructured":"Deschinkel K., Touati S.-A.-Ali and Briais S., SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling.J. Combin. Optim.22(2011) 819\u2013844."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Eichenberger A.E. and Davidson E.S., Efficient formulation for optimal modulo schedulers.SIGPLAN Notice32(1997) 194\u2013205.","DOI":"10.1145\/258916.258933"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Fimmel D. and Muller J., Optimal Software Pipelining Under Resource Constraints.Int. J. Found. Comput. Sci. (IJFCS)12(2001) 697\u2013718.","DOI":"10.1142\/S0129054101000825"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"R. Govindarajan, H. Yang, J.N. Amaral, C. Zhang and G.R. Gao, Minimum Register Instruction Sequencing to Reduce Register Spills in Out-of-Order Issue Superscalar Architecture.IEEE Trans. Comput.(2003) 4\u201320.","DOI":"10.1109\/TC.2003.1159750"},{"key":"R12","unstructured":"J. Janssen,Compilers Strategies for Transport Triggered Architectures. Ph.D. thesis, Delft University, Netherlands (2001)."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Kuhn H.W., The Hungarian Method for the assignment problem.Nav. Res. Logist. Q.2(1955) 83\u201397.","DOI":"10.1002\/nav.3800020109"},{"key":"R14","unstructured":"Lee T.-Eog and Park S.-Ho, An extended event graph with negative places and tokens for time window constraints.IEEE Trans. Autom. Sci. Eng.2(2005) 319\u2013332."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Leiserson C.E. and Saxe J.B., Retiming Synchronous Circuitry.Algorithmica6(1991) 5\u201335.","DOI":"10.1007\/BF01759032"},{"key":"R16","unstructured":"Munier A., A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule.J. Scheduling14(2011) 103\u2013117."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"S.G. Nagarakatte and R. Govindarajan, Register Allocation and Optimal Spill Code Scheduling in Software Pipelined Loops Using 0-1 Integer Linear Programming Formulation, inCompiler Construction (CC), vol. 4420,Lecture Notes in Computer Science, Braga, Portugal (2007) 126\u2013140. Springer.","DOI":"10.1007\/978-3-540-71229-9_9"},{"key":"R18","unstructured":"J. Ruttenberg, G.R. Gao, A. Stoutchinin and W. Lichtenstein, Software Pipelining Showdown : Optimal vs. Heuristic Methods in a Production Compiler, inProceedings of the ACM SIGPLAN Conference on Programming Language Design and Implemantation, New York. ACM Press (1996) 1\u201311."},{"key":"R19","unstructured":"M. Schlansker, B. Rau and S. Mahlke, Achieving High Levels of instruction-Level Parallelism with Reduced Hardware Complexity. Technical Report HPL-96-120, Hewlet Packard (1994)."},{"key":"R20","doi-asserted-by":"crossref","unstructured":"P. Sucha and Z. Hanz\u00e1lek, Scheduling of Tasks with Precedence Delays and Relative Deadlines - Framework for Time-optimal Dynamic Reconfiguration of FPGAs, inIPDPS, IEEE(2006) 1\u20138.","DOI":"10.1109\/IPDPS.2006.1639388"},{"key":"R21","unstructured":"Touati S.-A.-A., Brault F., Deschinkel K. and de Dinechin B.D., Efficient Spilling Reduction for Software Pipelined Loops in Presence of Multiple Register Types in Embedded VLIW Processors.ACM Trans. Embedded Comput. Syst.10(2011) 1\u201347."},{"key":"R22","unstructured":"Touati S.-A.-A. and Eisenbeis C., Early Periodic Register Allocation on ILP Processors.Paral. Proc. Lett.14(2004) 287\u2013313."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2013036\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T03:33:20Z","timestamp":1563334400000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2013036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":22,"journal-issue":{"issue":"3"},"alternative-id":["ro130036"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2013036","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}