{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:28:34Z","timestamp":1752550114355},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657170"},{"type":"electronic","value":"9783540490517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-49051-7_11","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T07:36:53Z","timestamp":1286955413000},"page":"153-167","source":"Crossref","is-referenced-by-count":5,"title":["Efficient State-Diagram Construction Methods for Software Pipelining"],"prefix":"10.1007","author":[{"given":"Chihong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Ramaswamy","family":"Govindarajan","sequence":"additional","affiliation":[]},{"given":"Sean","family":"Ryan","sequence":"additional","affiliation":[]},{"given":"Guang R.","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Altman, E.R.: Optimal Software Pipelining with Function Unit and Register Constraints. Ph.D. thesis, McGill U., Montr\u00e9al, Qu\u00e9 (October 1995)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bala, V., Rubin, N.: Efficient instruction scheduling using finite state automata. In: Proc. of the 28th Ann. Intl. Symp. on Microarchitecture, Ann Arbor, November 29\u2013December 1, pp. 46\u201356 (1995)","DOI":"10.1109\/MICRO.1995.476812"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Beck, G., Yen, D.W.L., Anderson, T.L.: The Cydra-5 minisupercomputer: Architecture and implementation. Journal of Supercomputing\u00a07 (1993)","DOI":"10.1007\/978-1-4615-3200-2_5"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Eichenberger, A.E., Davidson, E.S.: A reduced multipipeline machine description that preserves scheduling constraints. In: Proc. of the ACM SIGPLAN 1996 Conf. on Programming Language Design and Implementation, Philadelphia, PA, May 21\u201324, pp. 12\u201322 (1996)","DOI":"10.1145\/231379.231386"},{"key":"11_CR5","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/HPCA.1996.501173","volume-title":"Proc. of the Second Intl. Symp. on High-Performance Computer Architecture","author":"R. Govindarajan","year":"1996","unstructured":"Govindarajan, R., Altman, E.R., Gao, G.R.: Co-scheduling hardware and software pipelines. In: Proc. of the Second Intl. Symp. on High-Performance Computer Architecture, San Jose, CA, February 3\u20137, pp. 52\u201361. IEEE Computer Society, Los Alamitos (1996)"},{"key":"11_CR7","volume-title":"Proc. of the 12th Intl. Parallel Processing Symp.","author":"R. Govindarajan","year":"1998","unstructured":"Govindarajan, R., Narasimha Rao, N.S.S., Altman, E.R., Gao, G.R.: An enhanced co-scheduling method using reduced ms-state diagrams. In: Proc. of the 12th Intl. Parallel Processing Symp., Orlando, FL, IEEE Computer Society, Los Alamitos (1998); Merged with 9th Intl. Symp. on Parallel and Distributed Processing"},{"key":"#cr-split#-11_CR8.1","unstructured":"Govindarajan, R., Narasimha Rao, N.S.S., Altman, E.R., Gao, G.R.: An enhanced co-scheduling method using reduced ms-state diagrams. CAPSL Technical Memo 17, Dept. of Electrical & Computer Engineering, University of Delaware, Newark 19716, U.S.A. (February 1998);"},{"key":"#cr-split#-11_CR8.2","unstructured":"Also as Tech. Report TR-98-06, Dept. of Computer Science & Automation, Indian Institute of Science, Bangaloe, 560 012, India (available via) http:\/\/www.csa.iisc.ernet.in\/~govind\/papers\/TR-98-2.ps.gz"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Huff, R.A.: Lifetime-sensitive modulo scheduling. In: Proc. of the ACM SIGPLAN 1993 Conf. on Programming Language Design and Implementation, Albuquerque, New Mexico, June 23\u201325, pp. 258\u2013267 (1993)","DOI":"10.1145\/155090.155115"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Lam, M.: Software pipelining: An effective scheduling technique for VLIW machines. In: Proc. of the SIGPLAN 1988 Conf. on Programming Language Design and Implementation, Atlanta, Georgia, June 22\u201324, pp. 318\u2013328 (1988)","DOI":"10.1145\/960116.54022"},{"key":"11_CR11","volume-title":"Introduction to Combinatorial Mathematics","author":"C.L. Liu","year":"1968","unstructured":"Liu, C.L.: Introduction to Combinatorial Mathematics. McGraw-Hill Book Co., New York (1968)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Muller, T.: Employing finite state automata for resource scheduling. In: Proc. of the 26th Ann. Intl. Symp. on Microarchitecture, Austin, TX, December 1\u20133 (1993)","DOI":"10.1109\/MICRO.1993.282737"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Patel, J.H., Davidson, E.S.: Improving the throughput of a pipeline by insertion of delays. In: Proc. of the 3rd Ann. Symp. on Computer Architecture, Clearwater, FL, January 19\u201321, pp. 159\u2013164 (1976)","DOI":"10.1145\/800110.803575"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Proebsting, T.A., Fraser, C.W.: Detecting pipeline structural hazards quickly. In: Conf. Record of the 21st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, Portland, OR, January 17\u201321, pp. 280\u2013286 (1994)","DOI":"10.1145\/174675.177904"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01205181","volume":"7","author":"B.R. Rau","year":"1993","unstructured":"Rau, B.R., Fisher, J.A.: Instruction-level parallel processing: History, overview and perspective. Journal of Supercomputing\u00a07, 9\u201350 (1993)","journal-title":"Journal of Supercomputing"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Rau, B.R.: Iterative modulo scheduling: An algorithm for software pipelining loops. In: Proc. of the 27th Ann. Intl. Symp. on Microarchitecture, San Jose, California, November 30\u2013December 2, pp. 63\u201374 (1994)","DOI":"10.1145\/192724.192731"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Ruttenberg, J., Gao, G.R., Stouchinin, A., Lichtenstein, W.: Software pipelining showdown: Optimal vs. heuristic methods in a production compiler. In: Proc. of the ACM SIGPLAN 1996 Conf. on Programming Language Design and Implementation, Philadelphia, PA, May 21\u201324, pp. 1\u201311 (1996)","DOI":"10.1145\/249069.231385"},{"issue":"3","key":"11_CR18","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM Jl. on Computing\u00a06(3), 505\u2013517 (1977)","journal-title":"SIAM Jl. on Computing"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-49051-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T08:12:26Z","timestamp":1559722346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49051-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657170","9783540490517"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49051-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}