{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:02Z","timestamp":1742598602907,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584308"},{"type":"electronic","value":"9783540487890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58430-7_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:02:41Z","timestamp":1330272161000},"page":"277-288","source":"Crossref","is-referenced-by-count":13,"title":["An approach to machine-independent parallel programming"],"prefix":"10.1007","author":[{"given":"Wolf","family":"Zimmermann","sequence":"first","affiliation":[]},{"given":"Welf","family":"L\u00f6we","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","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 235\u2013261, 1993.","DOI":"10.1145\/155332.155333"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"R. Cole and O. Zajicek. The expected advantage of asynchrony. In Proceedings of the 2nd ACM Symposium on Parallel Algorithms and Architectures, pages 85\u201394, 1990.","DOI":"10.1145\/97444.97673"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"P. Flajolet, B. Salvy, and P. Zimmermann. Average case analysis of algorithms. Theoretical Computer Science, 1991.","DOI":"10.1016\/0304-3975(91)90145-R"},{"key":"25_CR4","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 Transactions on Parallel and Distributed Systems, 4:686\u2013701, june 1993.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science Vol. A, pages 871\u2013941. MIT-Press, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"issue":"2","key":"25_CR6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","volume":"19","author":"C.H. Papadimitrou","year":"1990","unstructured":"C.H. Papadimitrou 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"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"L. G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science Vol. A, pages 945\u2013971. MIT-Press, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50023-0"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Wolf Zimmermann. Autmatische Komplexit\u00e4tsanalyse funktionaler Programme. Informatik-Fachberichte. Springer, 1990. Disseration at the Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik.","DOI":"10.1007\/978-3-662-05948-7"},{"key":"25_CR9","unstructured":"Wolf Zimmermann. Automatic worst case analysis of parallel programs. Technical Report TR-90-066, International Computer Science Institute, December 1990."},{"key":"25_CR10","unstructured":"H. Zima. Supercompilers for Parallel and Vector Computers. Frontier Series. ACM Press, 1991."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Wolf Zimmermann and Holger Kumm. On the implementation of virtual shared memory. In Programming Models for Massively Parallel Computers, pages 172\u2013178, 1993.","DOI":"10.1109\/PMMP.1993.315542"},{"key":"25_CR12","unstructured":"P. Zimmermann and W. Zimmermann. Automatic complexity analysis of divide-and-conquer algorithms. In Proceedings of the Sixth Internation Symposium on Computer and Information Sciences, pages 395\u2013404, 1991. also available as INRIA-Report 1134, December 1989."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing: CONPAR 94 \u2014 VAPP VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58430-7_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:28:35Z","timestamp":1742596115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58430-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584308","9783540487890"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58430-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}