{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:36:43Z","timestamp":1762177003098,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319586663"},{"type":"electronic","value":"9783319586670"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58667-0_6","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T15:27:38Z","timestamp":1494516458000},"page":"97-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["EvoGraph: On-the-Fly Efficient Mining of Evolving Graphs on GPU"],"prefix":"10.1007","author":[{"given":"Dipanjan","family":"Sengupta","sequence":"first","affiliation":[]},{"given":"Shuaiwen Leon","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Luk, C.-K., Hong, S., Kim, H.: Qilin: exploiting parallelism on heterogeneous multiprocessors with adaptive mapping. In: Proceedings of MICRO 2009. ACM (2009)","DOI":"10.1145\/1669112.1669121"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Tarditi, D., Puri, S., Oglesby, J.: Accelerator: using data parallelism to program GPUs for general-purpose uses. SIGOPS Oper. Syst. Rev. 40(5) (2006)","DOI":"10.1145\/1168917.1168898"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Sengupta, D., et al.: Scheduling multi-tenant cloud workloads on accelerator-based systems. In: Proceedings of the SC 2014. IEEE Press (2014)","DOI":"10.1109\/SC.2014.47"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Sengupta, D., Belapure, R., Schwan, K.: Multi-tenancy on GPGPU-based servers. In: Proceedings of the VTDC 2013. ACM (2013)","DOI":"10.1145\/2465829.2465830"},{"key":"6_CR5","unstructured":"Top 500 List. http:\/\/www.top500.org\/system\/177975"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Fu, Z., et al.: Mapgraph: a high level API for fast development of high performance graph analytics on GPUs. In: GRADES 2014. ACM (2014)","DOI":"10.1145\/2621934.2621936"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Khorasani, F., Vora, K., Gupta, R., Bhuyan, L.N.: Cusha: vertex-centric graph processing on GPUs. In: Proceedings of HPDC 2014. ACM (2014)","DOI":"10.1145\/2600212.2600227"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Sengupta, D., Song, S.L., et al.: Graphreduce: processing large-scale graphs on accelerator-based systems. In: Proceedings of the SC 2015. ACM (2015)","DOI":"10.1109\/IPDPSW.2015.16"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Sengupta, D., et al.: Graphreduce: large-scale graph analytics on accelerator-based HPC systems. In: IEEE IPDPSW (2015)","DOI":"10.1145\/2807591.2807655"},{"issue":"12","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.14778\/2824032.2824077","volume":"8","author":"A Ching","year":"2015","unstructured":"Ching, A., Edunov, S., Kabiljo, M., et al.: One trillion edges: graph processing at facebook-scale. Proc. VLDB Endow. 8(12), 1804\u20131815 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"6_CR11","unstructured":"Twitter Statistics. http:\/\/tinyurl.com\/kcuhdcw"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Han, W., Miao, Y., Li, K., et al.: Chronos: a graph engine for temporal graph analysis. EuroSys (2014)","DOI":"10.1145\/2592798.2592799"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Sun, J., Faloutsos, C., Papadimitriou, S., Yu, P.S.: Graphscope: parameter-free mining of large time-evolving graphs, KDD 2007. ACM (2007)","DOI":"10.1145\/1281192.1281266"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Fard, A., Abdolrashidi, A., Ramaswamy, L., Miller, J.: Towards efficient query processing on massive time-evolving graphs. In: CollaborateCom, October 2012","DOI":"10.4108\/icst.collaboratecom.2012.250532"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., et al.: Pregel: a system for large-scale graph processing, SIGMOD 2010. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"6_CR16","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., et al.: Powergraph: distributed graph-parallel computation on natural graphs. In: OSDI 2012. USENIX, Hollywood (2012)"},{"key":"6_CR17","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., et al.: Distributed graphlab: a framework for machine learning and data mining in the cloud. Proc. VLDB Endow. 5, 716\u2013727 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"6_CR18","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: Graphchi: large-scale graph computation on just a PC. In: OSDI 2012. USENIX Association, Berkeley (2012)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Roy, A., Mihailovic, I., Zwaenepoel, W.: X-stream: edge-centric graph processing using streaming partitions. In: SOSP 2013. ACM (2013)","DOI":"10.1145\/2517349.2522740"},{"key":"6_CR20","unstructured":"Bell, N., Garland, M.: Efficient sparse matrix-vector multiplication on CUDA. NVIDIA Corporation, NVIDIA Technical report NVR-2008-004, December 2008"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Ediger, D., Jiang, K., Riedy, J., Bader, D.: Massive streaming data analytics: a case study with clustering coefficients. In: IPDPSW 2010, pp. 1\u20138, April 2010","DOI":"10.1109\/IPDPSW.2010.5470687"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"McColl, R., Green, O., Bader, D.: A new parallel algorithm for connected components in dynamic graphs. In: HiPC, December 2013","DOI":"10.1109\/HiPC.2013.6799108"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Ediger, D., Riedy, J., Bader, D., Meyerhenke, H.: Tracking structure of streaming social networks. In: IPDPSW 2011, May 2011","DOI":"10.1109\/IPDPS.2011.326"},{"key":"6_CR24","volume-title":"GraphIn: An Online High Performance Incremental Graph Processing Framework","author":"D Sengupta","year":"2016","unstructured":"Sengupta, D., et al.: GraphIn: An Online High Performance Incremental Graph Processing Framework. Springer International Publishing, Cham (2016)"},{"key":"6_CR25","unstructured":"System design principles for heterogeneous resource management and scheduling in accelerator-based systems (2016). http:\/\/hdl.handle.net\/1853\/55607"},{"key":"6_CR26","unstructured":"CUDA 7.0. https:\/\/developer.nvidia.com\/cuda-downloads\/"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest-path problem. J. Algorithms, 21(2) (1996)","DOI":"10.1006\/jagm.1996.0046"},{"issue":"11","key":"6_CR28","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.14778\/2809974.2809983","volume":"8","author":"N Sundaram","year":"2015","unstructured":"Sundaram, N., Satish, N., Patwary, M.M.A., et al.: Graphmat: high performance graph analytics made productive. Proc. VLDB Endow. 8(11), 1214\u20131225 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Ediger, D., McColl, R., Riedy, J., Bader, D.: Stinger: high performance data structure for streaming graphs. In: HPEC, September 2012","DOI":"10.1109\/HPEC.2012.6408680"},{"key":"6_CR30","unstructured":"BlazeGraph. https:\/\/www.blazegraph.com\/"},{"key":"6_CR31","unstructured":"University of Florida Sparse Matrix Collection. http:\/\/tinyurl.com\/hh8g3n9"},{"key":"6_CR32","unstructured":"Murphy, R.C., Wheeler, K., Barrett, B., Ang, J.A.: Introducing the graph 500. In: Cray User\u2019s Group (CUG) (2010)"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Sengupta, D., et al.: A framework for emulating non-volatile memory systems with different performance characteristics. In: Proceedings of the ICPE 2015. ACM (2015)","DOI":"10.1145\/2668930.2695529"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Feng, G., Meng, X., Ammar, K.: Distinger: a distributed graph data structure for massive dynamic graph processing. In: Big Data. IEEE (2015)","DOI":"10.1109\/BigData.2015.7363954"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58667-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T13:04:55Z","timestamp":1638882295000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58667-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319586663","9783319586670"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58667-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"12 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}