{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T20:40:11Z","timestamp":1683060011558},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1007\/bf01379405","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T00:14:37Z","timestamp":1112400877000},"page":"421-448","source":"Crossref","is-referenced-by-count":1,"title":["Optimal loop storage allocation for argument-fetching dataflow machines"],"prefix":"10.1007","volume":"21","author":[{"given":"Qi","family":"Ning","sequence":"first","affiliation":[]},{"given":"Guang R.","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"A. V. Aho, R. Sethi, and J. D. Ullman,Compilers?Principles, Techniques and Tools, Addison-Wesley Publishing Co. (1986)."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"G. J. Chaitin, Register allocation and spilling via graph coloring,ACM SIGPLAN Symp. on Compiler Construction, pp. 98?105 (1982).","DOI":"10.1145\/800230.806984"},{"key":"CR3","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. Auslander, A. Chandra, J. Cocke, M. Hopkins, and P. Markstein, Register allocation via coloring,Computer Languages,6:47?57 (January 1981).","journal-title":"Computer Languages"},{"key":"CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BFb0038676","volume-title":"Languages and Compilers for Parallel Computing","author":"G. R. Gao","year":"1992","unstructured":"G. R. Gao and Qi Ning, Loop storage optimization for dataflow machines, Uptal Banerjee, David Gelernter, Alexandru Nicolau, and David Padua (eds.),Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science 589,Proc. of the Fourth Int'l. Workshop on Languages and Compilers for Parallel Computing, Springer-Verlag, Santa Clara, California, pp. 359?373 (1992)."},{"key":"CR5","series-title":"Technical Memo MIT\/LCS\/TM-61","volume-title":"First version of a data flow procedure language","author":"J. B. Dennis","year":"1975","unstructured":"J. B. Dennis, First version of a data flow procedure language, Technical Memo MIT\/LCS\/TM-61, MIT Laboratory for Computer Science, Cambridge, Massachusetts (1975)."},{"key":"CR6","unstructured":"J. B. Dennis, Data flow for supercomputers,Proc. of the CompCon (March 1984)."},{"key":"CR7","volume-title":"Advanced Topics in Data-Flow Computing","author":"Jack B. Dennis","year":"1991","unstructured":"Jack B. Dennis, The evolution of ?static? data-flow architecture, Jean-Luc Gaudiot and Lubomir Bic, (eds.),Advanced Topics in Data-Flow Computing, Chapter 2, Prentice-Hall, Englewood Cliffs, New Jersey (1991)."},{"key":"CR8","series-title":"Proc. of Supercomputing '88","first-page":"368","volume-title":"An efficient pipelined dataflow processor architecture","author":"J. B. Dennis","year":"1988","unstructured":"J. B. Dennis and G. R. Gao, An efficient pipelined dataflow processor architecture,Proc. of Supercomputing '88, IEEE Computer Society and ACM SIGARCH, Orlando, Florida, pp. 368?373 (November 1988)."},{"issue":"2","key":"CR9","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MC.1982.1653940","volume":"15","author":"Arvind","year":"1982","unstructured":"Arvind and K. P. Gostelow, The U-Interpreter,IEEE Computer,15(2):42?49 (February 1982).","journal-title":"IEEE Computer"},{"key":"CR10","unstructured":"G. R. Gao, A flexible architecture model for hybrid dataflow and control-flow evaluation,Proc. of the Int'l. Workshop: Data-Flow, A St\u00e1tus Report, Eilat, Israel (1989)."},{"key":"CR11","unstructured":"G. R. Gao, A pipelined code mapping scheme for static dataflow computers, Technical Report TR-371, MIT Laboratory for Computer Science (1986)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0743-7315(89)90041-5","volume":"6","author":"G. R. Gao","year":"1989","unstructured":"G. R. Gao, Algorithmic aspects of balancing techniques for pipelined data flow code generation,Journal of Parallel and Distributed Computing,6:39?61 (1989).","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"CR13","volume-title":"A Code Mapping Scheme for Dataflow Software Pipelining","author":"G. R. Gao","year":"1990","unstructured":"G. R. Gao,A Code Mapping Scheme for Dataflow Software Pipelining, Kluwer Academic Publishers, Boston, Massachusetts (December 1990)."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"G. R. Gao, H. H. J. Hum, and Y. B. Wong, An efficient scheme for fine-grain software pipelining,Proc. of the CONPAR '90-VAPP IV Conf., Zurich, Switzerland, pp. 709?720 (September 1990).","DOI":"10.1007\/3-540-53065-7_147"},{"key":"CR15","unstructured":"G. R. Gao, H. H. J. Hum, and Y. B. Wong, Limited balancing?an efficient method for dataflow software pipelining,Proc. of the Int'l. Symp. on Parallel and Distributed Comput., and Syst., New York, New York (October 1990)."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"G. R. Gao, Y. B. Wong, and Qi Ning, A Petri-Net model for fine-grain loop scheduling,Proc. of the SIGPLAN '91 Conf. on Programming Language Design and Implementation, ACM SIGPLAN. Toronto, Ontario, pp. 204?218 (June 1991).","DOI":"10.1145\/113445.113463"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Q. Ning and G. R. Gao, A novel framework of register allocation for software pipelining,Proc. of 20th Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL '93), Charleston, South Carolina, pp. 29?42 (January 1993).","DOI":"10.1145\/158511.158519"},{"key":"CR18","volume-title":"Register Allocation for Optimal Loop Scheduling","author":"Qi Ning","year":"1993","unstructured":"Qi Ning, Register Allocation for Optimal Loop Scheduling, PhD thesis, School of Computer Science, McGill University, Montreal, Canada (May 1993)."},{"issue":"11","key":"CR19","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MC.1980.1653418","volume":"13","author":"J. B. Dennis","year":"1980","unstructured":"J. B. Dennis, Data flow supercomputers,IEEE Computer,13(11):48?56 (November 1980).","journal-title":"IEEE Computer"},{"key":"CR20","series-title":"Conf. Proc., Int'l. Conf. on Supercomputing","first-page":"369","volume-title":"Towards efficient fine-grain software pipelining","author":"G. R. Gao","year":"1990","unstructured":"G. R. Gao, H. H. J. Hum, and Y. B. Wong, Towards efficient fine-grain software pipelining,Conf. Proc., Int'l. Conf. on Supercomputing, ACM, Amsterdam, The Netherlands, pp. 369?379 (June 1990)."},{"key":"CR21","series-title":"Lecture Notes in Computer Science","first-page":"505","volume-title":"Proc. of PARLE '91-Parallel Architectures and Languages Europe","author":"G. R. Gao","year":"1991","unstructured":"G. R. Gao, H. H. J. Hum, and J. M. Monti, Towards an efficient hybrid dataflow architecture model, E. H. L. Aarts, J. van Leeuwen, and M. Rem, (eds.),Proc. of PARLE '91-Parallel Architectures and Languages Europe, Eindhoven, The Netherlands, Springer-Verlag, Lecture Notes in Computer Science, pp. 505?506 (June 1991)."},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"G. Gao, R. Govindarajan, and Prakash Panangaden, Well-behaved dataflow for dsp computation,ICASSP-92, Int'l. Conf. on Acoustics, Speech, and Signal Processing (March 1992).","DOI":"10.1109\/ICASSP.1992.226558"},{"key":"CR23","first-page":"191","volume":"20","author":"L. G. Khachian","year":"1979","unstructured":"L. G. Khachian, A polynomial algorithm in linear programming,Soviet Math. Doklady,20:191?194 (1979).","journal-title":"Soviet Math. Doklady"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, A new polynomial-time algorithm for linear programming,Combinatorica,4:373?395 (1984).","journal-title":"Combinatorica"},{"key":"CR25","unstructured":"A. Schrijver,Theory of Linear and Integer Programming, John Wiley and Sons (1986)."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1090\/S0002-9939-1965-0180568-2","volume":"16","author":"P. Camion","year":"1965","unstructured":"P. Camion, Characterizations of totally unimodular matrices,Proc. Amer. Math. Soc.,16:1068?1073 (1965).","journal-title":"Proc. Amer. Math. Soc."},{"key":"CR27","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Eugene L. Lawler","year":"1976","unstructured":"Eugene L. Lawler,Combinatorial Optimization: Networks and Matroids, Saunders College Publishing, Ft Worth, Texas (1976)."},{"key":"CR28","unstructured":"D. E. Culler, Managing parallelism and resources in scientific dataflow programs, PhD thesis, Technical Report TR-446, MIT Laboratory for Computer Science (1989)."},{"key":"CR29","series-title":"Technical Report TR 90-1076","volume-title":"Static scheduling for dynamic dataflow machines","author":"Micah Beck","year":"1990","unstructured":"Micah Beck, Keshav K. Pingali, and Alex Nicolau, Static scheduling for dynamic dataflow machines, Technical Report TR 90-1076, Department of Computer Science, Cornell University, Ithaca, New York (January 1990)."},{"key":"CR30","unstructured":"A. Aiken, Compaction-based parallelization, PhD thesis, Technical Report 88?922, Cornell University (1988)."},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"A. Aiken and A. Nicolau, Optimal loop parallelization,Proc. of the ACM SIGPLAN Conf. on Programming Languages Design and Implementation (June 1988).","DOI":"10.1145\/53990.54021"},{"key":"CR32","unstructured":"A. Aiken and A. Nicolau, A realistic resource-constrained software pipelining algorithm,Proc. of the Third Workshop on Programming Languages and Compilers for Parallel Computing, Irvine, California (August 1990)."},{"key":"CR33","doi-asserted-by":"crossref","unstructured":"K. Ebcio?lu, A compilation technique for software pipelining of loops with conditional jumps,Proc. of the 20th Ann. Workshop on Microprogramming (December 1987).","DOI":"10.1145\/255305.255317"},{"key":"CR34","doi-asserted-by":"crossref","unstructured":"K. Ebcio?lu and A. Nicolau, A global resource-constrained parallelization technique,Proc. of the ACM SIGARCH Int'l. Conf. on Supercomputing (June 1989).","DOI":"10.1145\/318789.318807"},{"key":"CR35","doi-asserted-by":"crossref","unstructured":"Monica Lam, Software pipelining: An effective scheduling technique for VLIW machines,Proc. of the ACM SIGPLAN Conf. on Programming Languages Design and Implementation, Atlanta, Georgia, pp. 318?328 (June 1988).","DOI":"10.1145\/53990.54022"},{"key":"CR36","doi-asserted-by":"crossref","unstructured":"J. R. Larus and P. N. Hilfinger, Register allocation in the SPUR Lisp compiler,Proc. of the ACM Symp. on Compiler Construction, Palo Alto, California, pp. 255?263 (June 1986).","DOI":"10.1145\/12276.13337"},{"key":"CR37","unstructured":"T. R. Gross, Code Optimization of Pipeline Constraints, PhD thesis, Computing System Lab., Stanford University (1983)."},{"issue":"1","key":"CR38","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 of one cycle,ACM Trans. on Programming Languages and Syst.,11(1):57?66 (January 1989).","journal-title":"ACM Trans. on Programming Languages and Syst."},{"key":"CR39","doi-asserted-by":"crossref","unstructured":"D. G. Bradlee, S. J. Eggers, and R. R. Henry, Integrating register allocation and instruction scheduling for RISCs,Int'l. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS IV), pp. 122?131 (April 1991).","DOI":"10.1145\/106974.106986"},{"key":"CR40","doi-asserted-by":"crossref","unstructured":"J. R. Goodman and W. Hsu, Code scheduling and register allocation in large basic blocks,Int'l. Conf. on Supercomputing, pp. 442?452 (July 1988).","DOI":"10.1145\/55364.55407"},{"key":"CR41","doi-asserted-by":"crossref","unstructured":"R. A. Huff, Lifetime-sensitive modulo scheduling,Proc. of ACM SIGPLAN '93 Conf. on Programming Language Design and Implementation, Albuquerque, New Mexico, pp. 258?267 (June 1993).","DOI":"10.1145\/155090.155115"},{"key":"CR42","doi-asserted-by":"crossref","unstructured":"S. S. Pinter, Register allocation with instruction scheduling,Proc. of ACM SIGPLAN '93 Conf. on Programming Language Design and Implementation, Albuquerque, New Mexico, pp. 284?257 (June 1993).","DOI":"10.1145\/155090.155114"},{"key":"CR43","doi-asserted-by":"crossref","unstructured":"C. E. Leiserson, Optimizing synchronous systems, Technical Memo 215, MIT Laboratory for Computer Science (1982).","DOI":"10.1109\/SFCS.1981.34"},{"key":"CR44","volume-title":"Area-Efficient VLSI Computation","author":"C. E. Leiserson","year":"1983","unstructured":"C. E. Leiserson,Area-Efficient VLSI Computation, MIT Press, Cambridge, Massachusetts (1983)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01379405.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01379405\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01379405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T20:05:21Z","timestamp":1683057921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01379405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":44,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["BF01379405"],"URL":"https:\/\/doi.org\/10.1007\/bf01379405","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}