{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T17:09:34Z","timestamp":1742404174886},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617563"},{"type":"electronic","value":"9783540706540"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61756-6_88","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:20:19Z","timestamp":1330294819000},"page":"228-242","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling expression DAGs for minimal register need"],"prefix":"10.1007","author":[{"given":"Christoph W.","family":"Ke\u00dfler","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/321958.321970","volume":"23","author":"A.V. Aho","year":"1976","unstructured":"A.V. Aho and S.C. Johnson. Optimal Code Generation for Expression Trees. Journal of the ACM, 23(3):488\u2013501, July 1976.","journal-title":"Journal of the ACM"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"D. Bernstein, M.C. Golumbic, Y. Mansour, R.Y. Pinter, D.Q. Goldin, H. Krawczyk, and I. Nahshon. Spill code minimization techniques for optimizing compilers. In Proc. ACM SIGPLAN Programming Language Design and Implementation, pages 258\u2013263, 1989.","DOI":"10.1145\/74818.74841"},{"issue":"1","key":"16_CR3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/59287.59291","volume":"11","author":"D. Bernstein","year":"1989","unstructured":"D. Bernstein and I. Gertner. Scheduling expressions on a pipelined processor with a maximal delay on one cycle. ACM Trans. on Progr. Lang. and Systems, 11(1):57\u201367, Jan. 1989.","journal-title":"ACM Trans. on Progr. Lang. and Systems"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1137\/0218074","volume":"18","author":"D. Bernstein","year":"1989","unstructured":"D. Bernstein, J.M. Jaffe, and M. Rodeh. Scheduling arithmetic and load operations in parallel with no spilling. SIAM J. Comput., 18:1098\u20131127, 1989.","journal-title":"SIAM J. Comput."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"D.G. Bradlee, S.J. Eggers, and R.R. Henry. Integrating Register Allocation and Instruction Scheduling for RISCs. In Proc. 4th Int. Conf. on Architectural Support for Programming Languages and Operating Systems, pages 122\u2013131, Apr. 1991.","DOI":"10.1145\/106972.106986"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Preston Briggs, Keith Cooper, Ken Kennedy, and Linda Torczon. Coloring heuristics for register allocation. In Proc. ACM SIGPLAN Programming Language Design and Implementation, 1989.","DOI":"10.1145\/73141.74843"},{"issue":"6","key":"16_CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/872726.806984","volume":"17","author":"G.J. Chaitin","year":"1982","unstructured":"G.J. Chaitin. Register allocation & spilling via graph coloring. ACM SIGPLAN Notices, 17(6):201\u2013207, 1982.","journal-title":"ACM SIGPLAN Notices"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","volume":"6","author":"G.J. Chaitin","year":"1981","unstructured":"G.J. Chaitin, M.A. Auslander, A.K. Chandra, J. Cocke, M.E. Hopkins, and P.W. Markstein. Register allocation via coloring. Computer Languages, 6:47\u201357, 1981.","journal-title":"Computer Languages"},{"issue":"6","key":"16_CR9","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1145\/502949.502896","volume":"19","author":"F. C. Chow","year":"1984","unstructured":"Fred C. Chow and John L. Hennessy. Register allocation by priority-based coloring. ACM SIGPLAN Notices, 19(6):222\u2013232, 1984.","journal-title":"ACM SIGPLAN Notices"},{"issue":"3","key":"16_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/spe.4380090307","volume":"9","author":"J.J. Dongarra","year":"1979","unstructured":"J.J. Dongarra and A.R. Jinds. Unrolling Loops in Fortran. Software \u2014 Practice and Experience, 9(3):219\u2013226, 1979.","journal-title":"Software \u2014 Practice and Experience"},{"key":"16_CR11","first-page":"503","volume-title":"Report No. UMA-DAC-95\/09","author":"C. Eisenbeis","year":"1995","unstructured":"C. Eisenbeis, S. Lelait, and B. Marmol. The meeting graph: a new model for loop cyclic register allocation. In Proc. 5th Workshop on Compilers for Parallel Computers, pages 503\u2013516. Dept. of Computer Architecture, University of Malaga, Spain. Report No. UMA-DAC-95\/09, June 28\u201330 1995."},{"issue":"7","key":"16_CR12","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TC.1981.1675827","volume":"C-30","author":"J. A. Fisher","year":"1981","unstructured":"Joseph A. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Transactions on Computers, C-30(7):478\u2013490, July 1981.","journal-title":"IEEE Transactions on Computers"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"R.A. Freiburghouse. Register allocation via usage counts. Comm. ACM, 17(11), 1974.","DOI":"10.1145\/361179.361201"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"P.B. Gibbons and S.S. Muchnick. Efficient instruction scheduling for a pipelined architecture. In Proc. SIGPLAN Symp. on Compiler Construction, pages 11\u201316, July 1986.","DOI":"10.1145\/12276.13312"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"J.R. Goodman and W. Hsu. Code scheduling and register allocation in large basic blocks. In Proc. Int. Conf. on Supercomputing, pages 442\u2013452, July 1988.","DOI":"10.1145\/55364.55407"},{"issue":"3","key":"16_CR16","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/2166.357217","volume":"5","author":"J. Hennessy","year":"1983","unstructured":"John Hennessy and Thomas Gross. Postpass Code Optimization of Pipeline Constraints. ACM Transactions on Programming Languages and Systems, 5(3):422\u2013448, July 1983.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"J\u00f6rg Keller, Wolfgang J. Paul, and Dieter Scheerer. Realization of PRAMs: Processor Design. In Proc. WDAG94, 8th Int. Workshop on Distributed Algorithms, Springer Lecture Notes in Computer Science vol. 857, pages 17\u201327, 1994.","DOI":"10.1007\/BFb0020421"},{"key":"16_CR18","volume-title":"Diploma thesis","author":"C.W. Ke\u00dfler","year":"1990","unstructured":"C.W. Ke\u00dfler. Code-Optimierung quasiskalarer vektorieller Grundbl\u00f6cke. Diploma thesis, University of Saarbr\u00fccken (Germany), 1990."},{"key":"16_CR19","first-page":"195","volume":"528","author":"C.W. Ke\u00dfler","year":"1991","unstructured":"C.W. Ke\u00dfler, W.J. Paul, and T. Rauber. A Randomized Heuristic Approach to Register Allocation. In Proc. 3rd Symp. on Programming Language Implementation and Logic Programming, pages 195\u2013206. Springer LNCS vol. 528, Aug. 1991.","journal-title":"Springer LNCS"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"C.W. Ke\u00dfler, W.J. Paul, and T. Rauber. Scheduling Vector Straight Line Code on Vector Processors. In R. Giegerich and S.L. Graham, editors, Code Generation \u2014 Concepts, Tools, Techniques, pages 77\u201391. Springer Worksh. in Computing Series, 1992.","DOI":"10.1007\/978-1-4471-3501-2_5"},{"issue":"2","key":"16_CR21","first-page":"113","volume":"21","author":"C.W. Ke\u00dfler","year":"1996","unstructured":"C.W. Ke\u00dfler and T. Rauber. Generating optimal contiguous evaluations for expression DAGs. Computer Languages, 21(2):113\u2013127, 1996.","journal-title":"Computer Languages"},{"key":"16_CR22","first-page":"134","volume-title":"Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language","author":"C.W. Ke\u00dfler","year":"1995","unstructured":"C.W. Ke\u00dfler and H. Seidl. Integrating Synchronous and Asynchronous Paradigms: The Fork95 Parallel Programming Language. In W. Giloi, S. J\u00e4hnichen, and B. Shriver, editors, Proc. 2nd Int. Conf. on Massively Parallel Programming Models, pages 134\u2013141. Los Alamitos: IEEE Computer Society Press, Oct. 1995. See also: Technical Report 95-05, FB IV Informatik, Universit\u00e4t Trier, http:\/\/www.informatik.uni-trier.de\/ \u223ckessler\/fork95.html."},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Monica Lam. Software pipelining: An effective scheduling technique for VLIW machines. In Proc. SIGPLAN Symp. on Compiler Construction, pages 318\u2013328, July 1988.","DOI":"10.1145\/53990.54022"},{"key":"16_CR24","first-page":"534","volume-title":"Report No. UMA-DAC-95\/09","author":"J. Llosa","year":"1995","unstructured":"J. Llosa, M. Valero, and E. Ayguade. Bidirectional scheduling to minimize register requirements. In Proc. 5th Workshop on Compilers for Parallel Computers, pages 534\u2013554. Dept. of Computer Architecture, University of Malaga, Spain. Report No. UMA-DAC-95\/09, June 28\u201330 1995."},{"key":"16_CR25","volume-title":"Technical Report TR 698","author":"R. Motwani","year":"1995","unstructured":"Rajeev Motwani, Krishna V. Palem, Vivek Sarkar, and Salem Reyen. Combining Register Allocation and Instruction Scheduling (Technical Summary). Technical Report TR 698, Courant Institute of Mathematical Sciences, New York, July 1995."},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Todd A. Proebsting and Charles N. Fischer. Linear-time, optimal code scheduling for delayed-load architectures. In Proc. ACM SIGPLAN Programming Language Design and Implementation, pages 256\u2013267, June 1991.","DOI":"10.1145\/113446.113467"},{"key":"16_CR27","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/0204020","volume":"4","author":"R. Sethi","year":"1975","unstructured":"R. Sethi. Complete register allocation problems. SIAM J. Comput., 4:226\u2013248, 1975.","journal-title":"SIAM J. Comput."},{"key":"16_CR28","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1145\/321607.321620","volume":"17","author":"R. Sethi","year":"1970","unstructured":"R. Sethi and J.D. Ullman. The generation of optimal code for arithmetic expressions. Journal of the ACM, 17:715\u2013728, 1970.","journal-title":"Journal of the ACM"},{"key":"16_CR29","volume-title":"Technical Summary","author":"Thinking Machines Corp.","year":"1992","unstructured":"Thinking Machines Corp. Connection Machine Model CM-5. Technical Summary. TMC, Cambridge, MA, Nov. 1992."},{"key":"16_CR30","first-page":"180","volume-title":"A Dynamic-Programming Technique for Compacting Loops","author":"S. R. Vegdahl","year":"1992","unstructured":"Steven R. Vegdahl. A Dynamic-Programming Technique for Compacting Loops. In Proc. 25th Annual IEEE\/ACM Int. Symp. on Microarchitecture, pages 180\u2013188. Los Alamitos: IEEE Computer Society Press, 1992."},{"issue":"1","key":"16_CR31","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0096-0551(95)00001-K","volume":"21","author":"R. Venugopal","year":"1995","unstructured":"R. Venugopal and Y.N. Srikant. Scheduling expression trees with reusable registers on delayed-load architectures. Computer Languages, 21(1):49\u201365, 1995.","journal-title":"Computer Languages"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics, and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61756-6_88.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:10:23Z","timestamp":1605647423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61756-6_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617563","9783540706540"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-61756-6_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}