{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:23:10Z","timestamp":1774628590637,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":[[1998,6]]},"DOI":"10.1023\/a:1018742213548","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T20:54:14Z","timestamp":1045688054000},"page":"313-344","source":"Crossref","is-referenced-by-count":12,"title":["Optimal Modulo Scheduling Through Enumeration"],"prefix":"10.1007","volume":"26","author":[{"given":"Erik R.","family":"Altman","sequence":"first","affiliation":[]},{"given":"Guang R.","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"228602_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01205184","volume":"7","author":"J. C. Dehnert","year":"1993","unstructured":"James C. Dehnert and Ross A. Towle, Compiling for Cydra 5. J. of Supercomputing\n7:181\u2013227 (May 1993).","journal-title":"J. of Supercomputing"},{"key":"#cr-split#-228602_CR2.1","unstructured":"Richard A. Huff, Lifetime-sensitive Modulo Scheduling, Proc. ACM SIGPLAN Conf. Progr. Lang. Design and Implementation, Albuquerque, New Mexico (June 23-25, 1993)"},{"key":"#cr-split#-228602_CR2.2","doi-asserted-by":"crossref","unstructured":"SIGPLAN Notices 28(6):258-267 (June 1993).","DOI":"10.1145\/173262.155115"},{"key":"#cr-split#-228602_CR3.1","unstructured":"Monica Lam, Software Pipelining: An Effective Scheduling Technique For VLIW Machines, Proc. SIGPLAN Conf. Progr. Lang. Design and Implementation, Atlanta, Georgia (June 22-24, 1988)"},{"key":"#cr-split#-228602_CR3.2","doi-asserted-by":"crossref","unstructured":"SIGPLAN Notices 23(7):318-328 (July 1988).","DOI":"10.1145\/960116.54022"},{"key":"228602_CR4","doi-asserted-by":"crossref","unstructured":"Qi Ning and Guang R. Gao, A Novel Framework of Register Allocation for Software Pipelining, Conf. Rec. of the 20th Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Progr. Lang., Charleston, South Carolina, pp. 29\u201342 (January 10\u201313, 1993).","DOI":"10.1145\/158511.158519"},{"key":"228602_CR5","doi-asserted-by":"crossref","unstructured":"B. R. Rau and C. D. Glaeser, Some Scheduling Techniques and an Easily Schedulable Horizontal Architecture for High Performance Scientific Computing, Proc. 14 th Ann. Microprogramming Workshop, Chatham, Massachusetts (October 12\u201315, 1981); ACM SIGMICRO and IEEE-CS TC-MICRO, pp. 183\u2013198.","DOI":"10.1145\/1014192.802449"},{"key":"#cr-split#-228602_CR6.1","doi-asserted-by":"crossref","unstructured":"B. R. Rau, M. Lee, P. P. Tirumalai, and M. S. Schlansker, Register Allocation for Software Pipelined Loops, Proc. ACM SIGPLAN Conf. on Progr. Lang. Design and Implementation, San Francisco, California (June 17-19, 1992)","DOI":"10.1145\/143095.143141"},{"key":"#cr-split#-228602_CR6.2","doi-asserted-by":"crossref","unstructured":"SIGPLAN Notices 27(7):283-299 (July 1992).","DOI":"10.1145\/143103.143141"},{"key":"#cr-split#-228602_CR7.1","doi-asserted-by":"crossref","unstructured":"Roy F. Touzeau, A FORTRAN Compiler for the FPS-164 Scientific Computer, Proc. SIGPLAN Symp. on Compiler Construction, Montr\u00e9al, Qu\u00e9bec (June 17-22, 1984)","DOI":"10.1145\/502874.502879"},{"key":"#cr-split#-228602_CR7.2","doi-asserted-by":"crossref","unstructured":"ACM SIGPLAN. SIGPLAN Notices 19(6):48-57 (June 1984).","DOI":"10.1145\/502949.502879"},{"key":"228602_CR8","first-page":"274","volume-title":"Advances in Languages and Compilers for Parallel Processing, Research Monographs in Parallel and Distribution Computing","author":"A. Aiken","year":"1991","unstructured":"Alexander Aiken and Alexandru Nicolau, A Realistic Resource-Constrained Software Pipelining Algorithm. In Alexandru Nicolau, David Gelernter, Thomas Gross, and David Padua, (eds.), Advances in Languages and Compilers for Parallel Processing, Research Monographs in Parallel and Distribution Computing, Chap. 14, pp. 274\u2013290. Pitman Pub. and the MIT Press, London, England, and Cambridge, Massachusetts (1991) Selected papers from the Third Workshop on Languages and Compilers for Parallel Computing, Irvine, California (August 1\u20133, 1990)."},{"key":"228602_CR9","first-page":"213","volume-title":"Languages and Compilers for Parallel Computing","author":"K. Ebcio\u011flu","year":"1990","unstructured":"Kemal Ebcio\u011flu and Toshio Nakatani, A New Compilation Technique for Parallelizing Loops with Unpredictable Branches on a VLIW Architecture. In David Gelernter (ed.), Languages and Compilers for Parallel Computing, MIT Press, Cambridge, Massachusetts, pp. 213\u2013229 (1990)."},{"key":"#cr-split#-228602_CR10.1","doi-asserted-by":"crossref","unstructured":"Soo-Mook Moon and Kemal Ebcio\u011flu, An Efficient Resource-Constrained Global Scheduling Technique for Superscalar and VLIW Processors, Proc. 25th Ann. Int'l. Symp. on Microarchitecture, Portland, Oregon (December 1-4, 1992)","DOI":"10.1145\/144965.145000"},{"key":"#cr-split#-228602_CR10.2","doi-asserted-by":"crossref","unstructured":"ACM SIGMICRO and IEEE-CS TC-MICRO. SIG MICRO Newsletter 23(1,2):55-71 (December 1992).","DOI":"10.1145\/144965.145000"},{"key":"#cr-split#-228602_CR11.1","doi-asserted-by":"crossref","unstructured":"Steven R. Vegdahl, A Dynamic-Programming Technique for Compacting Loops, Proc. 25th Ann. Int'l. Symp. on Microarchitecture, Portland, Oregon (December 1-4, 1992); ACM SIGMICRO and IEEE-CS TC-MICRO. SIG MICRO Newsletter","DOI":"10.1145\/144965.145797"},{"key":"#cr-split#-228602_CR11.2","unstructured":"23(1,2):180-188 (December 1992)."},{"key":"228602_CR12","doi-asserted-by":"crossref","unstructured":"John Ruttenberg, Guang R. Gao, Artour Stoutchinin, and W. Lichtenstein, Software Pipelining Showdown: Optimal vs Heuristic Methods in a Production Compiler, Proc. SIGPLAN PLDI, Philadelphia (May 1996).","DOI":"10.1145\/231379.231385"},{"key":"228602_CR13","volume-title":"Optimal Software Pipelining with Function Unit and Register Constraints","author":"E. R. Altman","year":"1995","unstructured":"Erik R. Altman, Optimal Software Pipelining with Function Unit and Register Constraints, Ph.D. thesis, McGill University, Montr\u00e9al, Qu\u00e9bec (October 1995)."},{"key":"228602_CR14","series-title":"ACAPS Tech. Memo","volume-title":"Scheduling and Mapping: Software Pipelining in the Presence of Structural Hazards","author":"E. R. Altman","year":"1995","unstructured":"Erik R. Altman, R. Govindarajan, and Guang R. Gao, Scheduling and Mapping: Software Pipelining in the Presence of Structural Hazards. ACAPS Tech. Memo 91, Sch. of Comp. Sci., McGill University, Montr\u00e9al, Qu\u00e9bec (January 1995) In ftp:\/\/ftp-acaps.cs.mcgill.ca\/pub\/doc\/memos."},{"key":"228602_CR15","doi-asserted-by":"crossref","unstructured":"Alexandre E. Eichenberger and Edward S. Davidson, Efficient Formulation for Optimal Modulo Schedulers, Proc. SIGPLAN PLDI, Las Vegas, Nevada, pp. 194\u2013205 (June 1997).","DOI":"10.1145\/258915.258933"},{"key":"228602_CR16","doi-asserted-by":"crossref","unstructured":"P. Feautrier, Fine-grain Scheduling under Resource Constraints, Seventh Ann. Workshop on Lang. and Compilers for Parallel Computing, Ithaca (August 1994).","DOI":"10.1007\/BFb0025867"},{"key":"228602_CR17","doi-asserted-by":"crossref","unstructured":"R. Govindarajan, Erik R. Altman, and Guang R. Gao, Minimizing Register Requirements under Resource-Constrained Rate-Optimal Software Pipelining, Proc. of the 27th Ann. Int'l. Symp. on Microarchitecture, San Jose, California, pp. 85\u201394 (November 30\u2013December 2, 1994); ACM SIGMICRO and IEEE-CS TC-MICRO.","DOI":"10.1145\/192724.192733"},{"key":"228602_CR18","doi-asserted-by":"crossref","unstructured":"J. R. Allen, Ken Kennedy, Carrie Portefield, and Joe Warren, Conversion of Control Dependence to Data Dependence, Conf. Rec. of the Tenth Ann. ACM Symp. Principles of Progr. Lang. Austin, Texas, pp. 177\u2013189 ( January 24\u201326, 1983).","DOI":"10.1145\/567067.567085"},{"key":"228602_CR19","doi-asserted-by":"crossref","unstructured":"Nancy J. Warter, Scott A. Mahlke, Wen-mei W. Hwu, and B. Ramakrishna Rau, Reverse If-Conversion, Proc. SIGPLAN PLDI, Albuquerque, New Mexico, pp. 290\u2013299 (June 1993).","DOI":"10.1145\/155090.155118"},{"key":"228602_CR20","doi-asserted-by":"crossref","unstructured":"Alexandre E. Eichenberger, Edward S. Davidson, and Santosh G. Abraham, Optimum Modulo Schedules for Minimum Register Requirements, Conf. Proc. Int'l. Conf. on Supercomputing, Barcelona, Spain, pp. 31\u201340 (July 3\u20137, 1995); ACM SIGARCH.","DOI":"10.1145\/224538.224542"},{"issue":"6","key":"228602_CR21","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/2.294853","volume":"27","author":"J. E. Smith","year":"1994","unstructured":"James E. Smith and Shlomo Weiss, PowerPC 601 and Alpha 21064: A Tale of Two RISCs, Computer\n27(6):46\u201358 (June 1994).","journal-title":"Computer"},{"key":"228602_CR22","doi-asserted-by":"crossref","unstructured":"Peter Song and Marvin Denman, The PowerPC 604 RISC Microprocessor, Motorola, IBM Corporation (1994).","DOI":"10.1109\/MM.1994.363071"},{"issue":"7","key":"228602_CR23","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1145\/960116.54021","volume":"23","author":"A. Aiken","year":"1988","unstructured":"Alexander Aiken and Alexandru Nicolau, Optimal Loop Parallelization, Proc. SIGPLAN Conf. on Progr. Lang. Design and Implementation, Atlanta, Georgia, June 22\u201324, 19988. SIGPLAN Notices\n23(7):308\u2013317 (July 1988).","journal-title":"SIGPLAN Notices"},{"key":"228602_CR24","doi-asserted-by":"crossref","unstructured":"Alexandre E. Eichenberger, Edward S. Davidson, and Santosh G. Abraham, Minimum Register Requirements for a Modulo Schedule, Proc. of the 27th Ann. Int' l. Symp. on Microarchitecture, San Jose, California, pp. 75\u201384 (November 30\u2013December 2, 1994); ACM SIGMICRO and IEEE-CS TC-MICRO.","DOI":"10.1145\/192724.192732"},{"key":"228602_CR25","volume-title":"Efficient Algorithms for Cyclic Scheduling","author":"F. Gasperoni","year":"1991","unstructured":"F. Gasperoni and U. Schwiegelshohn, Efficient Algorithms for Cyclic Scheduling, Res. Rep. RC 17068, IBM T. J. Watson Res. Center, Yorktown Heights, New York (1991)."},{"key":"228602_CR26","doi-asserted-by":"crossref","unstructured":"B. Ramakrishna Rau, Iterative Modulo Scheduling: An Algorithm for Software Pipelining Loops, Proc. 27th Ann. Int'l. Symp. on Microarchitecture, San Jose, California, pp. 63\u201374 (November 30\u2013December 2, 1994); ACM SIGMICRO and IEEE-CS TC-MICRO.","DOI":"10.1145\/192724.192731"},{"key":"228602_CR27","first-page":"613","volume":"634","author":"V. Van Dongen","year":"1992","unstructured":"V. Van Dongen, G. R. Gao, and Q. Ning, A Polynomial Time Method for Optimal Software Pipelining, Proc. Conf. on Vector and Parallel Processing, CONPAR-92, LNCS Springer-Verlag, Lyon, France 634:613\u2013624 (September 1\u20134, 1992).","journal-title":"Proc. Conf. on Vector and Parallel Processing, CONPAR-92"},{"key":"228602_CR28","volume-title":"A New Approach to Software Pipelining of Complicated Loops with Branches","author":"J. Wang","year":"1993","unstructured":"J. Wang and E. Eisenbeis, A New Approach to Software Pipelining of Complicated Loops with Branches. Res. Rep. No., Institut Nat. de Recherche en Informatique et en Automatique (INRIA), Rocquencourt, France ( January 1993)."},{"key":"#cr-split#-228602_CR29.1","doi-asserted-by":"crossref","unstructured":"Nancy J. Warter, Grant E. Haab, John W. Bockhaus, and Krishna Subramanian, Enhanced Modulo Scheduling for Loops with Conditional Brances, Proc. 25th Ann. Int'l. Symp. on Microarchitecture, Portland, Oregon (December 1-4, 1992); ACM SIGMICRO and IEEE-CS TC-MICRO. SIG MICRO Newsletter","DOI":"10.1145\/144965.145796"},{"key":"#cr-split#-228602_CR29.2","unstructured":"23(1,2):170-179 (December 1992)."},{"key":"228602_CR30","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01205181","volume":"7","author":"B. R. Rau","year":"1993","unstructured":"B. R. Rau and J. A. Fisher, Instruction-level Parallel Processing: History, Overview and Perspective, J. Supercomputing\n7:9\u201350 (May 1993).","journal-title":"J. Supercomputing"},{"issue":"3","key":"228602_CR31","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/212094.212131","volume":"27","author":"V. H. Allan","year":"1995","unstructured":"Vicki H. Allan, Reese B. Jones, Randall M. Lee, and Stephen J. Allan, Software Pipelining, ACM Computing Surveys\n27(3):367\u2013432 (September 1995).","journal-title":"ACM Computing Surveys"},{"key":"228602_CR32","series-title":"Technical Report","volume-title":"Highly Concurrent Scalar Processing","author":"P. Y. T. Hsu","year":"1986","unstructured":"P. Y. T. Hsu, Highly Concurrent Scalar Processing. Technical Report, University of Illinois at Urbana-Champagne, Urbana, Illinois, Ph.D. thesis (1986)."},{"issue":"12","key":"228602_CR33","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1109\/71.476167","volume":"6","author":"A. Aiken","year":"1995","unstructured":"Alexander Aiken, Alexandru Nicolau, and Steven Novack, Resource-Constrained Software Pipelining, IEEE Trans. Parallel and Distributed Syst. 6(12):1248\u20131270 (December 1995).","journal-title":"IEEE Trans. Parallel and Distributed Syst."},{"key":"228602_CR34","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1007\/BFb0024784","volume-title":"Proc. Euro-Par '96 Conf. Parallel Processing","author":"E. R. Altman","year":"1996","unstructured":"Erik R. Altman and Guang R. Gao, Optimal Software Pipelining Through Enumeration of Schedules, In Luc Boug\u00e9, Pierre Fraigniaud, Anne Mignotte, and Yves Robert, (eds.), Proc. Euro-Par '96 Conf. Parallel Processing, Springer-Verlag, Lyon, pp. 833\u2013840 (August 1996)."},{"key":"228602_CR35","unstructured":"T. C. Hu, Integer Programming and Network Flows, Addison-Wesley Pub. Co. (1969)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018742213548.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018742213548\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018742213548.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:14:25Z","timestamp":1748333665000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018742213548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["228602"],"URL":"https:\/\/doi.org\/10.1023\/a:1018742213548","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}