{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:24:14Z","timestamp":1759332254917},"reference-count":16,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":[[2000,7]]},"DOI":"10.1016\/s0167-8191(00)00029-6","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T08:06:40Z","timestamp":1051258000000},"page":"1065-1082","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling outtrees of height one in the LogP model"],"prefix":"10.1016","volume":"26","author":[{"given":"Jacques","family":"Verriet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(00)00029-6_BIB1","doi-asserted-by":"crossref","unstructured":"M. Adler, J.W. Byers, R.M. Karp, Parallel sorting with limited bandwidth, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1995, pp. 129\u2013136","DOI":"10.1145\/215399.215431"},{"key":"10.1016\/S0167-8191(00)00029-6_BIB2","unstructured":"P. Chr\u00e9tienne, C. Picouleau, Scheduling with communication delays: a survey, in: P. Chr\u00e9tienne, E.G. Coffman, Jr., J.K. Lenstra, Z. Liu (Eds.), Scheduling Theory and its Applications, Wiley, Chichester, UK, 1995, pp. 65\u201390 (Chapter 4)"},{"key":"10.1016\/S0167-8191(00)00029-6_BIB3","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0167-8191(00)00029-6_BIB4","doi-asserted-by":"crossref","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: Proceedings of the Fourth ACM-SIGPLAN Symposium on Principles and Practice of Parallel Processing, 1993, pp. 1\u201312","DOI":"10.1145\/155332.155333"},{"issue":"11","key":"10.1016\/S0167-8191(00)00029-6_BIB5","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/240455.240477","article-title":"LogP: a practical model of parallel computation","volume":"39","author":"Culler","year":"1996","journal-title":"Communications of the ACM"},{"issue":"8","key":"10.1016\/S0167-8191(00)00029-6_BIB6","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1109\/71.532111","article-title":"Fast parallel sorting under LogP: experience with the CM-5","volume":"7","author":"Dusseau","year":"1996","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(00)00029-6_BIB7","doi-asserted-by":"crossref","unstructured":"S. Fortune, J. Wyllie, Parallelism in random access machines, in: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978, pp. 114\u2013118","DOI":"10.1145\/800133.804339"},{"key":"10.1016\/S0167-8191(00)00029-6_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-8191(00)00029-6_BIB9","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"10.1016\/S0167-8191(00)00029-6_BIB10","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 Journal on Applied Mathematics"},{"key":"10.1016\/S0167-8191(00)00029-6_BIB11","doi-asserted-by":"crossref","unstructured":"R.M. Karp, A. Sahay, E.E. Santos, K.E. Schauser, Optimal broadcast and summation in the LogP model, in: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, 1993, pp. 142\u2013153","DOI":"10.1145\/165231.165250"},{"key":"10.1016\/S0167-8191(00)00029-6_BIB12","unstructured":"I. Kort, D. Trystram, Some results on scheduling trees of height one under logp, Unpublished manuscript"},{"key":"10.1016\/S0167-8191(00)00029-6_BIB13","doi-asserted-by":"crossref","unstructured":"W. L\u00f6we, W. Zimmermann, Upper time bounds for executing PRAM-programs on the LogP-machine, in: Proceedings of the Ninth ACM International Conference on Supercomputing, 1995, pp. 41\u201350","DOI":"10.1145\/224538.224543"},{"key":"10.1016\/S0167-8191(00)00029-6_BIB14","doi-asserted-by":"crossref","unstructured":"W. L\u00f6we, W. Zimmermann, J. Eisenbiegler, On linear schedules for task graphs for generalized LogP-machines, in: C. Lengauer, M. Griebl, S. Gorlatch (Eds.), Proceedings of the Third Euro-Par Conference, Lecture Notes in Computer Science, vol. 1300, Springer, Berlin, 1997, pp. 895\u2013904","DOI":"10.1007\/BFb0002832"},{"key":"10.1016\/S0167-8191(00)00029-6_BIB15","unstructured":"J. Verriet, Scheduling with communication for multiprocessor computation, Ph.D. Thesis, Utrecht University, Utrecht, the Netherlands, June 1998"},{"key":"10.1016\/S0167-8191(00)00029-6_BIB16","doi-asserted-by":"crossref","unstructured":"W. Zimmermann, W. L\u00f6we, An approach to machine-independent parallel programming, in: B. Buchberger, J. Volkert (Eds.), Proceedings of the Third Joint Conference on Vector and Parallel Processing, Lecture Notes in Computer Science, vol. 854, Springer, Berlin, 1994, pp. 277\u2013288","DOI":"10.1007\/3-540-58430-7_25"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819100000296?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819100000296?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T13:59:00Z","timestamp":1552658340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819100000296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":16,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0167819100000296"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(00)00029-6","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}