{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:01:04Z","timestamp":1743051664346,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664437"},{"type":"electronic","value":"9783540483113"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","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":[[1999]]},"DOI":"10.1007\/3-540-48311-x_77","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:16:48Z","timestamp":1269897408000},"page":"552-556","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Cost Model For Asynchronous and Structured Message Passing\u22c6"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Melin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Raffin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Rebeuf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Virot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,8,6]]},"reference":[{"key":"77_CR1","doi-asserted-by":"crossref","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and V.E. Thorsten. LogP: Towards a realistic model of parallel computation. In Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, pages 1\u201312, May 1993.","DOI":"10.1145\/155332.155333"},{"key":"77_CR2","doi-asserted-by":"crossref","unstructured":"F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputer. ACM 9th Symposium on Computational Geometry, 1993.","DOI":"10.1145\/160985.161154"},{"key":"77_CR3","doi-asserted-by":"crossref","unstructured":"J. Gabarro J. Balcazar, J. Diaz. Structural Complexity II. Springer-Verlag, 1989.","DOI":"10.1007\/978-3-642-75357-2"},{"key":"77_CR4","unstructured":"W F McColl. General purpose parallel computing. In am Gibbons and P Spirakis, editors, Lectures on Parallel Computation. Proc. 1991 ALCOM Spring School on Parallel Computation, pages 337\u2013391. Cambridge University Press, 93."},{"issue":"1","key":"77_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jpdc.1998.1439","volume":"50","author":"E. Melin","year":"1998","unstructured":"Emmanuel Melin, Bruno Raffin, Xavier Rebeuf, and Bernard Virot. A Structured Synchronization and Communication Model Fitting Irregular Data Accesses. Journal of Parallel and Distributed Computing, 50(1):3\u201327, 1998.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"77_CR6","doi-asserted-by":"crossref","unstructured":"Emmanuel Melin, Bruno Raffin, Xavier Rebeuf, and Bernard Virot. A Cost Model For Asynchronous and Structured Message Passing (Extended Version). Technical Report RR99-07, LIFO, Orl\u00e9ans, France, April 1999.","DOI":"10.1007\/3-540-48311-X_77"},{"key":"77_CR7","unstructured":"D.B. Skillicorn. miniBSP: A BSP Language and Transformation System. \n                  http:\/\/www.qucis.queensu.ca\/home\/skill\n                  \n                , 1996."},{"issue":"8","key":"77_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"L.G. Valiant. A Bridging Model for Parallel Computation. Communications of the ACM, 33(8):103\u2013111, August 1990.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201999 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48311-X_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T14:55:41Z","timestamp":1600354541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48311-X_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664437","9783540483113"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-48311-x_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"6 August 1999","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"}]}}