{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:35:51Z","timestamp":1743017751170,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319174723"},{"type":"electronic","value":"9783319174730"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17473-0_8","type":"book-chapter","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T09:59:39Z","timestamp":1430387979000},"page":"116-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tiled Linear Algebra a System for Parallel Graph Algorithms"],"prefix":"10.1007","author":[{"given":"Saeed","family":"Maleki","sequence":"first","affiliation":[]},{"given":"G. Carl","family":"Evans","sequence":"additional","affiliation":[]},{"given":"David A.","family":"Padua","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,1]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/10703040_12","volume-title":"Vector and Parallel Processing \u2013 VECPAR\u201998","author":"J Arnal","year":"1999","unstructured":"Arnal, J., Migall\u00f3n, V., Penad\u00e9s, J.: Synchronous and asynchronous parallel algorithms with overlap for almost linear systems. In: Hern\u00e1ndez, V., Palma, J.M.L.M., Dongarra, J. (eds.) VECPAR 1998. LNCS, vol. 1573, pp. 142\u2013155. Springer, Heidelberg (1999)"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1177\/1094342011403516","volume":"25","author":"A Bulu\u00e7","year":"2011","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: The combinatorial blas: design, implementation, and applications. Int. J. High Perform. Comput. Appl. 25(4), 496\u2013509 (2011)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: a recursive model for graph mining. In: SDM (2004)","DOI":"10.1137\/1.9781611972740.43"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0024-3795(69)90028-7","volume":"2","author":"D Chazan","year":"1969","unstructured":"Chazan, D., Miranker, W.: Chaotic relaxation. Linear Algebra Appl. 2(2), 199\u2013222 (1969)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"8_CR7","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI 2012, pp. 17\u201330, USENIX Association, Berkeley(2012)"},{"volume-title":"Graph Algorithms in the Language of Linear Algebra","year":"2011","key":"8_CR8","unstructured":"Kepner, J., Gilbert, J. (eds.): Graph Algorithms in the Language of Linear Algebra. Society for Industrial and Applied Mathematics, Philadelphia (2011)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Krishnamoorthy, S., Baskaran, M., Bondhugula, U., Ramanujam, J., Rountev, A., Sadayappan, P.: Effective automatic parallelization of stencil computations. In: Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2007, pp. 235\u2013244, ACM, New York (2007)","DOI":"10.1145\/1273442.1250761"},{"issue":"8","key":"8_CR10","doi-asserted-by":"publisher","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., Hellerstein, J.M.: Distributed graphlab: a framework for machine learning and data mining in the cloud. Proc. VLDB Endow. 5(8), 716\u2013727 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"8_CR11","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: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, pp. 135\u2013146, ACM, New York (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Mattson, T., Bader, D.A., Berry, J.W., Bulu\u00e7, A., Dongarra, J., Faloutsos, C., Feo, J., Gilbert, J.R., Gonzalez, J., Hendrickson, B., Kepner, J., Leiserson, C.E., Lumsdaine, A., Padua, D.A., Poole, S., Reinhardt, S., Stonebraker, M., Wallach, S., Yoo, A.: Standards for graph algorithm primitives. In: HPEC, pp. 1\u20132 (2013)","DOI":"10.1109\/HPEC.2013.6670338"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0196-6774(03)00076-2","volume":"49","author":"U Meyer","year":"2003","unstructured":"Meyer, U., Sanders, P.: Delta-stepping: a parallelizable shortest path algorithm. J. Algorithms 49(1), 114\u2013152 (2003)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17473-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T11:57:52Z","timestamp":1674907072000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17473-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319174723","9783319174730"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17473-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}