{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:29Z","timestamp":1740123869078,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,28]],"date-time":"2017-01-28T00:00:00Z","timestamp":1485561600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10766-016-0481-y","type":"journal-article","created":{"date-parts":[[2017,1,28]],"date-time":"2017-01-28T12:47:29Z","timestamp":1485607649000},"page":"412-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Graph Programming Interface (GPI): A Linear Algebra Programming Model for Large Scale Graph Computations"],"prefix":"10.1007","volume":"46","author":[{"given":"William","family":"Horn","sequence":"first","affiliation":[]},{"given":"Manoj","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Joefon","family":"Jann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7029-6327","authenticated-orcid":false,"given":"Jos\u00e9","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Pratap","family":"Pattnaik","sequence":"additional","affiliation":[]},{"given":"Mauricio","family":"Serrano","sequence":"additional","affiliation":[]},{"given":"Gabriel","family":"Tanase","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,28]]},"reference":[{"key":"481_CR1","unstructured":"Bader, D., Bulu\u00e7, A., Gilbert, J., Gonzalez, J., Kepner, J., Mattson, T.: The Graph BLAS effort and its implications for Exascale. In: SIAM Workshop on Exascale Applied Mathematics Challenges and Opportunities (EX14) (2014) (extended abstract)"},{"issue":"2","key":"481_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"issue":"1\u20137","key":"481_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1\u20137), 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"481_CR4","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Fineman, J.T., Frigo, M., Gilbert, J.R., Leiserson, C.E.: Parallel sparse matrix\u2013vector and matrix-transpose\u2013vector multiplication using compressed sparse blocks. In: Symposium on Parallelism in Algorithms and Architectures, pp. 233\u2013244. ACM (2009)","DOI":"10.1145\/1583991.1584053"},{"issue":"4","key":"481_CR5","doi-asserted-by":"crossref","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":"481_CR6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MC.2015.228","volume":"8","author":"D Buono","year":"2015","unstructured":"Buono, D., Gunnels, J.A., Que, X., Checconi, F., Petrini, F., Tuan, T.-C., Long, C.: Optimizing sparse linear algebra for large-scale graph analytics. Computer 8, 26\u201334 (2015)","journal-title":"Computer"},{"key":"481_CR7","doi-asserted-by":"crossref","unstructured":"Cahill, J., Nguyen, T., Vega, M., Baska, D., Szerdi, D., Pross, H., Arroyo, R., Nguyen, H., Mueller, M., Henderson, D., et\u00a0al.: IBM power systems built with the POWER8 architecture and processors. IBM J. Res. Dev. 59(1), 4:1\u20134:10 (2015)","DOI":"10.1147\/JRD.2014.2376132"},{"key":"481_CR8","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: a recursive model for graph mining. In: Proceedings of the 2004 SIAM International Conference on Data Mining 2004 Apr 22, pp. 442\u2013446, Society for Industrial and Applied Mathematics","DOI":"10.1137\/1.9781611972740.43"},{"issue":"12","key":"481_CR9","doi-asserted-by":"crossref","first-page":"1804","DOI":"10.14778\/2824032.2824077","volume":"8","author":"A Ching","year":"2015","unstructured":"Ching, A., Edunov, S., Kabiljo, M., Logothetis, D., Muthukrishnan, S.: One trillion edges: graph processing at Facebook-scale. Proc. VLDB Endow. 8(12), 1804\u20131815 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"481_CR10","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum, L., Enon, R.: OpenMP: an industry standard API for shared-memory programming. Comput. Sci. Eng. IEEE 5(1), 46\u201355 (1998)","journal-title":"Comput. Sci. Eng. IEEE"},{"key":"481_CR11","volume-title":"Graph programming interface: rationale and specification","author":"K Ekanadham","year":"2014","unstructured":"Ekanadham, K., Horn, B., Jann, J., Kumar, M., Moreira, J., Pattnaik, P., Serrano, M., Tanase, G., Yu, H.: Graph programming interface: rationale and specification. Technical report, IBM Research (2014)"},{"key":"481_CR12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1137\/1.9780898719918.ch5","volume":"22","author":"JT Fineman","year":"2011","unstructured":"Fineman, J.T., Robinson, E.: Fundamental graph algorithms. Graph Algorithms Lang. Linear Algebra 22, 45\u201358 (2011)","journal-title":"Graph Algorithms Lang. Linear Algebra"},{"key":"481_CR13","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, pp. 17\u201330, Hollywood, CA, USA, 2012. USENIX Association, Berkeley, CA (2012)"},{"key":"481_CR14","doi-asserted-by":"crossref","unstructured":"Harshvardhan, B., West, A., Fidel, N., Amato, M., Rauchwerger, L.: A hybrid approach to processing big data graphs on memory-restricted systems. In: Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS \u201915, pp. 799\u2013808, Hyderabad, India, 2015. IEEE Computer Society (2015)","DOI":"10.1109\/IPDPS.2015.28"},{"key":"481_CR15","unstructured":"IBM. IBM Power System S812L and S822L (2014). [Online; Accessed 10-October-2015]"},{"key":"481_CR16","doi-asserted-by":"crossref","unstructured":"Kang, U., Tsourakakis, C., Faloutsos, C.: Pegasus: A peta-scale graph mining system implementation and observations. In: Proceedings of the 2009 IEEE International Conference on Data Mining, ICDM \u201909, pp. 229\u2013238, Miami, FL, 2009. IEEE Computer Society, Washington, DC (2009)","DOI":"10.1109\/ICDM.2009.14"},{"key":"481_CR17","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719918","volume-title":"Graph algorithms in the language of linear algebra","author":"J Kepner","year":"2011","unstructured":"Kepner, J., Gilbert, J.: Graph algorithms in the language of linear algebra, vol. 22. SIAM, Philadelphia, PA (2011)"},{"key":"481_CR18","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Sosi\u010d, R.: SNAP: A General Purpose Network Analysis and Graph Mining Library in C++ ACM Trans. Intell. Syst. Technol. 8(1):1:1\u20131:20 (2016)","DOI":"10.1145\/2898361"},{"key":"481_CR19","unstructured":"Low, Y., Gonzalez, J.E., Kyrola, A., Bickson, D., Guestrin, C.E., Hellerstein, J.: Graphlab: a new framework for parallel machine learning. arXiv preprint arXiv:1408.2041 (2014)"},{"key":"481_CR20","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 \u201910, pp. 135\u2013146, Indianapolis, IN, 2010. ACM. (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"481_CR21","doi-asserted-by":"crossref","unstructured":"T.\u00a0Mattson, D.\u00a0Bader, J.\u00a0Berry, A.\u00a0Buluc, J.\u00a0Dongarra, C.\u00a0Faloutsos, J.\u00a0Feo, J.\u00a0Gilbert, J.\u00a0Gonzalez, B.\u00a0Hendrickson, J.\u00a0Kepner, C.\u00a0Leiserson, A.\u00a0Lumsdaine, D.\u00a0Padua, S.\u00a0Poole, S.\u00a0Reinhardt, M.\u00a0Stonebraker, S.\u00a0Wallach, and A.\u00a0Yoo. Standards for graph algorithm primitives. In: High Performance Extreme Computing Conference (HPEC), 2013 IEEE, pp. 1\u20132 (2013)","DOI":"10.1109\/HPEC.2013.6670338"},{"issue":"1","key":"481_CR22","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K Mehlhorn","year":"1995","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA: a platform for combinatorial and geometric computing. Commun. ACM 38(1), 96\u2013102 (1995)","journal-title":"Commun. ACM"},{"key":"481_CR23","unstructured":"Murphy, R.C., Wheeler, K.B., Barrett, B.W., Ang, J.A.: Introducing the Graph 500. In: Proceedings of the CUG 2010: Simulation Comes of Age [online], Edinburgh, UK, 2010. Cray User\u2019s Group (CUG), Delaware (2010)"},{"key":"481_CR24","doi-asserted-by":"crossref","unstructured":"Nguyen, D., Lenharth, A., Pingali, K.: A lightweight infrastructure for graph analytics. In: Proceedings of ACM Symposium on Operating Systems Principles, SOSP \u201913, pp. 456\u2013471 (2013)","DOI":"10.1145\/2517349.2522739"},{"key":"481_CR25","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia, PA (2003)","edition":"2"},{"key":"481_CR26","volume-title":"Boost Graph Library: User Guide and Reference Manual","author":"JG Siek","year":"2001","unstructured":"Siek, J.G., Lee, L.-Q., Lumsdaine, A.: Boost Graph Library: User Guide and Reference Manual. The Pearson Education, London (2001)"},{"key":"481_CR27","unstructured":"Turi Inc. SFrame. https:\/\/github.com\/turi-code\/SFrame (2016)"},{"issue":"4","key":"481_CR28","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2","volume":"9","author":"RA Geijn Van De","year":"1997","unstructured":"Van De Geijn, R.A., Watts, J.: Summa: scalable universal matrix multiplication algorithm. Concurr. Pract. Exp. 9(4), 255\u2013274 (1997)","journal-title":"Concurr. Pract. Exp."},{"key":"481_CR29","doi-asserted-by":"crossref","unstructured":"Whang, J.J., Lenharth, A., Dhillon, I.S., Pingali, K.: Scalable data-driven pagerank: algorithms, system issues, and lessons learned. In: Euro-Par 2015: Parallel Processing\u201421st International Conference on Parallel and Distributed Computing, Vienna, Austria, August 24\u201328, 2015, Proceedings, pp. 438\u2013450 (2015)","DOI":"10.1007\/978-3-662-48096-0_34"},{"key":"481_CR30","doi-asserted-by":"crossref","unstructured":"Xin, R.S., Gonzalez, J.E., Franklin, M.J., Stoica, I.: Graphx: a resilient distributed graph system on spark. In: International Workshop on Graph Data Management Experiences and Systems. ACM (2013)","DOI":"10.1145\/2484425.2484427"},{"key":"481_CR31","unstructured":"Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J., McCauley, M., Franklin, M.J., Shenker, S., Stoica, I.: Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. In: Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation, NSDI\u201912, pp. 2\u20132, San Jose, CA (2012)"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-016-0481-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-016-0481-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-016-0481-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T22:27:56Z","timestamp":1568759276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-016-0481-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,28]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["481"],"URL":"https:\/\/doi.org\/10.1007\/s10766-016-0481-y","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2017,1,28]]}}}