{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:36:34Z","timestamp":1742391394180},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176784"},{"type":"electronic","value":"9783642176791"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-17679-1_14","type":"book-chapter","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T13:44:30Z","timestamp":1294235070000},"page":"155-166","source":"Crossref","is-referenced-by-count":10,"title":["A High-Level Framework for Distributed Processing of Large-Scale Graphs"],"prefix":"10.1007","author":[{"given":"Elzbieta","family":"Krepska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thilo","family":"Kielmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wan","family":"Fokkink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henri","family":"Bal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jpdc.1997.1403","volume":"48","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. J.\u00a0of Par.\u00a0and Distr.\u00a0Computing\u00a048(1), 71\u201395 (1998)","journal-title":"J.\u00a0of Par.\u00a0and Distr.\u00a0Computing"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/050640904","volume":"48","author":"U. Feige","year":"2006","unstructured":"Feige, U., Krauthgamer, R.: A polylog approximation of the minimum bisection. SIAM Review\u00a048(1), 99\u2013130 (2006)","journal-title":"SIAM Review"},{"issue":"1","key":"14_CR3","first-page":"5","volume":"17","author":"A. Lumsdaine","year":"2007","unstructured":"Lumsdaine, A., Gregor, D., Hendrickson, B., Berry, J.: Challenges in parallel graph processing. PPL\u00a017(1), 5\u201320 (2007)","journal-title":"PPL"},{"key":"14_CR4","volume-title":"The Boost Graph Library","author":"J. Siek","year":"2002","unstructured":"Siek, J., Lee, L.-Q., Lumsdaine, A.: The Boost Graph Library. Addison-Wesley, Reading (2002)"},{"key":"14_CR5","unstructured":"Gregor, D., Lumsdaine, A.: The parallel BGL: A generic library for distributed graph computations. In: Parallel Object-Oriented Scientific Computing (2005)"},{"issue":"10","key":"14_CR6","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/1094811.1094844","volume":"40","author":"D. Gregor","year":"2005","unstructured":"Gregor, D., Lumsdaine, A.: Lifting sequential graph algorithms for distributed-memory parallel computation. OOPSLA\u00a040(10), 423\u2013437 (2005)","journal-title":"OOPSLA"},{"key":"14_CR7","volume-title":"Introduction to algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to algorithms. MIT Press, Cambridge (1990)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/3-540-45591-4_68","volume-title":"Parallel and Distributed Processing","author":"L. Fleischer","year":"2000","unstructured":"Fleischer, L., Hendrickson, B., Pinar, A.: On identifying strongly connected components in parallel. In: Rolim, J.D.P. (ed.) IPDPS-WS 2000. LNCS, vol.\u00a01800, pp. 505\u2013511. Springer, Heidelberg (2000)"},{"issue":"8","key":"14_CR9","first-page":"54","volume":"43","author":"H.E. Bal","year":"2010","unstructured":"Bal, H.E., Maassen, J., van Nieuwpoort, R., Drost, N., Kemp, R., van Kessel, T., Palmer, N., Wrzesi\u0144ska, G., Kielmann, T., van Reeuwijk, K., Seinstra, F., Jacobs, C., Verstoep, K.: Real-world distributed computing with Ibis. IEEE\u00a043(8), 54\u201362 (2010)","journal-title":"IEEE"},{"key":"14_CR10","unstructured":"The Java SE HotSpot virtual machine. java.sun.com\/products\/hotspot"},{"key":"14_CR11","unstructured":"Dijkstra, E.: Shmuel Safra\u2019s version of termination detection. Circulated privately (January 1987)"},{"key":"14_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168724","volume-title":"Introduction to distributed algorithms","author":"G. Tel","year":"2000","unstructured":"Tel, G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (2000)"},{"key":"14_CR13","unstructured":"Distributed ASCI Supercomputer DAS-3, www.cs.vu.nl\/das3"},{"issue":"8","key":"14_CR14","doi-asserted-by":"publisher","first-page":"5207","DOI":"10.1073\/pnas.032085699","volume":"99","author":"D.M. Pennock","year":"2002","unstructured":"Pennock, D.M., Flake, G.W., Lawrence, S., Glover, E.J., Giles, C.L.: Winners don\u2019t take all: Characterizing the competition for links on the web. PNAS\u00a099(8), 5207\u20135211 (2002)","journal-title":"PNAS"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: A system for large-scale graph processing. In: SIGMOD, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Barnat, J., Chaloupka, J., van de Pol, J.: Improved distributed algorithms for SCC decomposition. In: PDMC 2007. ENTCS, vol.\u00a0198(1), pp. 63\u201377 (2008)","DOI":"10.1016\/j.entcs.2008.02.001"},{"key":"14_CR17","unstructured":"Berry, J., Hendrickson, B., Kahan, S., Konecny, P.: Graph software development and performance on the MTA-2 and Eldorado. At 48-th Cray Users Group meeting (2006)"},{"key":"14_CR18","first-page":"36","volume-title":"PPoPP 2005","author":"C. Coarfa","year":"2005","unstructured":"Coarfa, C.: et\u00a0al. An evaluation of global address space languages: Co-array Fortran and Unified Parallel C. In: PPoPP 2005, pp. 36\u201347. ACM, New York (2005)"},{"key":"14_CR19","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/1094811.1094852","volume-title":"OOPSLA","author":"P. Charles","year":"2005","unstructured":"Charles, P.: et\u00a0al. X10: An object-oriented approach to non-uniform cluster computing. In: OOPSLA, pp. 519\u2013538. ACM, New York (2005)"},{"issue":"3","key":"14_CR20","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/99.714604","volume":"5","author":"B.L. Chamberlain","year":"1998","unstructured":"Chamberlain, B.L., Choi, S.-E., Lewis, E.C., Snyder, L., Weathersby, W.D., Lin, C.: The case for high-level parallel programming in ZPL. IEEE Comput. Sci. Eng.\u00a05(3), 76\u201386 (1998)","journal-title":"IEEE Comput. Sci. Eng."},{"key":"14_CR21","first-page":"536","volume-title":"ICPP","author":"G. Cong","year":"2008","unstructured":"Cong, G., Kodali, S., Krishnamoorthy, S., Lea, D., Saraswat, V., Wen, T.: Solving large, irregular graph problems using adaptive work-stealing. In: ICPP, pp. 536\u2013545. IEEE, Los Alamitos (2008)"},{"issue":"8","key":"14_CR22","first-page":"103","volume":"33","author":"L. Valiant","year":"1990","unstructured":"Valiant, L.: A bridging model for parallel computation. Comm.\u00a0ACM\u00a033(8), 103\u2013111 (1990)","journal-title":"Comm.\u00a0ACM"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Chan, A., Dehne, F., Taylor, R.: CGMgraph\/CGMlib: Implementing and testing CGMgraph alg. on PC clusters and shared memory machines. J. of HPC App., 19(1):81\u201397 (2005)","DOI":"10.1177\/1094342005051196"},{"key":"14_CR24","unstructured":"MPI Forum: MPI: A message passing interface. J of Supercomp Appl.\u00a08(3\/4), 169\u2013416 (1994)"},{"key":"14_CR25","unstructured":"Hielscher, F., Gottschling, P.: ParGraph library. pargraph.sourceforge.net (2004)"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Blom, S., van Langevelde, I., Lisser, B.: Compressed and distributed file formats for labeled transition systems. In: PDMC 2003. ENTCS, vol.\u00a089, pp. 68\u201383 (2003)","DOI":"10.1016\/S1571-0661(05)80097-0"},{"issue":"1","key":"14_CR27","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/1147197.1147210","volume":"40","author":"L. Denoyer","year":"2006","unstructured":"Denoyer, L., Gallinari, P.: The Wikipedia XML corpus. SIGIR Forum\u00a040(1), 64\u201369 (2006)","journal-title":"SIGIR Forum"},{"key":"14_CR28","unstructured":"Resource description framework, http:\/\/www.w3.org\/RDF"},{"issue":"3","key":"14_CR29","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1038\/nrm1857","volume":"7","author":"A.R. Joyce","year":"2006","unstructured":"Joyce, A.R., Palsson, B.O.: The model organism as a system: Integrating \u2019omics\u2019 data sets. Nat. Rev. Mol. Cell. Biol.\u00a07(3), 198\u2013210 (2006)","journal-title":"Nat. Rev. Mol. Cell. Biol."},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-70952-7_4","volume-title":"Formal Methods: Applications and Technology","author":"M. Hammer","year":"2007","unstructured":"Hammer, M., Weber, M.: To store or not to store reloaded: Reclaiming memory on demand. In: Brim, L., Haverkort, B.R., Leucker, M., van de Pol, J. (eds.) FMICS 2006 and PDMC 2006. LNCS, vol.\u00a04346, pp. 51\u201366. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17679-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T15:12:52Z","timestamp":1685891572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17679-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642176784","9783642176791"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17679-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}