{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T11:42:20Z","timestamp":1709379740387},"reference-count":31,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1016\/0167-8191(95)00072-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:05:28Z","timestamp":1027627528000},"page":"555-593","source":"Crossref","is-referenced-by-count":2,"title":["Partitioning and scheduling to counteract overhead"],"prefix":"10.1016","volume":"22","author":[{"given":"Roni","family":"Khardon","sequence":"first","affiliation":[]},{"given":"Shlomit S.","family":"Pinter","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(95)00072-0_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(90)90188-N","article-title":"Communication complexity of PRAMs","volume":"71","author":"Aggarwal","year":"1991","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0167-8191(95)00072-0_BIB2","series-title":"2nd Annual ACM Symp. on Parallel Algorithms and Architectures","first-page":"66","article-title":"Low overhead parallel schedules for task graphs","author":"Anderson","year":"1990"},{"issue":"9","key":"10.1016\/0167-8191(95)00072-0_BIB3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0743-7315(90)90116-7","article-title":"Scheduling with sufficient loosely coupled processors","volume":"1","author":"Anger","year":"1990","journal-title":"J. Parallel and Distributed Computing"},{"issue":"2","key":"10.1016\/0167-8191(95)00072-0_BIB4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/71.80141","article-title":"Iterative instructions in the Manchester dataflow computer","volume":"1","author":"B\u00f6hm","year":"1990","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"10.1016\/0167-8191(95)00072-0_BIB5","author":"Coffman","year":"1976"},{"key":"10.1016\/0167-8191(95)00072-0_BIB6","series-title":"2nd Annual Symp. on Computer Architecture","first-page":"126","article-title":"A preliminary architecture for a basic data flow processor","author":"Dennis","year":"1974"},{"key":"10.1016\/0167-8191(95)00072-0_BIB7","author":"Garey","year":"1979"},{"issue":"4","key":"10.1016\/0167-8191(95)00072-0_BIB8","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0743-7315(85)90018-8","article-title":"Performance evaluation of a simulated data flow computer with low resolution actors","volume":"2","author":"Gaudiot","year":"1985","journal-title":"J. Parallel and Distributed Computing"},{"key":"10.1016\/0167-8191(95)00072-0_BIB9","article-title":"Book review: Flow algorithms by E.A. Dinic and A.V. Karzanov","author":"Goldberg","year":"1990","journal-title":"Tech. Rep. STAN-CS-90-1313"},{"issue":"1","key":"10.1016\/0167-8191(95)00072-0_BIB10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/MC.1982.1653824","article-title":"Networks and algorithms for very-large-scale parallel computation","volume":"15","author":"Gottlieb","year":"1982","journal-title":"Computer"},{"issue":"2","key":"10.1016\/0167-8191(95)00072-0_BIB11","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"Siam J. of Applied Math."},{"issue":"9","key":"10.1016\/0167-8191(95)00072-0_BIB12","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1109\/TC.1987.5009533","article-title":"The effect of operation scheduling on the performance of a data flow computer","volume":"36","author":"Granski","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(95)00072-0_BIB13","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Operations Res."},{"key":"10.1016\/0167-8191(95)00072-0_BIB14","series-title":"Int. Symp. on Computer Architecture","first-page":"131","article-title":"Towards a data flow Von Neumann hybrid architecture","author":"Iannucci","year":"1988"},{"key":"10.1016\/0167-8191(95)00072-0_BIB15","series-title":"Int. Conf. on Parallel Processing","first-page":"1672","article-title":"Choosing the right grains for data flow machines","author":"Khardon","year":"1991"},{"key":"10.1016\/0167-8191(95)00072-0_BIB16","series-title":"Int. Symp. on Computer Architecture","first-page":"240","article-title":"The architecture of a linda coprocessor","author":"Krishnaswamy","year":"1988"},{"key":"10.1016\/0167-8191(95)00072-0_BIB17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/52.1991","article-title":"Grain size determination for parallel processing","author":"Kruatrachue","year":"1988","journal-title":"IEEE Software"},{"key":"10.1016\/0167-8191(95)00072-0_BIB18","author":"Papadimitriou","year":"1982"},{"issue":"2","key":"10.1016\/0167-8191(95)00072-0_BIB19","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","article-title":"Towards an architecture independent analysis of parallel algorithms","volume":"19","author":"Papadimitriou","year":"1990","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0167-8191(95)00072-0_BIB20","author":"Papadopoulos","year":"1991"},{"key":"10.1016\/0167-8191(95)00072-0_BIB21","series-title":"Conf. on Functional Programming Languages and Computer Architecture","first-page":"159","article-title":"Generation and quantitative evaluation of dataflow clusters","author":"Roh","year":"1993"},{"key":"10.1016\/0167-8191(95)00072-0_BIB22","series-title":"Advanced topics in data flow computing","first-page":"225","article-title":"Pipeline optimization of a data flow machine","author":"Sakai","year":"1991"},{"key":"10.1016\/0167-8191(95)00072-0_BIB23","series-title":"Int. Symp. on Computer Architecture","first-page":"46","article-title":"An architecture of a dataflow single chip processor","author":"Sakai","year":"1989"},{"key":"10.1016\/0167-8191(95)00072-0_BIB24","author":"Sarkar","year":"1989"},{"key":"10.1016\/0167-8191(95)00072-0_BIB25","author":"Sharp","year":"1985"},{"issue":"9","key":"10.1016\/0167-8191(95)00072-0_BIB26","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/MC.1986.1663181","article-title":"An architectural comparison of dataflow systems","volume":"19","author":"Srini","year":"1986","journal-title":"Computer"},{"key":"10.1016\/0167-8191(95)00072-0_BIB27","series-title":"Conf. on Functional Programming Languages and Computer Architecture","first-page":"73","article-title":"Multi thread code generation for dataflow architectures from non-strict programs","author":"Traub","year":"1991"},{"key":"10.1016\/0167-8191(95)00072-0_BIB28","series-title":"Conf. on Lisp and Functional Programming","first-page":"324","article-title":"Global analysis for partitioning non-strict programs into sequential threads","author":"Traub","year":"1992"},{"issue":"3","key":"10.1016\/0167-8191(95)00072-0_BIB29","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-complete scheduling problems","volume":"10","author":"Ullman","year":"1975","journal-title":"J. Computer and System Sciences"},{"issue":"4","key":"10.1016\/0167-8191(95)00072-0_BIB30","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/27633.28055","article-title":"Dataflow machine architecture","volume":"18","author":"Veen","year":"1986","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/0167-8191(95)00072-0_BIB31","article-title":"Workload scheduling: A new technique for scheduling task graphs with communication costs in parallel systems","author":"Zhu","year":"1990"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000720?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000720?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T05:50:02Z","timestamp":1555480202000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819195000720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["0167819195000720"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(95)00072-0","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}