{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:11:46Z","timestamp":1725459106010},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055422X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0038677","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T14:11:55Z","timestamp":1138198315000},"page":"374-388","source":"Crossref","is-referenced-by-count":0,"title":["Optimal partitioning of programs for data flow machines"],"prefix":"10.1007","author":[{"given":"R.","family":"Hardon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Pinter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","first-page":"1","volume":"number 317","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal, A.K.Chandra, and M.Snir. Communication complexity of PRAMs. In Proc. of the 15th International Coll. on Automata, Languages and Programming, Springer Verlag Lecture Notes in Computer Science, number 317, pages 1\u201318, July 1988.","journal-title":"Proc. of the 15th International Coll. on Automata, Languages and Programming, Springer Verlag Lecture Notes in Computer Science"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"A.P. B\u00f6hm and J.R.Gurd. Iterative instructions in the Manchester dataflow computer. IEEE Trans. on Parallel and Distributed Systems, 1(2), April 1990.","DOI":"10.1109\/71.80141"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"J.B. Dennis and D.P.Misunas. A preliminary architecture for a basic data flow processor. In 2nd annual Symposium on Computer Architecture, pages 126\u2013132, 1974.","DOI":"10.1145\/641675.642111"},{"key":"24_CR4","unstructured":"M.R. Garey and D.S.Johnson. Computers and Intractability: a Guide to the Theory of NP-completeness. W.H.freeman and company, 1979."},{"issue":"4","key":"24_CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0743-7315(85)90018-8","volume":"2","author":"J.L. Gaudiot","year":"1985","unstructured":"J.L. Gaudiot and M.D.Ercegovac. Performance evaluation of a simulated data flow computer with low resolution actors. Journal of Parallel and Distributed Computing, 2(4):321\u2013351, 1985.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"24_CR6","unstructured":"A.V. Goldberg and D.Gusfield. Book review: Flow algorithms by E.A.Dinic and A.V.Karzanov. Tech.Rep.STAN-CS-90-1313, June 1990."},{"key":"24_CR7","unstructured":"R. Hardon and S. S. Pinter. Optimal partitioning of programs for data flow machines. Technical Report EE-PUB to appear, Dept. of Electrical Engineering, Technion \u2014 Israel Institute of Technology, 1991."},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"T.C. Hu","year":"1961","unstructured":"T.C. Hu. Parallel sequencing and assembly line problems. Operations Res., 9:841\u2013848, 1961.","journal-title":"Operations Res."},{"issue":"2","key":"24_CR9","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","volume":"19","author":"C.H. Papadimitriou","year":"1990","unstructured":"C.H. Papadimitriou and M.Yannakakis. Towards an architecture independent analysis of parallel algorithms. SIAM J. Computing, 19(2):322\u2013328, April 1990.","journal-title":"SIAM J. Computing"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"S. Sakai, Y. Yamaguchi, k. Hiraki, Y. Kodama, and T. Yuba. An architecture of a dataflow single chip processor. In International Symposium on Computer Architecture, pages 46\u201353, 1989.","DOI":"10.1109\/ISCA.1989.714523"},{"issue":"3","key":"24_CR11","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J.D. Ullman","year":"1975","unstructured":"J.D. Ullman. NP-complete scheduling problems. Journal of Computer and System Sciences, 10(3):384\u2013393, 1975.","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"24_CR12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/27633.28055","volume":"18","author":"A.H. Veen","year":"1986","unstructured":"A.H. Veen. Dataflow machine architecture. ACM Computing Surveys, 18(4):365\u2013396, December 1986.","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/BFb0038677.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:23:39Z","timestamp":1607552619000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/BFb0038677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055422X"],"references-count":12,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/bfb0038677","relation":{},"subject":[]}}