{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T09:33:28Z","timestamp":1672306408541},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5280,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0304-3975(97)00161-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"137-168","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling inverse trees under the communication model of the LogP-machine"],"prefix":"10.1016","volume":"215","author":[{"given":"Martin","family":"Middendorf","sequence":"first","affiliation":[]},{"given":"Welf","family":"L\u00f6we","sequence":"additional","affiliation":[]},{"given":"Wolf","family":"Zimmermann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00161-8_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0743-7315(90)90116-7","article-title":"Scheduling with sufficient loosely coupled processors","volume":"9","author":"Anger","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0304-3975(97)00161-8_BIB3","series-title":"Proc. Internat. Conf. on Parallel Processing","first-page":"II 191","article-title":"Mapping arbitrary non-uniform task graphs onto arbitrary nonuniform system graphs","author":"Chen","year":"1995"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0377-2217(89)90216-6","article-title":"A polynomial algorithm to optimally schedule tasks over an ideal distributed system under tree-like precedence constraints","volume":"2","author":"Chretienne","year":"1989","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0304-3975(97)00161-8_BIB5","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.39.4.680","article-title":"CPM scheduling with small communication time","volume":"39","author":"Colin","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0304-3975(97)00161-8_BIB6","series-title":"Portability and Performance of Parallel Processing","first-page":"71","article-title":"Fast parallel sorting under LogP: from theory to practice","author":"Culler","year":"1994"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB7","series-title":"4th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPOPP 93)","first-page":"1","article-title":"LogP: towards a realistic model of parallel computation","volume":"7","author":"Culler","year":"1993"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB8","series-title":"Scalable High Performance Conf.","article-title":"SBDS: a task duplication based optimal algorithm","author":"Darbha","year":"1994"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB9","series-title":"Parallel Processing: CONPAR'94-VAPP VI","first-page":"254","article-title":"Parallelization of non-simultaneous iterative methods for systems of linear equations","volume":"vol. 854","author":"Di Martino","year":"1994"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB10","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB11","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1109\/71.242154","article-title":"On the granularity and clustering of directed acyclic task graphs","volume":"4","author":"Gerasoulis","year":"1993","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-6377(94)90024-8","article-title":"Three, four, five, six or the complexity of scheduling with communication delays","volume":"16","author":"Hoogreven","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0304-3975(97)00161-8_BIB13","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1006\/inco.1993.1041","article-title":"Lower bounds and efficient algorithms for multiprocessor scheduling of DAGs with communication delays","volume":"105","author":"Jung","year":"1993","journal-title":"Information and Computation"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB14","first-page":"871","article-title":"Parallel algorithms for shared memory machines","volume":"vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB15","series-title":"5th Annual ACM Symp. on Parallel Algorithms and Architectures","first-page":"142","article-title":"Optimal broadcast and summation in the LogP model","author":"Karp","year":"1993"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB16","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","article-title":"Optimal sequencing of a single machine subject to precedence constraints","volume":"19","author":"Lawler","year":"1973","journal-title":"Management Sci."},{"key":"10.1016\/S0304-3975(97)00161-8_BIB17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1006\/jagm.1996.0007","article-title":"The complexity of scheduling trees with communication delays","volume":"20","author":"Lenstra","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB18","series-title":"Parallel Algorithms\/Architecture Synthesis pAs'95","first-page":"241","article-title":"On finding optimal clusterings in task graphs","author":"L\u00f6we","year":"1995"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB19","series-title":"Proc. 9th ACM Internat. Conf. on Supercomputing,","first-page":"41","article-title":"Upper time bounds for executing PRAM-programs on the LogP-machine","author":"L\u00f6we","year":"1995"},{"issue":"2","key":"10.1016\/S0304-3975(97)00161-8_BIB20","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","article-title":"Towards an architecture-independent analysis of parallel algorithms","volume":"19","author":"Papadimitrou","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00161-8_BIB21","series-title":"Proc. Summer School on Scheduling Theory and its Applications","first-page":"187","article-title":"New complexity results on the UET-UCT scheduling algorithm","author":"Picouleau","year":"1992"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB22","series-title":"Partitioning and Scheduling Parallel Programs for Multiprocessors","author":"Sarkar","year":"1989"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB23","series-title":"Proc. Internat. Conf. on Parallel Processing","first-page":"II 186","article-title":"Path-based task replication for scheduling with communication costs","author":"Siddhiwala","year":"1995"},{"issue":"9","key":"10.1016\/S0304-3975(97)00161-8_BIB24","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1109\/71.308533","article-title":"DSC: Scheduling parallel tasks on an unbounded number of processors","volume":"5","author":"Yang","year":"1994","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB25","series-title":"Parallel Processing: CONPAR 94 \u2014 VAPP VI","first-page":"277","article-title":"An approach to machine-independent parallel programming","volume":"vol. 854","author":"Zimmermann","year":"1994"},{"key":"10.1016\/S0304-3975(97)00161-8_BIB26","series-title":"Parameter Identification and Inverse Problems in Hydrology, Geology and Ecology","first-page":"283","article-title":"On the design and implementation of parallel algorithms for solving inverse problems","author":"Zimmermann","year":"1996"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001618?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001618?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:51:08Z","timestamp":1555390268000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0304397597001618"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00161-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}