{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:40:26Z","timestamp":1743032426675,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038582"},{"type":"electronic","value":"9783319038599"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03859-9_35","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:54:34Z","timestamp":1386593674000},"page":"402-415","source":"Crossref","is-referenced-by-count":1,"title":["Character of Graph Analysis Workloads and Recommended Solutions on Future Parallel Systems"],"prefix":"10.1007","author":[{"given":"Noboru","family":"Tanabe","sequence":"first","affiliation":[]},{"given":"Sonoko","family":"Tomimori","sequence":"additional","affiliation":[]},{"given":"Masami","family":"Takata","sequence":"additional","affiliation":[]},{"given":"Kazuki","family":"Joe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the Web. Technical Report Stanford Digital Library Working Paper SIDL-WP-1999-0120, Stanford University (1999)"},{"key":"35_CR2","unstructured":"Graph500, \n                      http:\/\/www.graph500.org\/"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Dally, W.J.: Power, Programmability, and Granularity: The Challenges of ExaScale Computing. In: IPDPS 2011 Keynote (2011), \n                      http:\/\/techtalks.tv\/talks\/keynote-power-programmability-and-granularity-the-challenges-of-exascale-computing\/54110\/","DOI":"10.1109\/TEST.2011.6139189"},{"key":"35_CR4","unstructured":"Hadoop, \n                      http:\/\/hadoop.apache.org\/"},{"key":"35_CR5","unstructured":"Memcached, \n                      http:\/\/memcached.org\/"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: PEGASUS: A Peta-Scale Graph Mining System - Implementation and Observations. In: International Conference on Data Mining, pp. 229\u2013238 (2009)","DOI":"10.1109\/ICDM.2009.14"},{"key":"35_CR7","unstructured":"Micron Technology, Hybrid Memory Cube: Breakthrough DRAM Performance with a Fundamentally Re-Architected DRAM Subsystem. HotChips 23 (2011)"},{"key":"35_CR8","unstructured":"Hybrid Memory Cube Consortium, \n                      http:\/\/hybridmemorycube.org\/"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Tanabe, N., Nuttapon, B., Nakajo, H., Ogawa, Y., Kogou, J., Takata, M., JoeF, K.: A memory accelerator with gather functions for bandwidth-bound irregular applications C. In: Proceedings of the First Workshop on Irregular Applications: Architectures and Algorithm (IAAA 2011) in Conjunction with SC 2011, pp. 35\u201342 (2011)","DOI":"10.1145\/2089142.2089152"},{"key":"35_CR10","unstructured":"Tanabe, N., Kogou, J., Tomimori, S., Takata, M., Joe, K.: Future Irregular Computing with Memory Accelerators. In: FUTURE COMPUTING 2013, pp. 74\u201380 (2013)"},{"key":"35_CR11","unstructured":"Tanabe, N., Tomimori, S., Takata, M., Joe, K.: Locality Analysis for Characterizing Applications Based on Sparse Matrices. In: International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2013 (2013)"},{"issue":"4","key":"35_CR12","doi-asserted-by":"crossref","first-page":"231","DOI":"10.14778\/1938545.1938548","volume":"4","author":"X. Yang","year":"2011","unstructured":"Yang, X., et al.: Fast sparse matrix-vector multiplication on GPUs: implications for graph mining. Proc. VLDB Endowment\u00a04(4), 231\u2013242 (2011)","journal-title":"Proc. VLDB Endowment"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Ueno, K., Suzumura, T.: Highly Scalable Graph Search for the Graph500 Benchmark. In: 21st International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC 2012), June 2012, pp. 149\u2013160 (2012)","DOI":"10.1145\/2287076.2287104"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Suzumura, T., et al.: \u201cPerformance Evaluation of Graph500 on Large-Scale Distributed Environment. In: IEEE IISWC 2011 (November 2011)","DOI":"10.1109\/IISWC.2011.6114175"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Seiler, L., et al.: Larrabee: A Many.Core x86 Architecture for Visual Computing. ACM Trans. Graph. 27(3), Article 18 (August 2008)","DOI":"10.1145\/1360612.1360617"},{"key":"35_CR16","unstructured":"Intel: Intel\u00aeXeon\u00aePhiTMCoprocessor Data sheet (November 2012)"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Tanabe, N., Ogawa, C.Y., Takata, C.M., Joe, C.K.: Scaleable Sparse Matrix-Vector Multiplication with Functional Memory and GPUs. In: 19th Euromicro Conference on Parallel, Distributed and Network-Based Computing (PDP 2011), pp. 101\u2013108 (2011)","DOI":"10.1109\/PDP.2011.92"},{"issue":"2","key":"35_CR18","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/MM.2010.36","volume":"30","author":"T.M. Brewer","year":"2010","unstructured":"Brewer, T.M.: Instruction Set Innovations for the Convey HC-1 Computer. IEEE Micro\u00a030(2), 70\u201379 (2010)","journal-title":"IEEE Micro"},{"issue":"3","key":"35_CR19","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s11227-009-0373-7","volume":"51","author":"N. Tanabe","year":"2009","unstructured":"Tanabe, N., Hakozaki, H., Dohi, Y., Luo, Z., Nakajo, H.: An enhancer of memory and network for applications with large-capacity data and non-continuous data accessing. The Journal of Supercomputing\u00a051(3), 279\u2013309 (2009)","journal-title":"The Journal of Supercomputing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03859-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T09:26:12Z","timestamp":1676366772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03859-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038582","9783319038599"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03859-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}