{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:24:35Z","timestamp":1752549875569,"version":"3.41.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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":[[2000,2]]},"DOI":"10.1023\/a:1007564126785","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:04:10Z","timestamp":1040551450000},"page":"1-46","source":"Crossref","is-referenced-by-count":3,"title":["Enhanced Co-Scheduling: A Software Pipelining Method Using Modulo-Scheduled Pipeline Theory"],"prefix":"10.1007","volume":"28","author":[{"given":"R.","family":"Govindarajan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. S. S. Narasimha","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. R.","family":"Altman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guang R.","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"J. H. Patel and E. S. Davidson, Improving the Throughput of a Pipeline by Insertion of Delays, Proc. Third Ann. Symp. Computer Architecture, Clearwater, Florida, pp. 159\u2013164 (January 1976).","key":"221202_CR1","DOI":"10.1145\/800110.803575"},{"key":"221202_CR2","volume-title":"The Architecture of Pipelined Computers","author":"P. M. Kogge","year":"1981","unstructured":"P. M. Kogge, The Architecture of Pipelined Computers, McGraw-Hill Book Co., New York (1981)."},{"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. 14th Ann. Microprogr. Workshop, Chatham, Massachusetts, pp. 183\u2013198 (October 1981).","key":"221202_CR3","DOI":"10.1145\/1014192.802449"},{"key":"221202_CR4","volume-title":"Highly Concurrent Scalar Processing","author":"P. Y. T. Hsu","year":"1986","unstructured":"P. Y. T. Hsu, Highly Concurrent Scalar Processing, Ph.D. Thesis, Technical Report, University of Illinois at Urbana-Champagne, Urbana, Illinois (1986)."},{"doi-asserted-by":"crossref","unstructured":"M. Lam, Software Pipelining: An Effective Scheduling Technique for VLIW Machines, Proc. SIGPLAN Conf. Progr. Lang. Design and Implementation, Atlanta, Georgia, pp. 318\u2013328 (June 1988).","key":"221202_CR5","DOI":"10.1145\/53990.54022"},{"key":"221202_CR6","series-title":"Research Monographs in Parallel and Dist. Computing","first-page":"274","volume-title":"Advances in Languages and Compilers for Parallel Processing","author":"A. Aiken","year":"1991","unstructured":"A. Aiken and A. Nicolau, A Realistic Resource-Constrained Software Pipelining Algorithm. In A. Nicolau, D. Gelernter, T. Gross, and D. Padua, (eds.), Advances in Languages and Compilers for Parallel Processing, Research Monographs in Parallel and Dist. Computing, Chapter 14, Pitman Publishing and the MIT Press, London, England, and Cambridge, Massachusetts, pp. 274\u2013290 (1991)."},{"key":"221202_CR7","series-title":"Research Report RC 17068","volume-title":"Efficient Algorithms for Cyclic Scheduling","author":"F. Gasperoni","year":"1991","unstructured":"F. Gasperoni and U. Schwiegelshohn, Efficient Algorithms for Cyclic Scheduling, Research Report RC 17068, IBM T. J. Watson Research Center, Yorktown Heights, New York (1991)."},{"doi-asserted-by":"crossref","unstructured":"R. A. Huff, Lifetime-Sensitive Modulo Scheduling, Proc. ACM SIGPLAN Conf. Progr. Lang. Design and Implementation, Albuquerque, New Mexico, pp. 258\u2013267 (June 1993).","key":"221202_CR8","DOI":"10.1145\/155090.155115"},{"key":"221202_CR9","series-title":"Research Report","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, Research Report, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt, France (January 1993)."},{"key":"221202_CR10","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01205184","volume":"7","author":"J. C. Dehnert","year":"1993","unstructured":"J. C. Dehnert and R. A. Towle, Compiling for Cydra 5, J. Supercomputing, 7:181\u2013227 (May 1993).","journal-title":"J. Supercomputing"},{"doi-asserted-by":"crossref","unstructured":"A. E. Eichenberger, E. S. Davidson, and S. G. Abraham, Minimum Register Requirements for a Modulo Schedule, Proc. 27th Ann. Intl. Symp. on Microarchitecture, San Jose, California, pp. 75\u201384 (December 1994).","key":"221202_CR11","DOI":"10.1145\/192724.192732"},{"doi-asserted-by":"crossref","unstructured":"B. R. Rau, Iterative Modulo Scheduling: An Algorithm for Software Pipelining Loops, Proc. 27th Ann. Intl. Symp. on Microarchitecture, San Jose, California, pp. 63\u201374 (December 1994).","key":"221202_CR12","DOI":"10.1145\/192724.192731"},{"doi-asserted-by":"crossref","unstructured":"R. Govindarajan, E. R. Altman, and G. R. Gao, Minimizing Register Requirements Under Resource-Constrained Rate-Optimal Software Pipelining, Proc. 27th Ann. Intl. Symp. on Microarchitecture, San Jose, California, pp. 85\u201394 (December 1994).","key":"221202_CR13","DOI":"10.1145\/192724.192733"},{"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, Proc. ACM SIGPLAN Conf. Progr. Lang. Design and Implementation, La Jolla, California, pp. 139\u2013150 (June 1995).","key":"221202_CR14","DOI":"10.1145\/207110.207128"},{"doi-asserted-by":"crossref","unstructured":"J. Llosa, M. Valero, E. Ayguad\u00e9, and A. Gonz\u00e1lez, Hypernode Reduction Modulo Scheduling, Proc. 28th Ann. Intl. Symp. on Microarchitecture, Ann Arbor, Michigan, pp. 350\u2013360 (December 1995).","key":"221202_CR15","DOI":"10.1109\/MICRO.1995.476844"},{"doi-asserted-by":"crossref","unstructured":"J. Llosa, A. Gonz\u00e1lez, M. Valero, and E. Ayguad\u00e9, Swing Modulo Scheduling: A Lifetime Sensitive Approach, Proc. Intl. Conf. on Parallel Architectures and Compilation Technique Microarchitecture, Boston, Massachusetts, pp. 80\u201386 (October 1996).","key":"221202_CR16","DOI":"10.1109\/PACT.1996.554030"},{"key":"221202_CR17","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, 7:9\u201350 (May 1993).","journal-title":"J. Supercomputing"},{"unstructured":"E. S. Davidson, L. E. Shar, A. T. Thomas, and J. H. Patel, Effective Control for Pipelined Computers, Digest of Papers, 15th IEEE Computer Society International Conference, COMPCON Spring `75 (February 1975).","key":"221202_CR18"},{"doi-asserted-by":"crossref","unstructured":"T. Muller, Employing Finite State Automata for Resource Scheduling, Proc. 26th Ann. Intl. Symp. on Microarchitecture, Austin, Texas (December 1993).","key":"221202_CR19","DOI":"10.1109\/MICRO.1993.282737"},{"doi-asserted-by":"crossref","unstructured":"T. A. Proebsting and C. W. Fraser, Detecting Pipeline Structural Hazards Quickly, Conf. Record of the 21st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, Portland, Oregon, pp. 280\u2013286 (January 1994).","key":"221202_CR20","DOI":"10.1145\/174675.177904"},{"doi-asserted-by":"crossref","unstructured":"V. Bala and N. Rubin, Efficient Instruction Scheduling Using Finite State Automata, Proc. 28th Ann. Intl. Symp. on Microarchitecture, Ann Arbor, Michigan, pp. 46\u201356 (December 1995).","key":"221202_CR21","DOI":"10.1109\/MICRO.1995.476812"},{"doi-asserted-by":"crossref","unstructured":"R. Govindarajan, E. R. Altman, and G. R. Gao, Co-Scheduling Hardware and Software Pipelines, Proc. of the Second Intl. Symp. on High-Performance Computer Architecture, San Jose, California, pp. 52\u201361 (February 1996).","key":"221202_CR22","DOI":"10.1109\/HPCA.1996.501173"},{"issue":"4","key":"221202_CR23","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1145\/321479.321485","volume":"15","author":"R. Reiter","year":"1968","unstructured":"R. Reiter, Scheduling Parallel Computations, J. ACM, 15(4):590\u2013599 (October 1968).","journal-title":"J. ACM"},{"unstructured":"S. Ramakrishnan, Software Pipelining in PA-RISC Compilers, Hewlett-Packard J., pp. 39\u201345 (June 1992).","key":"221202_CR24"},{"unstructured":"R. Govindarajan, N. S. S. Narasimha Rao, E. R. Altman, and G. R. Gao, An Enhanced Co-Scheduling Method Using Reduced MS-State Diagrams, Proc. Merged 12th Intl. Parallel Processing Symp. and Nineth Intl. Symp. on Parallel and Distributed Processing, Orlando, Florida (April 1998).","key":"221202_CR25"},{"doi-asserted-by":"crossref","unstructured":"C. Zhang, R. Govindarajan, S. Ryan, and G. R. Gao, Efficient State-Diagram Construction Methods for Software Pipelining, Proc. Eight Intl. Conf. on Compiler Construction, Amsterdam, The Netherlands (March 1999).","key":"221202_CR26","DOI":"10.1007\/978-3-540-49051-7_11"},{"key":"221202_CR27","series-title":"Technical Report CSE-TR-169-93","volume-title":"Cyclic Job Shop Scheduling Using Collision Vectors","author":"J. K. Chaar","year":"1993","unstructured":"J. K. Chaar and E. S. Davidson, Cyclic Job Shop Scheduling Using Collision Vectors, Technical Report CSE-TR-169-93, University of Michigan, Ann Arbor, Michigan (August 1993)."},{"doi-asserted-by":"crossref","unstructured":"A. E. Eichenberger and E. S. Davidson, A Reduced Multipipeline Machine Description that Preserves Scheduling Constraints, Proc. ACM SIGPLAN Conf. Progr. Lang. Design and Implementation, Philadelphia, Pennsylvania (May 1996).","key":"221202_CR28","DOI":"10.1145\/231379.231386"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007564126785.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007564126785\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007564126785.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:16:20Z","timestamp":1748333780000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007564126785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["221202"],"URL":"https:\/\/doi.org\/10.1023\/a:1007564126785","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}