{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T19:10:10Z","timestamp":1749928210667,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319527086"},{"type":"electronic","value":"9783319527093"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-52709-3_18","type":"book-chapter","created":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T12:13:25Z","timestamp":1485173605000},"page":"235-249","source":"Crossref","is-referenced-by-count":1,"title":["LightHouse: An Automatic Code Generator for Graph Algorithms on GPUs"],"prefix":"10.1007","author":[{"given":"G.","family":"Shashidhar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupesh","family":"Nasre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,24]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Madduri, K.: Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In: ICPP 2006, pp. 523\u2013530 (2006)","DOI":"10.1109\/ICPP.2006.34"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Madduri, K.: Parallel breadth-first search on distributed memory systems. In: SC 2011, pp. 65:1\u201365:12. ACM (2011)","DOI":"10.1145\/2063384.2063471"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Burtscher, M., Nasre, R., Pingali, K.: A quantitative study of irregular programs on GPUs. In: IISWC 2012, pp. 141\u2013151. IEEE Computer Society (2012)","DOI":"10.1109\/IISWC.2012.6402918"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Checconi, F., Petrini, F., Willcock, J., Lumsdaine, A., Choudhury, A.R., Sabharwal, Y.: Breaking the speed, scalability barriers for graph exploration on distributed-memory machines. In: SC 2012, pp. 13:1\u201313:12 (2012)","DOI":"10.1109\/SC.2012.25"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Gharaibeh, A., Costa, L.B., Santos-Neto, E., Ripeanu, M.: A yoke of oxen and a thousand chickens for heavy lifting graph processing. In: PACT 2012 (2012)","DOI":"10.1145\/2370816.2370866"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Hong, S., Chafi, H., Sedlar, E., Olukotun, K.: Green-Marl: a DSL for easy and efficient graph analysis. In: ASPLOS 2012, pp. 349\u2013362 ACM (2012)","DOI":"10.1145\/2150976.2151013"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Jablin, T.B., Jablin, J.A., Prabhu, P., Liu, F., August, D.I.: Dynamically managed data for CPU-GPU architectures. In: CGO 2012. ACM (2012)","DOI":"10.1145\/2259016.2259038"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Kulkarni, M., Burtscher, M., Inkulu, R., Pingali, K., Cas\u00e7aval, C.: How much parallelism is there in irregular applications? In: PPoPP 2009, pp. 3\u201314 (2009)","DOI":"10.1145\/1594835.1504181"},{"issue":"1","key":"18_CR9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/1353534.1346311","volume":"36","author":"M Kulkarni","year":"2008","unstructured":"Kulkarni, M., Pingali, K., Ramanarayanan, G., Walter, B., Bala, K., Chew, L.P.: Optimistic parallelism benefits from data partitioning. SIGARCH Comput. Archit. News 36(1), 233\u2013243 (2008)","journal-title":"SIGARCH Comput. Archit. News"},{"issue":"6","key":"18_CR10","first-page":"211","volume":"42","author":"M Kulkarni","year":"2007","unstructured":"Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., Chew, L.P.: Optimistic parallelism requires abstractions. PLDI 42(6), 211\u2013222 (2007)","journal-title":"PLDI"},{"key":"18_CR11","unstructured":"Leskovec, J., Sosi\u010d, R.: SNAP: a general purpose network analysis and graph mining library in C++, June 2014. http:\/\/snap.stanford.edu\/snap"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Madduri, K., Bader, D., Berry, J., Crobak, J.: An experimental study of a parallel shortest path algorithm for solving large-scale graph instances. In: ALENEX (2007)","DOI":"10.1137\/1.9781611972870.3"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Nasre, R., Burtscher, M., Pingali, K.: Morph algorithms on GPUs. In: PPoPP 2013. ACM (2013)","DOI":"10.1145\/2442516.2442531"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Pearce, R., Gokhale, M., Amato, N.M.: Multithreaded asynchronous graph traversal for in-memory and semi-external memory. In: SC 2010, pp. 1\u201311 (2010)","DOI":"10.1109\/SC.2010.34"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M.A., Kaleem, R., Lee, T.-H., Lenharth, A., Manevich, R., M\u00e9ndez-Lojo, M., Prountzos, D., Sui, X.: The tao of parallelism in algorithms. In: PLDI 2011, pp. 12\u201325. ACM (2011)","DOI":"10.1145\/1993498.1993501"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Prountzos, D., Manevich, R., Pingali, K.: Elixir: a system for synthesizing concurrent graph programs. In: OOPSLA 2012, pp. 375\u2013394. ACM (2012)","DOI":"10.1145\/2384616.2384644"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Prountzos, D., Manevich, R., Pingali, K.: Synthesizing parallel graph programs via automated planning. In: PLDI, pp. 533\u2013544. ACM (2015)","DOI":"10.1145\/2737924.2737953"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Ragan-Kelley, J., Barnes, C., Adams, A., Paris, S., Durand, F., Amarasinghe, S.: Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines. In: PLDI 2013, pp. 519\u2013530. ACM (2013)","DOI":"10.1145\/2491956.2462176"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Ligra: A lightweight graph processing framework for shared memory. In: PPoPP, pp. 135\u2013146. ACM (2013)","DOI":"10.1145\/2442516.2442530"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Venkat, A., Shantharam, M., Hall, M., Strout, M.M.: Non-affine extensions to polyhedral code generation. In: Proceedings of Annual IEEE\/ACM International Symposium on Code Generation, Optimization, CGO 2014, pp. 185:185\u2013185:194. ACM, New York (2014)","DOI":"10.1145\/2581122.2544141"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Xiao, S., Feng, W.: Inter-block GPU communication via fast barrier synchronization. In: IPDPS, pp. 1\u201312. IEEE (2010)","DOI":"10.1109\/IPDPS.2010.5470477"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Yoo, A., Chow, E., Henderson, K., McLendon, W., Hendrickson, B., Catalyurek, U.: A scalable distributed parallel breadth-first search algorithm on blueGene\/L. In: ICS, p. 25. IEEE Computer Society (2005)","DOI":"10.1109\/SC.2005.4"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, E.Z., Jiang, Y., Guo, Z., Tian, K., Shen, X.: On-the-fly elimination of dynamic irregularities for GPU computing. In: ASPLOS. ACM (2011)","DOI":"10.1145\/1950365.1950408"},{"issue":"6","key":"18_CR24","doi-asserted-by":"crossref","first-page":"1543","DOI":"10.1109\/TPDS.2013.111","volume":"25","author":"J Zhong","year":"2014","unstructured":"Zhong, J., He, B.: Medusa: simplified graph processing on GPUs. IEEE Trans. Parallel Distrib. Syst. 25(6), 1543\u20131552 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-52709-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T18:45:07Z","timestamp":1749926707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-52709-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319527086","9783319527093"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-52709-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}