{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:02:23Z","timestamp":1648620143711},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,5,22]],"date-time":"2010-05-22T00:00:00Z","timestamp":1274486400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9332-8","type":"journal-article","created":{"date-parts":[[2010,5,21]],"date-time":"2010-05-21T11:43:05Z","timestamp":1274442185000},"page":"819-844","source":"Crossref","is-referenced-by-count":0,"title":["SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling"],"prefix":"10.1007","volume":"22","author":[{"given":"Karine","family":"Deschinkel","sequence":"first","affiliation":[]},{"given":"Sid-Ahmed-Ali","family":"Touati","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Briais","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,22]]},"reference":[{"key":"9332_CR1","isbn-type":"print","volume-title":"Network Flows","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Orlin JB, Magnanti TL (1993) Network Flows. Prentice Hall, New York. ISBN:978-0-136-17549-X","ISBN":"http:\/\/id.crossref.org\/isbn\/9780136175"},{"key":"9332_CR2","unstructured":"Briais S, Touati S-A-A (2009) Schedule-sensitive register pressure reduction in innermost loops, basic blocks and super-blocks. Technical report HAL-INRIA-00436348, University of Versailles Saint-Quentin en Yvelines. Research report. http:\/\/hal.archives-ouvertes.fr\/inria-00436348"},{"key":"9332_CR3","volume-title":"Introduction to algorithms","author":"T Cormen","year":"1990","unstructured":"Cormen T, Leiserson CE, Rivest R (1990) Introduction to algorithms. MIT Press\/McGraw-Hill, Cambridge\/New York"},{"key":"9332_CR4","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1002\/9780470515075","volume-title":"The R book","author":"MJ Crawley","year":"2007","unstructured":"Crawley MJ (2007) The R book. Wiley, New York. ISBN-13: 978-0-470-51024-7","ISBN":"http:\/\/id.crossref.org\/isbn\/9780470510"},{"key":"9332_CR5","series-title":"Lecture notes in computer science","first-page":"231","volume-title":"LCPC","author":"BD Dinechin de","year":"1996","unstructured":"de Dinechin BD (1996) Parametric computation of margins and of minimum cumulative register lifetime dates. In: Sehr DC, Banerjee U, Gelernter D, Nicolau A, Padua DA (eds) LCPC. Lecture notes in computer science, vol\u00a01239. Springer, Berlin, pp\u00a0231\u2013245"},{"issue":"2\u20133","key":"9332_CR6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0166-218X(99)00105-5","volume":"93","author":"D Werra de","year":"1999","unstructured":"de Werra D, Eisenbeis C, Lelait S, Marmol B (1999) On a graph-theoretical model for cyclic register allocation. Discrete Appl Math 93(2\u20133):191\u2013203","journal-title":"Discrete Appl Math"},{"key":"9332_CR7","volume-title":"Proceedings of 2nd annual international conference on combinatorial optimization and applications (COCOA 2008)","author":"K Deschinkel","year":"2008","unstructured":"Deschinkel K, Touati S-A-A (2008) Efficient method for periodic task scheduling with storage requirement minimization. In: Proceedings of 2nd annual international conference on combinatorial optimization and applications (COCOA 2008). Springer, Berlin"},{"issue":"2","key":"9332_CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF03356744","volume":"24","author":"AE Eichenberger","year":"1996","unstructured":"Eichenberger AE, Davidson ES, Abraham SG (1996) Minimizing register requirements of a modulo schedule via optimum stage scheduling. Int J Parallel Program 24(2):103\u2013132","journal-title":"Int J Parallel Program"},{"issue":"6","key":"9332_CR9","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1142\/S0129054101000825","volume":"12","author":"D Fimmel","year":"2001","unstructured":"Fimmel D, Muller J (2001) Optimal software pipelining under resource constraints. Int J Found Comput Sci (IJFCS) 12(6):697\u2013718","journal-title":"Int J Found Comput Sci (IJFCS)"},{"key":"9332_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1995.0805","volume":"22","author":"AV Goldberg","year":"1992","unstructured":"Goldberg AV (1992) An efficient implementation of a scaling minimum-cost flow algorithm. J\u00a0Algorithms 22:1\u201329","journal-title":"J\u00a0Algorithms"},{"issue":"3","key":"9332_CR11","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"AV Goldberg","year":"1990","unstructured":"Goldberg AV, Tarjan RE (1990) Finding minimum-cost circulations by successive approximation. Math Oper Res 15(3):430\u2013466","journal-title":"Math Oper Res"},{"issue":"2\u20133","key":"9332_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0166-218X(94)00102-J","volume":"57","author":"C Hanen","year":"1995","unstructured":"Hanen C, Munier A (1995) A\u00a0study of the cyclic scheduling problem on parallel processors. Discrete Appl Math 57(2\u20133):167\u2013192","journal-title":"Discrete Appl Math"},{"key":"9332_CR13","volume-title":"The art of computer systems performance analysis: techniques for experimental design, measurement, simulation, and modeling","author":"R Jain","year":"1991","unstructured":"Jain R (1991) The art of computer systems performance analysis: techniques for experimental design, measurement, simulation, and modeling. Wiley, New York"},{"key":"9332_CR14","unstructured":"Janssen J (2001) Compilers strategies for transport triggered architectures. PhD thesis, Delft University, Netherlands"},{"key":"9332_CR15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian method for the assignment problem. Nav Res Logist Q 2:83\u201397","journal-title":"Nav Res Logist Q"},{"key":"9332_CR16","first-page":"38","volume-title":"Periodic optimization","author":"EL Lawler","year":"1972","unstructured":"Lawler EL (1972) Optimal cycles on graphs and minimal cost-to-time ratio problem. In: Marzojlo A (ed) Periodic optimization, vol\u00a01. Springer, Berlin, pp\u00a038\u201358"},{"key":"9332_CR17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/158511.158519","volume-title":"Conference record of the twentieth ACM SIGPLAN-SIGACT symposium on principles of programming languages","author":"Q Ning","year":"1993","unstructured":"Ning Q, Gao GR (1993) A novel framework of register allocation for software pipelining. In: Conference record of the twentieth ACM SIGPLAN-SIGACT symposium on principles of programming languages, Charleston, South Carolina. ACM, New York, pp\u00a029\u201342"},{"issue":"7","key":"9332_CR18","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1145\/143103.143141","volume":"27","author":"BR Rau","year":"1992","unstructured":"Rau BR, Lee M, Tirumalai PP, Schlansker MS (1992) Register allocation for software pipelined loops. SIGPLAN Not 27(7):283\u2013299. Proceedings of the ACM SIGPLAN \u201992 conference on programming language design and implementation","journal-title":"SIGPLAN Not"},{"key":"9332_CR19","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1987","unstructured":"Schrijver A (1987) Theory of linear and integer programming. Wiley, New York"},{"issue":"11","key":"9332_CR20","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/291006.291015","volume":"33","author":"MM Strout","year":"1998","unstructured":"Strout MM, Carter L, Ferrante J, Simon B (1998) Schedule-independent storage mapping for loops. ACM SIGPLAN Not 33(11):24\u201333","journal-title":"ACM SIGPLAN Not"},{"issue":"5","key":"9332_CR21","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/381694.378852","volume":"36","author":"W Thies","year":"2001","unstructured":"Thies W, Vivien F, Sheldon J, Amarasinghe S (2001) A unified framework for schedule and storage optimization. ACM SIGPLAN Not 36(5):232\u2013242","journal-title":"ACM SIGPLAN Not"},{"key":"9332_CR22","unstructured":"Touati S-A-A (2002) Register pressure in instruction level parallelisme. PhD thesis, Universit\u00e9 de Versailles, France. ftp.inria.fr\/INRIA\/Projects\/a3\/touati\/thesis"},{"key":"9332_CR23","doi-asserted-by":"crossref","unstructured":"Touati S-A-A (2007) On the periodic register need in software pipelining. IEEE Trans Comput 56(11)","DOI":"10.1109\/TC.2007.70752"},{"issue":"2","key":"9332_CR24","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1142\/S012962640400188X","volume":"14","author":"S-A-A Touati","year":"2004","unstructured":"Touati S-A-A, Eisenbeis C (2004) Early periodic register allocation on ILP processors. Parallel Process Lett 14(2):287\u2013313","journal-title":"Parallel Process Lett"},{"key":"9332_CR25","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.parco.2008.12.001","volume":"3","author":"S-A-A Touati","year":"2009","unstructured":"Touati S-A-A, Mathe Z (2009) Periodic register saturation in innermost loops. Parallel Comput 3:239\u2013254","journal-title":"Parallel Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9332-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9332-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9332-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:14Z","timestamp":1559262194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9332-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,22]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9332"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9332-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,22]]}}}