{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:46:28Z","timestamp":1748335588501,"version":"3.41.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Parallel Programming"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1023\/a:1015453520790","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T23:44:51Z","timestamp":1041119091000},"page":"149-179","source":"Crossref","is-referenced-by-count":3,"title":["Control Flow Regeneration for Software Pipelined Loops with Conditions"],"prefix":"10.1007","volume":"30","author":[{"given":"Dragan","family":"Milicev","sequence":"first","affiliation":[]},{"given":"Zoran","family":"Jovanovic","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"373991_CR1","doi-asserted-by":"crossref","unstructured":"K. Ebcioglu, A Compilation Technique for Software Pipelining of Loops with Conditional Jumps, Proc. 20th Ann. Workshop on Microprogramming, (MICRO-20), pp. 69\u201379 (1987).","DOI":"10.1145\/255305.255317"},{"key":"373991_CR2","doi-asserted-by":"crossref","unstructured":"S.-M. Moon and K. Ebcioglu, An Efficient Resource-Constrained Global Scheduling Technique for Superscalar and VLIW Processors, Proc. 25th Ann. Int'l. Symp. Microarch, (MICRO-25), pp. 55\u201371 (1992).","DOI":"10.1145\/144965.145000"},{"key":"373991_CR3","unstructured":"A. Nikolau, Percolation Scheduling: A Parallel Compilation Technique, TR-85-678, Cornell University, (1985)."},{"key":"373991_CR4","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1145\/24039.24041","volume":"9","author":"J. Ferrante","year":"1987","unstructured":"J. Ferrante, K. J. Ottenstein, and J. D. Warren, The Program Dependence Graph and its Use in Optimization, ACM Trans. Prog. Lang. Syst., 9: 310\u2013349 (1987).","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"373991_CR5","doi-asserted-by":"crossref","unstructured":"N. J. Warter, S. A. Mahlke, W-M. W. Hwu, and B. R. Rau, Reverse If-Conversion, Proc. ACM SIGPLAN Conf. Prog. Lang. Design and Implementation, pp. 290\u2013299 (1993).","DOI":"10.1145\/155090.155118"},{"key":"373991_CR6","doi-asserted-by":"crossref","unstructured":"B. R. Rau, Iterative Modulo Scheduling: An Algorithm for Software Pipelining Loops, Proc. 27th Ann. Int'l. Symp. Microarch, (MICRO-27), pp. 63\u201374 (1994).","DOI":"10.1145\/192724.192731"},{"key":"373991_CR7","unstructured":"M. Stoodley and C. Lee, Software Pipelining Loops with Conditional Branches, Proc. 29th Ann. Int'l. Symp. Microarch, (MICRO-29) (1996)."},{"key":"373991_CR8","doi-asserted-by":"crossref","unstructured":"B. Su and J. Wang, GURPR: A New Global Software Pipelining Algorithm, Proc. 24th Ann. Workshop Microprog. and Microarch, (MICRO-24), pp. 212\u2013216 (1991).","DOI":"10.1145\/123465.123509"},{"key":"373991_CR9","doi-asserted-by":"crossref","unstructured":"Z. Tang, G. Chen, C. Zhang, Y. Zhang, B. Su, and S. Habib, GPMB-Software Pipelining Branch-Intensive Loops, Proc. 26th Ann. Int'l. Symp. Microarch, (MICRO-26) (1993).","DOI":"10.1109\/MICRO.1993.282738"},{"key":"373991_CR10","doi-asserted-by":"crossref","unstructured":"N. J. Warter, J. W. Bockhaus, G. E. Haab, and K. Subramanian, Enhanced Modulo Scheduling for Loops with Conditional Branches, Proc. 25th Ann. Int'l. Symp. Microarch., (MICRO-25), pp. 170\u2013179 (1992).","DOI":"10.1109\/MICRO.1992.697013"},{"key":"373991_CR11","doi-asserted-by":"crossref","unstructured":"N. J. Warter-Perez and N. Partamian, Modulo Scheduling with Multiple Initiation Intervals, Proc. 28th Ann. Int'l. Symp. Microarch, (MICRO-28), pp. 111\u2013118 (1995).","DOI":"10.1109\/MICRO.1995.476818"},{"key":"373991_CR12","unstructured":"S. Shim and S.-M. Moon, Split-Path Enhanced Pipeline Scheduling for Loops with Control Flows, Proc. 31st Ann. Int'l. Symp. Microarch, (MICRO-31) (1998)."},{"key":"373991_CR13","doi-asserted-by":"crossref","unstructured":"J. R. Allen, K. Kennedy, C. Porterfield, and J. Warren, Conversion of Control Dependence to Data Dependence, Proc. 10th ACM Symp. Principles of Prog. Lang., pp. 177\u2013189 (1983).","DOI":"10.1145\/567067.567085"},{"key":"373991_CR14","doi-asserted-by":"crossref","unstructured":"B. R. Rau, M. S. Schlansker, and P. P. Tirumalai, Code Generation Schema for Modulo Scheduled Loops, Proc. 25th Ann. Int'l. Symp. Microarch, (MICRO-25), pp. 158\u201369 (1992).","DOI":"10.1109\/MICRO.1992.697012"},{"key":"373991_CR15","doi-asserted-by":"crossref","unstructured":"A. Aiken and A. Nicolau, Optimal Loop Parallelization, Proc. ACM SIGPLAN 1988 Conf. Prog. Lang. Design and Implementation, pp. 308\u2013317 (1988).","DOI":"10.1145\/53990.54021"},{"key":"373991_CR16","doi-asserted-by":"crossref","unstructured":"D. Milicev and Z. Jovanovic, A Formal Model of Software Pipelining Loops with Conditions, Proc. 11th Int'l. Parallel Processing Symp, (IPPS '97), pp. 554\u2013558 (1997).","DOI":"10.1109\/IPPS.1997.580955"},{"key":"373991_CR17","unstructured":"D. Milicev and Z. Jovanovic, Predicated Software Pipelining Technique for Loops with Conditions, Proc. 12th Int'l. Parallel Processing Symp, (IPPS '98) (1998)."},{"key":"373991_CR18","unstructured":"A. Aho, R. Sethi, and J. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley (1986)."},{"key":"373991_CR19","unstructured":"D. Milicev and Z. Jovanovic, Code Generation for Software Pipelined Loops with Conditions, Technical Report TI-RTI-99-0041, University of Belgrade, Faculty of Electrical Engineering (1999). Also available at: http:\/\/www.rcub.bg.ac.yu\/~dmilicev"},{"key":"373991_CR20","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0743-7315(91)90118-S","volume":"11","author":"U. Schwiegelshohn","year":"1991","unstructured":"U. Schwiegelshohn, F. Gasperoni, and K. Ebcioglu, On Optimal Parallelization of Arbitrary Loops, J. of Parallel and Distributed Computing, 11:130\u2013134 (1991).","journal-title":"J. of Parallel and Distributed Computing"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015453520790.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015453520790\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015453520790.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:17:00Z","timestamp":1748333820000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015453520790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["373991"],"URL":"https:\/\/doi.org\/10.1023\/a:1015453520790","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}