{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:42Z","timestamp":1763468142548},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642376573"},{"type":"electronic","value":"9783642376580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37658-0_4","type":"book-chapter","created":{"date-parts":[[2013,4,5]],"date-time":"2013-04-05T06:20:22Z","timestamp":1365142822000},"page":"46-60","source":"Crossref","is-referenced-by-count":11,"title":["The STAPL Parallel Graph Library"],"prefix":"10.1007","author":[{"family":"Harshvardhan","sequence":"first","affiliation":[]},{"given":"Adam","family":"Fidel","sequence":"additional","affiliation":[]},{"given":"Nancy M.","family":"Amato","sequence":"additional","affiliation":[]},{"given":"Lawrence","family":"Rauchwerger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"The graph 500 list, \n                    \n                      http:\/\/www.graph500.org"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0149-1970(01)00023-3","volume":"40","author":"M. Adams","year":"2002","unstructured":"Adams, M., Larsen, E.: Fast iterative methods for discrete-ordinates particle transport calculations. Progress in Nuclear Energy\u00a040(1), 3\u2013159 (2002)","journal-title":"Progress in Nuclear Energy"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Berry, J.W., et al.: Software and algorithms for graph queries on multithreaded architectures. In: Par. and Dist. Proc. Symp., Int., p. 495 (2007)","DOI":"10.1109\/IPDPS.2007.370685"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-19595-2_18","volume-title":"Languages and Compilers for Parallel Computing","author":"A. Buss","year":"2011","unstructured":"Buss, A., Fidel, A., Harshvardhan, Smith, T., Tanase, G., Thomas, N., Xu, X., Bianco, M., Amato, N.M., Rauchwerger, L.: The STAPL pView. In: Cooper, K., Mellor-Crummey, J., Sarkar, V. (eds.) LCPC 2010. LNCS, vol.\u00a06548, pp. 261\u2013275. Springer, Heidelberg (2011)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1815695.1815713","volume-title":"Proc. Annual Haifa Exp. Sys. Conf","author":"A. Buss","year":"2010","unstructured":"Buss, A., et al.: STAPL: Standard template adaptive parallel library. In: Proc. Annual Haifa Exp. Sys. Conf, pp. 1\u201310. ACM, New York (2010)"},{"key":"4_CR6","unstructured":"Culler, D., et al.: Par. Comp. Architecture: A Hardware\/Software Approach. The Morgan Kaufmann Series in Comp. Arch. and Design (1998)"},{"key":"4_CR7","unstructured":"Gregor, D., Lumsdaine, A.: The parallel BGL: A generic library for distributed graph computations. Par. Object-Oriented Scientific Computing (July 2005)"},{"key":"4_CR8","first-page":"135","volume-title":"Proc. Int. Conf. on Management of Data","author":"G. Malewicz","year":"2010","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: Proc. Int. Conf. on Management of Data, pp. 135\u2013146. ACM, New York (2010)"},{"issue":"8","key":"4_CR9","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.jpdc.2005.03.007","volume":"65","author":"W. McLendon III","year":"2005","unstructured":"McLendon III, W., et al.: Finding strongly connected components in distributed graphs. J. Par. Dist. Comp.\u00a065(8), 901\u2013910 (2005)","journal-title":"J. Par. Dist. Comp."},{"key":"4_CR10","unstructured":"Musser, D., et al.: STL Tutorial and Ref. Guide, 2nd edn. Addison-Wesley (2001)"},{"key":"4_CR11","unstructured":"Page, L., et al.: The pagerank citation ranking: Bringing order to the web (1998)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Pearce, R., et al.: Multithreaded asynchronous graph traversal for in-memory and semi-external memory. In: Proc. of the ACM\/IEEE Int. Conf. for High Performance Computing, Networking, Storage and Analysis, Washington, DC, USA, pp. 1\u201311 (2010)","DOI":"10.1109\/SC.2010.34"},{"key":"4_CR13","first-page":"230","volume-title":"Proc. ACM SIGPLAN Symp. Prin. Prac. Par. Prog","author":"S. Saunders","year":"2003","unstructured":"Saunders, S., Rauchwerger, L.: ARMI: an adaptive, platform independent communication library. In: Proc. ACM SIGPLAN Symp. Prin. Prac. Par. Prog, pp. 230\u2013241. ACM, San Diego (2003)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Tanase, G., et al.: The STAPL Parallel Container Framework. In: Proc. ACM SIGPLAN Symp. Prin. Prac. Par. Prog., San Antonio, TX, USA, pp. 235\u2013246 (2011)","DOI":"10.1145\/2038037.1941586"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Thomas, N., et al.: A framework for adaptive algorithm selection in STAPL. In: Proc. ACM SIGPLAN Symp. Prin. Prac. Par. Prog, Chicago, IL, USA, pp. 277\u2013288 (2005)","DOI":"10.1145\/1065944.1065981"},{"issue":"14","key":"4_CR16","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1002\/cpe.950","volume":"17","author":"S. Thomas","year":"2005","unstructured":"Thomas, S., et al.: Parallel protein folding with STAPL. Concurrency and Computation: Practice and Experience\u00a017(14), 1643\u20131656 (2005)","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Jacobs, S.A., et al.: A scalable method for parallelizing sampling-based motion planning algorithms. Proc. IEEE Int. Conf. Robot. Autom. (2012)","DOI":"10.1109\/ICRA.2012.6225334"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Quinn, M.J., et al.: Parallel graph algorithms. ACM Comp. Surv., 319\u2013348 (1984)","DOI":"10.1145\/2514.2515"},{"key":"4_CR19","first-page":"349","volume-title":"Proc. Int. Conf. Arch. Sup. Prog. Lang. Operat. Sys.","author":"S. Hong","year":"2012","unstructured":"Hong, S., et al.: Green-marl: a dsl for easy and efficient graph analysis. In: Proc. Int. Conf. Arch. Sup. Prog. Lang. Operat. Sys., pp. 349\u2013362. ACM, New York (2012)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Valiant, L.: Bridging model for parallel computation. Comm. ACM, 103\u2013111 (1990)","DOI":"10.1145\/79173.79181"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Dehne, F., et al.: Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP. Algorithmica, 183\u2013200 (2002)","DOI":"10.1007\/s00453-001-0109-4"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37658-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T00:02:53Z","timestamp":1557619373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37658-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642376573","9783642376580"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37658-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}