{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:12:00Z","timestamp":1725459120045},"publisher-location":"Berlin\/Heidelberg","reference-count":36,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055422X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0038676","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T09:11:55Z","timestamp":1138180315000},"page":"359-373","source":"Crossref","is-referenced-by-count":3,"title":["Loop storage optimization for dataflow machines"],"prefix":"10.1007","author":[{"given":"G.","family":"Gao","sequence":"first","affiliation":[]},{"given":"Q.","family":"Ning","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1146\/annurev.cs.01.060186.001301","volume":"1","author":"Arvind","year":"1986","unstructured":"Arvind and D. E. Culler. Dataflow architectures. Annual Reviews in Computer Science, 1:225\u2013253, 1986.","journal-title":"Annual Reviews in Computer Science"},{"key":"23_CR2","volume-title":"Technical report","author":"Arvind","year":"1983","unstructured":"Arvind and et al. The tagged token dataflow architecture (preliminary version). Technical report, Laboratory for Computer Science, MIT, Cambridge, MA., August 1983."},{"issue":"2","key":"23_CR3","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\u201349, February 1982.","journal-title":"IEEE Computer"},{"key":"23_CR4","volume-title":"An Asynchronous Programming Language and Computing Machine","author":"Arvind","year":"1978","unstructured":"Arvind, K. P. Gostelow, and W. Plouffe. An Asynchronous Programming Language and Computing Machine. Department of Information and Computer Science, University of California, Irvine, December 1978."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Arvind and R. A. Iannucci. A critique of multiprocessing von Neumann style. In Proceedings of the Tenth Annual International Symposium on Computer Architecture, pages 426\u2013436, 1983.","DOI":"10.1145\/1067651.801684"},{"key":"23_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6894-6","volume-title":"Dependence Analysis for Supercomputing","author":"U. Banerjee","year":"1988","unstructured":"U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Academic Publishers, Boston, MA, 1988."},{"issue":"1","key":"23_CR7","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 Transactions on Programming Languages and Systems, 11(1):57\u201366, January 1989.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"23_CR8","unstructured":"V. Chvatal. Linear Porgramming. W.H. Freeman and Company., 1983."},{"key":"23_CR9","unstructured":"D. E. Culler. Managing parallelism and resources in scientific dataflow programs, Ph.D thesis. Technical Report TR-446, Laboratory for Computer Science, MIT, 1989."},{"key":"23_CR10","unstructured":"J. B. Dennis. First version of a data flow procedure language. Technical Report MIT\/LCS\/TM-61, Laboratory for Computer Science, MIT, 1975."},{"key":"23_CR11","unstructured":"J. B. Dennis. Data flow for supercomputers. In Proceedings of the 1984 CompCon, March 1984."},{"key":"23_CR12","unstructured":"J. B. Dennis. Evolution of the static dataflow architecture. In Advanced Topics in Dataflow Computing. Prentice-Hall, 1991."},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1109\/SUPERC.1988.44674","volume-title":"Proceedings of the Supercomputing '88 Conference","author":"J. B. Dennis","year":"1988","unstructured":"J. B. Dennis and G. R. Gao. An efficient pipelined dataflow processor architecture. In Proceedings of the Supercomputing '88 Conference, pages 368\u2013373, Florida, November 1988. IEEE Computer Society and ACM SIGARCH."},{"issue":"7","key":"23_CR14","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TC.1984.5009332","volume":"C-33","author":"J. B. Dennis","year":"1984","unstructured":"J. B. Dennis, G. R. Gao, and K. W. Todd. Modeling the weather with a data flow super-computer. IEEE Transactions on Computers, C-33(7):592\u2013603, 1984.","journal-title":"IEEE Transactions on Computers"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"J. B. Dennis and D. P. Misunas. A preliminary architecture for a basic data-flow processor. In The Second Annual Symposium on Computer Architecture, pages 126\u2013132, January 1975.","DOI":"10.1145\/642089.642111"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"J. Edmonds and R.M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM, 1972.","DOI":"10.1145\/321694.321699"},{"key":"23_CR17","volume-title":"Flow in Networks","author":"L. R. Ford","year":"1962","unstructured":"L. R. Ford and D. R. Fulkerson. Flow in Networks. Princeton University Press, Princeton, NJ, 1962."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"D.R. Fulkerson. An out-of-kilter method for minimal cost flow problems. J. SIAM, 1961.","DOI":"10.1137\/0109002"},{"key":"23_CR19","unstructured":"G. R. Gao. A pipelined code mapping scheme for static dataflow computers. Technical Report TR-371, Laboratory for Computer Science, MIT, 1986."},{"key":"23_CR20","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, December 1990."},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"G. R. Gao, H. H. J. Hum, and Y. B. Wong. An efficient scheme for fine-grain software pipelining. In Proceedings of the CONPAR '90-VAPP IV Conference, Zurich, Switzerland, September 1990.","DOI":"10.1007\/3-540-53065-7_147"},{"key":"23_CR22","unstructured":"G.R. Gao. A flexible architecture model for hybrid data-flow and control-flow evaluation. In Advanced Topics in Dataflow Computing. Prentice-Hall, 1991."},{"key":"23_CR23","unstructured":"G.R. Gao, Y.B. Wong, and Q. Ning. A petri net model for loop scheduling. In the Proceedings of ACM SIGPLAN'91, Toronto, Canada. June 1991."},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"P. B. Gibbons and S. S. Muchnik. Efficient instruction scheduling for a pipelined architecture. In Proceedings of the ACM Symposium on Compiler Construction, pages 11\u201316, Palo Alto, CA, June 1986.","DOI":"10.1145\/12276.13312"},{"key":"23_CR25","unstructured":"T.R. Gross. Code Optimization of Pipeline Constraints. PhD thesis, Computing System Lab., Stanford University, 1983."},{"issue":"3","key":"23_CR26","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/2166.357217","volume":"5","author":"J. Hennessy","year":"1983","unstructured":"J. Hennessy and T. Gross. Postpass code optimization of pipelined constraints. ACM Transactions on Programming Languages and Systems, 5(3):422\u2013448, July 1983.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 1984.","DOI":"10.1007\/BF02579150"},{"key":"23_CR28","first-page":"613","volume":"48","author":"R. M. Keller","year":"1979","unstructured":"R. M. Keller, G. Lindstrom, and S. Patil. A loosely-coupled applicative multi-processing system. In AFIPS Conference Proceedings, vol. 48, pages 613\u2013622, 1979.","journal-title":"AFIPS Conference Proceedings"},{"key":"23_CR29","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\u2013194, 1979.","journal-title":"Soviet Math. Doklady"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"J. R. Larus and P. N. Hilfinger. Register allocation in the SPUR Lisp compiler. In Proceedings of the ACM Symposium on Compiler Construction, pages 255\u2013263, Palo Alto, CA, June 1986.","DOI":"10.1145\/12276.13337"},{"key":"23_CR31","unstructured":"E. Lawler. Combinatorial Optimization Networks and Matroids. Holt, Rinehart, and Winston, 1976."},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"G. M. Papadopoulos and D. E. Culler. Monsoon: An explicit token-store architecture. In Proceedings of the Seventeenth Annual International Symposium of Computer Architecture, Seattle, WA, pages 82\u201391, 1990.","DOI":"10.1145\/325164.325117"},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"C. V. Ramamoorthy and G. S. Ho. Performance evaluation of asynchronous concurrent systems using Petri Nets. IEEE Transactions on Computers, pages 440\u2013448, September 1980.","DOI":"10.1109\/TSE.1980.230492"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"S Sakai and et al. An architecture of a dataflow single chip processor. In Proceedings of the 16th International Symposium on Computer Architecture, pages 46\u201353, Israel, 1989.","DOI":"10.1109\/ISCA.1989.714523"},{"issue":"2","key":"23_CR35","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/MC.1982.1653941","volume":"15","author":"I. Watson","year":"1982","unstructured":"I. Watson and J. Gurd. A practical data flow computer. IEEE Computer, 15(2):51\u201357, February 1982.","journal-title":"IEEE Computer"},{"key":"23_CR36","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0010-4655(85)90146-8","volume":"37","author":"T. Yuba","year":"1985","unstructured":"T. Yuba and et al. Sigma-1: A dataflow computer for scientific computations. Computer Physics Communications, 37:141\u2013148, 1985.","journal-title":"Computer Physics Communications"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0038676.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:23:38Z","timestamp":1607534618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0038676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055422X"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/bfb0038676","relation":{},"subject":[]}}