{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:40:04Z","timestamp":1748335204220,"version":"3.41.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"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":[[2003,10]]},"DOI":"10.1023\/a:1027387028481","type":"journal-article","created":{"date-parts":[[2003,11,9]],"date-time":"2003-11-09T22:46:39Z","timestamp":1068417999000},"page":"339-391","source":"Crossref","is-referenced-by-count":4,"title":["Time Optimal Software Pipelining of Loops with Control Flows"],"prefix":"10.1007","volume":"31","author":[{"given":"Han-Saem","family":"Yun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jihong","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soo-Mook","family":"Moon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"473580_CR1","doi-asserted-by":"crossref","unstructured":"A. Aiken and A. Nicolau, Optimal Loop Parallelization, in Proc. of the ACM SIGPLAN' 88 Conference on Programming Language Design and Implementation, pp. 308-317 (1988).","DOI":"10.1145\/53990.54021"},{"key":"473580_CR2","doi-asserted-by":"crossref","unstructured":"A. Aiken and A. Nicolau, Perfect Pipelining, in Proc. of the Second European Symposium on Programming, Lecture Notes in Computer Science, Vol. 300, Springer-Verlag, pp. 221-235 (1988).","DOI":"10.1007\/3-540-19027-9_15"},{"issue":"12","key":"473580_CR3","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1109\/71.476167","volume":"6","author":"A. Aiken","year":"1995","unstructured":"A. Aiken, A. Nicolau, and S. Novack. Resource-Constrained Software Pipelining, IEEE Trans. Parall. Distr.\n6(12):1248-1270 (1995).","journal-title":"IEEE Trans. Parall. Distr."},{"key":"473580_CR4","doi-asserted-by":"crossref","unstructured":"J. R. Allen, K. Kennedy, C. Porterfield, and J. Warren, Conversion of Control Dependence to Data Dependence, in Proc. of the 10th ACM Symposium on Principles of Programming Languages, pp. 177-189 (1983).","DOI":"10.1145\/567067.567085"},{"key":"473580_CR5","doi-asserted-by":"crossref","unstructured":"E. R. Altman, R. Govindarajan, and G. R. Gao, Scheduling and Mapping: Software Pipelining in the Presence of Structural Hazards, in Proc. of the ACM SIGPLAN' 95 Conference on Programming Language Design and Implementation, pp. 139-150 (1995).","DOI":"10.1145\/207110.207128"},{"issue":"1","key":"473580_CR6","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/71.655240","volume":"9","author":"P.-Y. Calland","year":"1998","unstructured":"P.-Y. Calland, A. Darte, and Y. Robert, Circuit Retiming Applied to Decomposed Software Pipelining, IEEE Trans. Parall. Distr.\n9(1):24-35 (1998).","journal-title":"IEEE Trans. Parall. Distr."},{"issue":"12","key":"473580_CR7","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1109\/71.640018","volume":"8","author":"L.-F. Chao","year":"1997","unstructured":"L.-F. Chao and E. Sha, Scheduling Data-Flow Graphs via Retiming and Unfolding, IEEE Trans. Parall. Distr.\n8(12):1259-1267 (1997).","journal-title":"IEEE Trans. Parall. Distr."},{"issue":"4","key":"473580_CR8","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and F. Zadeck, Efficiently Computing Static Single Assignment Form and the Control Dependence Graph, ACM Trans. Progr. Lang. Sys.\n13(4):451-490 (1991).","journal-title":"ACM Trans. Progr. Lang. Sys."},{"key":"473580_CR9","unstructured":"K. Ebcio\u011fglu, Some Design Ideas for a VLIW Architecture for Sequential Natured Soft-ware, in Proc. of IFIP WG 10.3 Working Conference on Parallel Processing, pp. 3-21 (1988)."},{"issue":"3","key":"473580_CR10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/24039.24041","volume":"9","author":"J. Farrante","year":"1987","unstructured":"J. Farrante, K. Ottenstein, and J. Warren. The Program Dependence Graph and Its Use in Optimization, ACM Trans. Progr. Lang. Sys.\n9(3):319-349 (1987).","journal-title":"ACM Trans. Progr. Lang. Sys."},{"issue":"4","key":"473580_CR11","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1142\/S0129626494000363","volume":"4","author":"F. Gasperoni","year":"1994","unstructured":"F. Gasperoni and U. Schwiegelshohn, Generating Close to Optimum Loop Schedules on Parallel Processors, Parallel Process. Lett.\n4(4):391-403 (1994).","journal-title":"Parallel Process. Lett."},{"key":"473580_CR12","doi-asserted-by":"crossref","unstructured":"F. Gasperoni and U. Schwiegelshohn, Optimal Loop Scheduling on Multiprocessors: A Pumping Lemma for p-Processor Schedules, in Proc. of the 3rd Interna-tional Conference on Parallel Computing Technologies, pp. 51-56 (1995).","DOI":"10.1007\/3-540-60222-4_96"},{"issue":"2","key":"473580_CR13","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/S0304-3975(97)00207-7","volume":"196","author":"F. Gasperoni","year":"1998","unstructured":"F. Gasperoni and U. Schwiegelshohn, List Scheduling in the Presence of Branches: A Theoretical Evaluation, Theoret. Comput. Sci., 196(2):347-363 (1998).","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"473580_CR14","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1109\/71.544355","volume":"7","author":"R. Govindarajan","year":"1996","unstructured":"R. Govindarajan, E. R. Altman, and G. R. Gao. A Framework for Resource-Constrained Rate-Optimal Software Pipelining, IEEE Trans. Parall. Distr.\n7(11):1133-1149 (1996).","journal-title":"IEEE Trans. Parall. Distr."},{"issue":"6","key":"473580_CR15","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1145\/267959.269971","volume":"19","author":"J. Janssen","year":"1997","unstructured":"J. Janssen and H. Corporaal, Making Graphs Reducible with Controlled Node Splitting, ACM Trans. Progr. Lang. Sys.\n19(6):1031-1052 (1997).","journal-title":"ACM Trans. Progr. Lang. Sys."},{"issue":"1","key":"473580_CR16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0204007","volume":"4","author":"D. Johnson","year":"1975","unstructured":"D. Johnson, Finding All the Elementary Circuits of a Directed Graph, SIAM J. Comput.\n4(1):77-84 (1975).","journal-title":"SIAM J. Comput."},{"issue":"9","key":"473580_CR17","first-page":"977","volume":"52","author":"S. Kim","year":"2002","unstructured":"S. Kim, S.-M. Moon, J. Park, and K. Ebcio\u011fglu, Unroll-based Copy Elimination for Enhanced Pipeline Scheduling, IEEE Trans. Comput.\n52(9):977-994 (2002).","journal-title":"IEEE Trans. Comput."},{"key":"473580_CR18","doi-asserted-by":"crossref","unstructured":"D. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. Wolfe, Dependence Graphs and Compiler Optimizations, in Proc. of the 8th ACM Symposium on Principles of Programming Languages, pp. 207-218 (1981).","DOI":"10.1145\/567532.567555"},{"key":"473580_CR19","doi-asserted-by":"crossref","unstructured":"M. Lam, Software pipelining: An Effective Scheduling Technique for VLIW Machines, in Proc. of the ACM SIGPLAN' 88 Conference on Programming Language Design and Implementation, pp. 318-328 (1988).","DOI":"10.1145\/53990.54022"},{"issue":"3","key":"473580_CR20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1015453520790","volume":"30","author":"D. Milicev","year":"2002","unstructured":"D. Milicev and Z. Jovanovic, Control Flow Regeneration for Software Pipelined Loops with Conditions, Int. J. Parallel Prog.\n30(3):149-179 (2002).","journal-title":"Int. J. Parallel Prog."},{"issue":"8","key":"473580_CR21","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1109\/71.406961","volume":"6","author":"S.-M. Moon","year":"1995","unstructured":"S.-M. Moon and S. Carson, Generalized Multi-Way Branch Unit for VLIW Microprocessors, IEEE Trans. Parall. Distr.\n6(8):850-862 (1995).","journal-title":"IEEE Trans. Parall. Distr."},{"issue":"6","key":"473580_CR22","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1145\/267959.269966","volume":"19","author":"S.-M. Moon","year":"1997","unstructured":"S.-M. Moon and K. Ebcio\u011fglu, Parallelizing Non-Numerical Code with Selective Scheduling and Software Pipelining, ACM Trans. Progr. Lang. Sys.\n19(6):853-898 (1997).","journal-title":"ACM Trans. Progr. Lang. Sys."},{"key":"473580_CR23","unstructured":"A. Nicolau, Uniform Parallelism Exploitation in Ordinary Programs, in Proc. of the International Conference on Parallel Processing, pp. 614-618 (1985)."},{"key":"473580_CR24","unstructured":"S. Park, S. Shim, and S.-M. Moon, Evaluation of Scheduling Techniques on a SPARC-Based VLIW Testbed, in Proc. of the 30th Annual International Symposium on Microarchitecture, pp. 104-113 (1997)."},{"key":"473580_CR25","doi-asserted-by":"crossref","unstructured":"K. Pingali, M. Beck, R. Johnson, M. Moudgill, and P. Stodghill, Dependence Flow Graphs: An Algebraic Approach to Program Dependences, in Proc. of the 18th ACM Symposium on Principles of Programming Languages, pp. 67-78 (1991).","DOI":"10.1145\/99583.99595"},{"issue":"2","key":"473580_CR26","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. Ebcio\u011fglu, On Optimal Parallelization of Arbitrary Loops, J. Parallel. Distr. Com.\n11(2):130-134 (1991).","journal-title":"J. Parallel. Distr. Com."},{"key":"473580_CR27","unstructured":"S. Shim and S.-M. Moon, Split-Path Enhanced Pipeline Scheduling for Loops with Control Flows, in Proc. of the 29th Annual Symposium on Microarchitecture, pp. 93-102 (1998)."},{"issue":"5","key":"473580_CR28","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1109\/71.159040","volume":"3","author":"A. Uht","year":"1992","unstructured":"A. Uht, Requirements for Optimal Execution of Loops with Tests, IEEE Trans. Parall. Distr.\n3(5):573-581 (1992).","journal-title":"IEEE Trans. Parall. Distr."},{"key":"473580_CR29","doi-asserted-by":"crossref","unstructured":"D. W. Wall, Limits of Instruction-Level Parallelism, in Proc. of the 4th International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 176-188 (1991).","DOI":"10.1145\/106972.106991"},{"key":"473580_CR30","doi-asserted-by":"crossref","unstructured":"N. Warter, S. Mahlke, W-M. Hwu, and B. Rau, Reverse If-Conversion, in Proc. of the ACM SIGPLAN' 93 Conference on Programming Language Design and Implementation, pp. 290-299 (1993).","DOI":"10.1145\/155090.155118"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027387028481.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1027387028481\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027387028481.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:26:16Z","timestamp":1748334376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1027387028481"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["473580"],"URL":"https:\/\/doi.org\/10.1023\/a:1027387028481","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}