{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:22:59Z","timestamp":1759332179878},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0020-0190(01)00257-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"83-92","source":"Crossref","is-referenced-by-count":3,"title":["On scheduling send-graphs and receive-graphs under the LogP-model"],"prefix":"10.1016","volume":"82","author":[{"given":"W.","family":"Zimmermann","sequence":"first","affiliation":[]},{"given":"W.","family":"L\u00f6we","sequence":"additional","affiliation":[]},{"given":"D.","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00257-5_BIB001","series-title":"Proc. 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP'93)","first-page":"1","article-title":"LogP: Towards a realistic model of parallel computation","author":"Culler","year":"1993"},{"issue":"11","key":"10.1016\/S0020-0190(01)00257-5_BIB002","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":"Comm. ACM"},{"key":"10.1016\/S0020-0190(01)00257-5_BIB003","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"10.1016\/S0020-0190(01)00257-5_BIB004","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","article-title":"Using dual approximation algorithms for scheduling problems: Theoretical and practical results","volume":"34","author":"Hochbaum","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00257-5_BIB005","article-title":"A Catalog of Complexity Classes","volume":"A","author":"Johnson","year":"1990"},{"key":"10.1016\/S0020-0190(01)00257-5_BIB006","series-title":"Proc. 5th Annual ACM Symposium on Parallel Algorithms and Architectures","first-page":"142","article-title":"Optimal broadcast and summation in the LogP-model","author":"Karp","year":"1993"},{"issue":"2","key":"10.1016\/S0020-0190(01)00257-5_BIB007","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. Comput."},{"key":"10.1016\/S0020-0190(01)00257-5_BIB008","series-title":"Scheduling with communication for multiprocessor computation, Ph.D. thesis","author":"Verriet","year":"1998"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002575?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002575?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T22:28:08Z","timestamp":1556836088000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0020019001002575"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00257-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}