{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T04:27:01Z","timestamp":1726028821119},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030049171"},{"type":"electronic","value":"9783030049188"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-04918-8_8","type":"book-chapter","created":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T06:05:44Z","timestamp":1552889144000},"page":"125-136","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tumbling Down the GraphBLAS Rabbit Hole with SHMEM"],"prefix":"10.1007","author":[{"given":"Curtis","family":"Hughey","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,19]]},"reference":[{"key":"8_CR1","unstructured":"Bulu\u00e7, A., Mattson, T., McMillan, S., Moreira, J., Yang, C.: The GraphBLAS C API specification. \n https:\/\/people.eecs.berkeley.edu\/~aydin\/GraphBLAS_API_C.pdf\n \n . Accessed 6 July 2018"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Mattson, T., McMillan, S., Moreira, J., Yang, C.: Design of the GraphBLAS API for C. In: 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, pp. 643\u2013652. IEEE, Orlando (2017)","DOI":"10.1109\/IPDPSW.2017.117"},{"key":"8_CR3","unstructured":"Kepner, J.: GraphBLAS Mathematics - Provisional Release 1.0 -. \n https:\/\/www.mit.edu\/~kepner\/GraphBLAS\/GraphBLAS-Math-release.pdf\n \n . Accessed 6 July 2018"},{"key":"8_CR4","first-page":"287","volume":"22","author":"A Bulu\u00e7","year":"2011","unstructured":"Bulu\u00e7, A., Gilbert, J.R., Shah, V.B.: Implementing sparse matrices for graph algorithms. SIAM J. Sci. Comput. 22, 287\u2013314 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"8_CR5","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/0047-2484(92)90081-J","volume":"22","author":"RIM Dunbar","year":"1992","unstructured":"Dunbar, R.I.M.: Neocortex size as a constraint on group size in primates. J. Hum. Evol. 22(6), 469\u2013493 (1992)","journal-title":"J. Hum. Evol."},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1145\/355841.355847","volume":"5","author":"CL Lawson","year":"1979","unstructured":"Lawson, C.L., Hanson, R.J., Kincaid, D.R., Krough, F.T.: Basic linear algebra subprograms for FORTRAN usage. ACM Trans. Math. Softw. 5(2), 308\u2013323 (1979)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/567806.567810","volume":"28","author":"I Duff","year":"2002","unstructured":"Duff, I., Heroux, M., Pozo, R.: An overview of the sparse basic linear algebra subprograms: the new standard from the BLAS technical forum. ACM Trans. Math. Softw. 28(2), 239\u2013267 (2002)","journal-title":"ACM Trans. Math. Softw."},{"key":"8_CR8","unstructured":"OpenSHMEM application programming interface. \n http:\/\/www.openshmem.org\/site\/sites\/default\/site_files\/OpenSHMEM-1.3.pdf\n \n . Accessed 6 July 2018"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0065-2458(08)00005-3","volume":"72","author":"JR Gilbert","year":"2008","unstructured":"Gilbert, J.R., Reinhardt, S., Shah, V.B.: Distributed sparse matrices for very high level languages. Adv. Comput. 72, 225\u2013252 (2008)","journal-title":"Adv. Comput."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: Challenges and advances in parallel sparse matrix-matrix multiplication. In: 2008 37th International Conference on Parallel Processing, pp. 503\u2013510. IEEE, Portland (2008)","DOI":"10.1109\/ICPP.2008.45"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: On the representation and multiplication of hyperspace matrices. In: 2008 IEEE International Symposium on Parallel and Distributed Processing, IEEE, Miami (2008)","DOI":"10.1109\/IPDPS.2008.4536313"},{"issue":"3","key":"8_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1080\/00029890.1988.11971991","volume":"25","author":"R Lidl","year":"1998","unstructured":"Lidl, R., Mullen, G.L.: When does a polynomial over a finite field permute the elements of that field? Am. Math. Mon. 25(3), 243\u2013246 (1998)","journal-title":"Am. Math. Mon."},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/110848244","volume":"32","author":"A Bulu\u00e7","year":"2011","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: Parallel sparse matrix-matrix multiplication and indexing: implementation and experiments. SIAM J. Sci. Comput. 32(4), 170\u2013191 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/0613024","volume":"13","author":"JR Gilbert","year":"1992","unstructured":"Gilbert, J.R., Moler, C., Schreiber, R.: Sparse matrices in MATLAB: design and implementation. SIAM J. Matrix Anal. Appl. 13(1), 333\u2013356 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Gustavson, F.G.: Finding the block lower triangular form of a matrix. In: Bunch, J.R., Rose, D.J. (eds.) Sparse Matrix Computations, pp. 275\u2013289. Academic Press (1976)","DOI":"10.1016\/B978-0-12-141050-6.50021-0"},{"issue":"4","key":"8_CR16","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_CR17","doi-asserted-by":"crossref","unstructured":"Satish, N., et al.: Navigating the maze of graph analytics frameworks using massive graph datasets. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1\u201312. Snowbird (2014)","DOI":"10.1145\/2588555.2610518"},{"key":"8_CR18","unstructured":"Murphy, R., Bader, D., Snir, M.: Unveiling the first graph 500 list. In: International Conference for High Performance Computing, Networking, Storage and Analysis, New Orleans (2010)"},{"key":"8_CR19","unstructured":"Graph500. \n https:\/\/graph500.org\/\n \n . Accessed 6 July 2018"},{"key":"8_CR20","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: Proceedings of the SIAM Conference on Data Mining, Lake Buena Vista (2014)"}],"container-title":["Lecture Notes in Computer Science","OpenSHMEM and Related Technologies. OpenSHMEM in the Era of Extreme Heterogeneity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04918-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T05:15:38Z","timestamp":1558329338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-04918-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030049171","9783030049188"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04918-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OpenSHMEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on OpenSHMEM and Related Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Baltimore, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"openshmem2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.csm.ornl.gov\/workshops\/openshmem2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}