{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:31:40Z","timestamp":1725492700765},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410102"},{"type":"electronic","value":"9783540452553"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45255-9_13","type":"book-chapter","created":{"date-parts":[[2007,10,5]],"date-time":"2007-10-05T08:56:57Z","timestamp":1191574617000},"page":"72-79","source":"Crossref","is-referenced-by-count":0,"title":["Handling Graphs According to a Coarse Grained Approach: Experiments with PVM and MPI"],"prefix":"10.1007","author":[{"given":"Isabelle Gu\u00e9rin","family":"Lassous","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Gustedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Morvan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,8,18]]},"reference":[{"key":"13_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-63165-8_195","volume-title":"Proceedings of the 24th International Colloquium ICALP\u201997","author":"E. Caceres","year":"1997","unstructured":"E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputer and BSP. In Proceedings of the 24th International Colloquium ICALP\u201997, volume 1256 of LNCS, pages 390\u2013400, 1997."},{"key":"13_CR2","unstructured":"T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990."},{"key":"13_CR3","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 Proceeding of 4-th ACM SIGPLAN Symp. on Principles and Practises of Parallel Programming, pages 1\u201312, 1993.","DOI":"10.1145\/155332.155333"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputer. In ACM 9th Symposium on Computational Geometry, pages 298\u2013307, 1993.","DOI":"10.1145\/160985.161154"},{"key":"13_CR5","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. 2nd Asian Computing Science Conference ASIAN\u201996","author":"F. Dehne","year":"1996","unstructured":"F. Dehne and S. W. Song. Randomized parallel list ranking for distributed memory multiprocessors. In Springer Verlag, (editor), Proc. 2nd Asian Computing Science Conference ASIAN\u201996, volume 1179 of LNCS, pages 1\u201310, 1996."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/jpdc.1994.1085","volume":"22","author":"A. V. Gerbessiotis","year":"1994","unstructured":"A. V. Gerbessiotis and L. G. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22:251\u2013267, 1994.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"13_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"M.T. Goodrich. Communication-efficient parallel sorting. In Proc. of 28th Symp. on Theory of Computing, 1996.","DOI":"10.1145\/237814.237870"},{"key":"13_CR9","unstructured":"I. Gu\u00e9rin Lassous and J. Gustedt. List ranking on PC clusters. Technical Report 3869,I.N.R.I.A., 2000."},{"key":"13_CR10","unstructured":"I. Gu\u00e9rin Lassous, J. Gustedt, and M. Morvan. Feasibility, Portability, Predictability and Efficiency: Four Ambitious Goals for the Design and Implementation of Parallel Coarse Grained Graph Algorithms. Technical Report RR-3885, INRIA Lorraine, 2000. http:\/\/www.inria.fr\/RRRT\/publicationsfra.html ."},{"key":"13_CR11","series-title":"Lect Notes Comput Sci","volume-title":"WG\u2019 95 21st Workshop on Graph-Theoretic Concepts in computer Science","author":"J. Gustedt","year":"1995","unstructured":"J. Gustedt, M. Morvan, and L. Viennot. A compact data structure and parallel algorithms for permutation graphs. In M. Nagl, (editor), WG\u2019 95 21st Workshop on Graph-Theoretic Concepts in computer Science, 1995. Lecture Notes in Computer Science 1017."},{"key":"13_CR12","unstructured":"J. J\u00e1j\u00e1. An Introduction to Parallel Algorithm. Addison Wesley, 1992."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"F.P. Preparata and M.I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"M. Reid-Miller. List ranking and list scan on the Cray C-90. In Proc. ACM Symp. on Parallel Algorithms and Architectures, pages 104\u2013113, 1994.","DOI":"10.1145\/181014.181049"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1006\/jpdc.1998.1508","volume":"56","author":"J. F. Sibeyn","year":"1999","unstructured":"J. F. Sibeyn, F. Guillaume, and T. Seidel. Practical Parallel List Ranking. Journal of Parallel and Distributed Computing, 56:156\u2013180, 1999.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"8","key":"13_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. Valiant","year":"1990","unstructured":"L. Valiant. A bridging model for parallel computation. Communications of the ACM, Vol. 33(8):103\u2013111, 1990.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Parallel Virtual Machine and Message Passing Interface"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45255-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:15:14Z","timestamp":1556882114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45255-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410102","9783540452553"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45255-9_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}