{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T11:40:04Z","timestamp":1737546004170,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440499"},{"type":"electronic","value":"9783540457060"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45706-2_24","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T05:37:18Z","timestamp":1191735438000},"page":"189-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Scheduling Task-Graphs to LogP-Machines with Disturbances"],"prefix":"10.1007","author":[{"given":"Welf","family":"L\u00f6we","sequence":"first","affiliation":[]},{"given":"Wolf","family":"Zimmermann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"R. Cole and O. Zajicek. The aPRAM: Incorporating asynchrony into the PRAM model. In 1st ACM Symp. on Parallel Algorithms and Architectures, pp 169\u2013178, 1989.","DOI":"10.1145\/72935.72954"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"R. Cole and O. Zajicek. The expected advantage of asynchrony. In 2nd ACM Symp. on Parallel Algorithms and Architectures, pp 85\u201394, 1990.","DOI":"10.1145\/97444.97673"},{"issue":"7","key":"24_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/173284.155333","volume":"28","author":"D. Culler","year":"1993","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramo-nian, 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), pp 1\u201312, 1993. published in: SIGPLAN Notices (28)7. also published in: Communications of the ACM, 39(11):78\u201385, 1996.","journal-title":"SIGPLAN Notices"},{"key":"24_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-58430-7_23","volume-title":"Parallel Processing: CONPAR 94 \u2014 VAPP VI","author":"B. Martino Di","year":"1994","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 LNCS, pp 253\u2013264. Springer, 1994."},{"key":"24_CR5","series-title":"Lect Notes Comput Sci","first-page":"602","volume-title":"Europar\u2019 96 Parallel Processing Vol. 2","author":"J. Eisenbiegler","year":"1996","unstructured":"J. Eisenbiegler, W. L\u00f6we, and W. Zimmermann. Optimizing parallel programs on machines with expensive communication. In Europar\u2019 96 Parallel Processing Vol. 2, volume 1124 of LNCS, pp 602\u2013610. Springer, 1996."},{"key":"24_CR6","doi-asserted-by":"crossref","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 Trans. Parallel and Distributed Systems, 4:686\u2013701, Jun. 1993.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"P. Gibbons. A more practical PRAM model. In 1st ACM Symp. on Parallel Algorithms and Architectures, pp 158\u2013168, 1989.","DOI":"10.1145\/72935.72953"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"A. Gupta, G. Parmentier, and D. Trystram. Scheduling precedence task graphs with disturbances. RAIRO Operational Research Journal, 2002. accepted.","DOI":"10.1051\/ro:2003018"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"W. L\u00f6we and W. Zimmermann. Upper time bounds for executing pram-programs on the logp-machine. In M. Wolfe, editor, 9th ACM International Conference on Supercomputing, pp 41\u201350. ACM, 1995.","DOI":"10.1145\/224538.224543"},{"key":"24_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"273ff","DOI":"10.1007\/3-540-48228-8_28","volume-title":"HPCN\u201901: High Performance Computing and Networking","author":"W. L\u00f6we","year":"2001","unstructured":"W. L\u00f6we, W. Zimmermann, S. Dickert, and J. Eisenbiegler. Source code and task graphs in program optimization. In HPCN\u201901: High Performance Computing and Networking, LNCS, 2110, pp 273ff. Springer, 2001."},{"key":"24_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/BFb0002832","volume-title":"Europar\u201997: Parallel Processing","author":"W. L\u00f6we","year":"1997","unstructured":"W. L\u00f6we, W. Zimmermann, and J. Eisenbiegler. On linear schedules for task graphs for generalized logp-machines. In Europar\u201997: Parallel Processing, LNCS, 1300, pp 895\u2013904. Springer, 1997."},{"key":"24_CR12","unstructured":"M. Luby. On the parallel complexity of symmetric connection networks. Technical Report 214\/88, University of Toronto, Departement of Computer Science, 1988."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"C. Martel, A. Park, and R. Subramonian. Asynchronous PRAMs are (almost) as good as synchronous PRAMs. In 31st Symp. on Foundations of Computer Science, pp 590\u2013599, 1990.","DOI":"10.1109\/FSCS.1990.89580"},{"issue":"6","key":"24_CR14","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1137\/0221063","volume":"21","author":"C. Martel","year":"1992","unstructured":"C. Martel, A. Park, and R. Subramonian. Work-optimal asynchronous algorithms for shared memory parallel computers. SIAM J. on Computing, 21(6):1070\u20131099, Dec 1992.","journal-title":"SIAM J. on Computing"},{"key":"24_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-48311-X_45","volume-title":"Europar\u201999: Parallel Processing","author":"A. Moukrim","year":"1999","unstructured":"A. Moukrim, E. Sanlaville, and F. Guinand. Scheduling with communication delays and on-line disturbances. In P. Amestoy et. al., editor, Europar\u201999: Parallel Processing, number 1685 in LNCS, pp 350\u2013357. Springer-Verlag, 1999."},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"M. Nishimura. Asynchronous shared memory parallel computation. In 2nd ACM Symp. on Parallel Algorithms and Architectures, pp 76\u201384, 1990.","DOI":"10.1145\/97444.97672"},{"issue":"2","key":"24_CR17","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 J. on Computing, 19(2):322\u2013328, 1990.","journal-title":"SIAM J. on Computing"},{"key":"24_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-58430-7_25","volume-title":"Parallel Processing: CONPAR 94 \u2014 VAPP VI","author":"W. Zimmermann","year":"1994","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 LNCS, pp 277\u2013288. Springer, 1994."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2002 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45706-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:42:52Z","timestamp":1737463372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45706-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440499","9783540457060"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45706-2_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"20 August 2002","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"}]}}