{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:18:21Z","timestamp":1742390301747,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0002832","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"895-904","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On linear schedules of task graphs for generalized logp-machines"],"prefix":"10.1007","author":[{"given":"Welf","family":"L\u00f6we","sequence":"first","affiliation":[]},{"given":"Wolf","family":"Zimmermann","sequence":"additional","affiliation":[]},{"given":"J\u00f6rn","family":"Eisenbiegler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"120_CR1","doi-asserted-by":"crossref","unstructured":"A. Alexandrov, M. Ionescu, K. E. Schauser, and C. Scheimann. Loggp: Incorporating long messages into the logp-model \u2014 one step closer towards a realistic model for parallel computation. In 7th Annual Symposium on Parallel Algorithms and Architectures, pages 95\u2013105. ACM Press, 1995.","DOI":"10.1145\/215399.215427"},{"issue":"7","key":"120_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/173284.155333","volume":"28","author":"David Culler","year":"1993","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 93), pages 1\u201312, 1993. published in: SIGPLAN Notices (28) 7.","journal-title":"ACM SIGPLAN Notices"},{"issue":"11","key":"120_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/240455.240477","volume":"39","author":"D. Culler","year":"1996","unstructured":"[CKP+96] D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: A practical model of parallel computation. Communications of the ACM, 39(11):78\u201385, 1996.","journal-title":"Communications of the ACM"},{"key":"120_CR4","doi-asserted-by":"crossref","unstructured":"B. Di Martino and G. Ianello. Parallelization of non-simultaneous iterative methods for systems of linear equations. In Parallel Processing: CONPAR 94 \u2014 VAPP VI, volume 854 of Lecture Notes in Computer Science, pages 253\u2013264. Springer, 1994.","DOI":"10.1007\/3-540-58430-7_23"},{"key":"120_CR5","doi-asserted-by":"crossref","unstructured":"J\u00f6rn Eisenbiegler, Welf L\u00f6we, and Andreas Wehrenpfennig. On the optimization by redundancy using an extended LogP model. In International Conference on Advances in Parallel and Distributed Computing (APDC'97), pages 149\u2013155. IEEE Computer Society Press, 1997.","DOI":"10.1109\/APDC.1997.574026"},{"key":"120_CR6","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/71.242154","volume":"4","author":"A. Gerasoulis","year":"1993","unstructured":"A. Gerasoulis and T. Yang. On the granularity and clustering of directed acyclic task graphs. IEEE Transactions on Parallel and Distributed Systems, 4:686\u2013701, June 1993.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"120_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft and R. M. Karp. An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225\u2013231, 1973.","journal-title":"SIAM Journal on Computing"},{"key":"120_CR8","doi-asserted-by":"crossref","unstructured":"R. M. Karp, A. Sahay, E. E. Santos, and K. E. Schauser. Optimal broadcast and summation in the LogP model. In 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 142\u2013153. ACM, 1993.","DOI":"10.1145\/165231.165250"},{"key":"120_CR9","unstructured":"W. L\u00f6we, J. Eisenbiegler, and W. Zimmermann. Optimizing parallel programs on machines with fast communication. In 9. International Conference on Parallel and Distributed Computing Systems, pages 100\u2013103, 1996."},{"key":"120_CR10","unstructured":"W. L\u00f6we, M. Middendorf, and W. Zimmermann. Scheduling inverse trees under the communication model of the logp-machine. Theoretical Computer Science, 1997. Submitted, currently under revision."},{"key":"120_CR11","doi-asserted-by":"crossref","unstructured":"W. L\u00f6we and W. Zimmermann. On finding optimal clusterings in task graphs. In N. Mirenkov, editor, Parallel Algorithms\/Architecture Synthesis pAs'95, pages 241\u2013247. IEEE, 1995.","DOI":"10.1109\/AISPAS.1995.401333"},{"key":"120_CR12","unstructured":"W. L\u00f6we and W. Zimmermann. Programming data-parallel \u2014 executing process parallel. In P. Ritzson and L. Finmo, editors, Parallel Programming and Applications, pages 50\u201364. IOS Press, 1995."},{"issue":"2","key":"120_CR13","doi-asserted-by":"publisher","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 Journal on Computing, 19(2):322\u2013328, 1990.","journal-title":"SIAM Journal on Computing"},{"issue":"9","key":"120_CR14","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/71.308533","volume":"5","author":"T. Yang","year":"1994","unstructured":"T. Yang and A. Gerasoulis.DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems, 5(9):951\u2013967, 1994.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"120_CR15","doi-asserted-by":"crossref","unstructured":"W. Zimmermann and W. L\u00f6we. An approach to machine-independent parallel programming. In Parallel Processing: CONPAR 94 \u2014 VAPP VI, volume 854 of Lecture Notes in Computer Science, pages 277\u2013288. Springer, 1994.","DOI":"10.1007\/3-540-58430-7_25"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T22:03:47Z","timestamp":1736114627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0002832","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}