{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:02Z","timestamp":1725516602524},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_41","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"438-447","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization"],"prefix":"10.1007","author":[{"given":"Karine","family":"Deschinkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sid-Ahmed-Ali","family":"Touati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BFb0017256","volume-title":"Languages and Compilers for Parallel Computing","author":"B..D.. Dinechin de","year":"1997","unstructured":"de Dinechin, B.D.: Parametric Computation of Margins and of Minimum Cumulative Register Lifetime Dates. In: Sehr, D., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D.A. (eds.) LCPC 1996. LNCS, vol.\u00a01239, pp. 231\u2013245. Springer, Heidelberg (1997)"},{"issue":"2-3","key":"41_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0166-218X(94)00102-J","volume":"57","author":"C. Hanen","year":"1995","unstructured":"Hanen, C., Munier, A.: A Study of the Cyclic Scheduling Problem on Parallel Processors. Discrete Applied Mathematics\u00a057(2-3), 167\u2013192 (1995)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"41_CR3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF03356744","volume":"24","author":"A.E. Eichenberger","year":"1996","unstructured":"Eichenberger, A.E., Davidson, E.S., Abraham, S.G.: Minimizing Register Requirements of a Modulo Schedule via Optimum Stage Scheduling. International Journal of Parallel Programming\u00a024(2), 103\u2013132 (1996)","journal-title":"International Journal of Parallel Programming"},{"issue":"6","key":"41_CR4","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1142\/S0129054101000825","volume":"12","author":"D. Fimmel","year":"2001","unstructured":"Fimmel, D., Muller, J.: Optimal Software Pipelining Under Resource Constraints. International Journal of Foundations of Computer Science (IJFCS)\u00a012(6), 697\u2013718 (2001)","journal-title":"International Journal of Foundations of Computer Science (IJFCS)"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian Method for the assignment problem. Naval Research Logistics Quarterly\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"key":"41_CR6","unstructured":"Janssen, J.: Compilers Strategies for Transport Triggered Architectures. PhD thesis, Delft University, Netherlands (2001)"},{"key":"41_CR7","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1987","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, New York (1987)"},{"key":"41_CR8","unstructured":"Touati, S.-A.-A.: Register Pressure in Instruction Level Parallelisme. PhD thesis, Universit\u00e9 de Versailles, France (June 2002), \n                  \n                    ftp.inria.fr\/INRIA\/Projects\/a3\/touati\/thesis"},{"key":"41_CR9","unstructured":"Touati, S.-A.-A.: Periodic Task Scheduling under Storage Constraints. In: Proceedings of the Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2007) (August 2007)"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Touati, S.-A.-A., Eisenbeis, C.: Early Periodic Register Allocation on ILP Processors. Parallel Processing Letters\u00a014(2) (June 2004)","DOI":"10.1142\/S012962640400188X"},{"issue":"11","key":"41_CR11","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/291006.291015","volume":"33","author":"M.M. Strout","year":"1998","unstructured":"Strout, M.M., Carter, L., Ferrante, J., Simon, B.: Schedule-Independent Storage Mapping for Loops. ACM SIG-PLAN Notices\u00a033(11), 24\u201333 (1998)","journal-title":"ACM SIG-PLAN Notices"},{"issue":"5","key":"41_CR12","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/381694.378852","volume":"36","author":"W. Thies","year":"2001","unstructured":"Thies, W., Vivien, F., Sheldon, J., Amarasinghe, S.: A Unified Framework for Schedule and Storage Optimization. ACM SIGPLAN Notices\u00a036(5), 232\u2013242 (2001)","journal-title":"ACM SIGPLAN Notices"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:21Z","timestamp":1619522061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}