{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T11:26:43Z","timestamp":1763724403025,"version":"3.37.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319672946"},{"type":"electronic","value":"9783319672953"}],"license":[{"start":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T00:00:00Z","timestamp":1510790400000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-67295-3_2","type":"book-chapter","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T07:36:44Z","timestamp":1510731404000},"page":"21-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Can Parallel Programming Revolutionize EDA Tools?"],"prefix":"10.1007","author":[{"given":"Yi-Shan","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keshav","family":"Pingali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"key":"2_CR1","volume-title":"Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors, in High Performance Computing, HiPC\u201905","author":"DA Bader","year":"2005","unstructured":"D.A. Bader, K. Madduri, Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors, in High Performance Computing, HiPC\u201905 (2005)"},{"volume-title":"Network Analysis: Methodological Foundations","year":"2005","key":"2_CR2","unstructured":"U. Brandes, T. Erlebach (eds.), Network Analysis: Methodological Foundations (Springer, Heidelberg, 2005)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"G. Bronevetsky, D. Marques, K. Pingali, P. Stodghill, C3: a system for automating application-level checkpointing of MPI programs. Languages and Compilers for Parallel Computing (Springer, New York, 2004), pp. 357\u2013373","DOI":"10.1007\/978-3-540-24644-2_23"},{"issue":"4","key":"2_CR4","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"KM Chandy","year":"1984","unstructured":"K.M. Chandy, J. Misra, The drinking philosophers problem. ACM Trans. Program. Lang. Syst. 6(4), 632\u2013646 (1984)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR5","isbn-type":"print","volume-title":"Direct Methods for Sparse Matrices","author":"IS Duff","year":"1986","unstructured":"I.S. Duff, A.M. Erisman, J.K. Reid, Direct Methods for Sparse Matrices (Oxford University Press, New York, 1986). ISBN 0-198-53408-6","ISBN":"https:\/\/id.crossref.org\/isbn\/0198534086"},{"issue":"5","key":"2_CR6","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF01407835","volume":"21","author":"P Feautrier","year":"1992","unstructured":"P. Feautrier, Some efficient solutions to the affine scheduling problem: one dimensional time. Int. J. Parallel Prog. 21(5), 313\u2013347 (1992)","journal-title":"Int. J. Parallel Prog."},{"key":"2_CR7","unstructured":"J.E. Gonzalez, Y. Low, H. Gu, D. Bickson, C. Guestrin, Powergraph: distributed graph-parallel computation on natural graphs, in Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201912, Berkeley, CA, 2012, pp. 17\u201330. USENIX Association. ISBN 978-1-931971-96-6. http:\/\/dl.acm.org\/citation.cfm?id=2387880.2387883"},{"key":"2_CR8","volume-title":"Deterministic multicore parallel routing for FPGAs, in International Conference on Field Programmable Technology (ICFPT\u201910)","author":"M Gort","year":"2010","unstructured":"M. Gort, J. Anderson, Deterministic multicore parallel routing for FPGAs, in International Conference on Field Programmable Technology (ICFPT\u201910) (2010)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"M.A. Hassaan, M. Burtscher, K. Pingali, Ordered vs unordered: a comparison of parallelism and work-efficiency in irregular algorithms, in Proceedings of the 16th ACM symposium on Principles and Practice of Parallel Programming, PPoPP \u201911 (ACM, New York, 2011), pp. 3\u201312. ISBN 978-1-4503-0119-0. doi:http:\/\/doi.acm.org\/10.1145\/1941553.1941557. http:\/\/iss.ices.utexas.edu\/Publications\/Papers\/ppopp016s-hassaan.pdf","DOI":"10.1145\/1941553.1941557"},{"key":"2_CR10","unstructured":"IWLS, IWLS 2005 benchmarks. http:\/\/iwls.org\/iwls2005\/benchmarks.html (2005)"},{"key":"2_CR11","volume-title":"An Introduction to Parallel Algorithms","author":"J JaJa","year":"1992","unstructured":"J. JaJa, An Introduction to Parallel Algorithms (Addison-Wesley, Boston, 1992)"},{"key":"2_CR12","unstructured":"R.M. Karp, V. Ramachandran, A survey of parallel algorithms for shared-memory machines. Technical Report UCB\/CSD-88-408, EECS Department, University of California, Berkeley (1988). http:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/1988\/5865.html"},{"volume-title":"Optimizing Compilers for Modern Architectures: A Dependence-Based Approach","year":"2001","key":"2_CR13","unstructured":"K. Kennedy, J. Allen (eds.) Optimizing Compilers for Modern Architectures: A Dependence-Based Approach (Morgan Kaufmann, San Francisco, 2001)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"I. Kodukula, N. Ahmed, K. Pingali, Data-centric multi-level blocking, in PLDI \u201997: Proceedings of the ACM SIGPLAN 1997 Conference on Programming Language Design and Implementation (ACM, New York, 1997), pp. 346\u2013357. ISBN 0-89791-907-6. doi:http:\/\/doi.acm.org\/10.1145\/258915.258946. http:\/\/iss.ices.utexas.edu\/Publications\/Papers\/PLDI1997.pdf","DOI":"10.1145\/258915.258946"},{"key":"2_CR15","isbn-type":"print","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/BFb0002751","volume-title":"A relational approach to the compilation of sparse matrix programs, in Euro-Par \u201997: Proceedings of the Third International Euro-Par Conference on Parallel Processing","author":"V Kotlyar","year":"1997","unstructured":"V. Kotlyar, K. Pingali, P. Stodghill, A relational approach to the compilation of sparse matrix programs, in Euro-Par \u201997: Proceedings of the Third International Euro-Par Conference on Parallel Processing (Springer, London, 1997), pp. 318\u2013327. ISBN 3-540-63440-1. http:\/\/iss.ices.utexas.edu\/Publications\/Papers\/EUROPAR1997.pdf","ISBN":"https:\/\/id.crossref.org\/isbn\/3540634401"},{"key":"2_CR16","volume-title":"Exploiting the commutativity lattice, in PLDI","author":"M Kulkarni","year":"2011","unstructured":"M. Kulkarni, D. Nguyen, D. Prountzos, X. Sui, K. Pingali, Exploiting the commutativity lattice, in PLDI (2011)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"J. Lee, W.-S. Han, R. Kasperovics, J.-H. Lee, An in-depth comparison of subgraph isomorphism algorithms in graph databases. Proc. VLDB Endow. 6(2), 133\u2013144 (2012). ISSN 2150-8097. doi:10.14778\/2535568.2448946. http:\/\/dx.doi.org\/10.14778\/2535568.2448946","DOI":"10.14778\/2535568.2448946"},{"issue":"8","key":"2_CR18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/MC.2015.229","volume":"48","author":"A Lenharth","year":"2015","unstructured":"A. Lenharth, K. Pingali, Scaling runtimes for irregular algorithms to large-scale NUMA systems. Computer 48(8), 35\u201344 (2015)","journal-title":"Computer"},{"key":"2_CR19","first-page":"209","volume-title":"Priority queues are not good concurrent priority schedulers, in European Conference on Parallel Processing","author":"A Lenharth","year":"2015","unstructured":"A. Lenharth, D. Nguyen, K. Pingali, Priority queues are not good concurrent priority schedulers, in European Conference on Parallel Processing (Springer, Berlin\/Heidelberg, 2015), pp. 209\u2013221"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"A. Lenharth, D. Nguyen, K. Pingali, Parallel graph analytics. Commun. ACM 59(5), 78\u201387 (2016). ISSN 0001-0782. doi:10.1145\/2901919. http:\/\/doi.acm.org\/10.1145\/2901919","DOI":"10.1145\/2901919"},{"issue":"1","key":"2_CR21","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/88.219857","volume":"1","author":"DB Loveman","year":"1993","unstructured":"D.B. Loveman, High performance fortran. IEEE Parallel Distrib. Technol. Syst. Appl. 1(1), 25\u201342 (1993)","journal-title":"IEEE Parallel Distrib. Technol. Syst. Appl."},{"key":"2_CR22","unstructured":"Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, J.M. Hellerstein, Graphlab: a new parallel framework for machine learning, in Conference on Uncertainty in Artificial Intelligence (UAI), July 2010"},{"key":"2_CR23","volume-title":"Information Theory, Inference and Learning Algorithms","author":"D Mackay","year":"2003","unstructured":"D. Mackay, Information Theory, Inference and Learning Algorithms (Cambridge University Press, Cambridge, 2003)"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"G. Malewicz, M.H. Austern, A.J. Bik, J.C. Dehnert, I. Horn, N. Leiser, G. Czajkowski, Pregel: a system for large-scale graph processing - \u201cabstract\u201d, in Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC \u201909 (ACM, New York, 2009), pp. 6\u20136 ISBN 978-1-60558-396-9. doi:10.1145\/1582716.1582723. http:\/\/doi.acm.org\/10.1145\/1582716.1582723","DOI":"10.1145\/1582716.1582723"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"M. Mendez-Lojo, A. Mathew, K. Pingali, Parallel inclusion-based points-to analysis, in Proceedings of the 24th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA\u201910), October 2010. http:\/\/iss.ices.utexas.edu\/Publications\/Papers\/oopsla10-mendezlojo.pdf","DOI":"10.1145\/1869459.1869495"},{"key":"2_CR26","isbn-type":"print","first-page":"393","volume-title":"Delta-stepping: a parallel single source shortest path algorithm, in Proceedings of the 6th Annual European Symposium on Algorithms, ESA \u201998","author":"U Meyer","year":"1998","unstructured":"U. Meyer, P. Sanders, Delta-stepping: a parallel single source shortest path algorithm, in Proceedings of the 6th Annual European Symposium on Algorithms, ESA \u201998 (Springer, London, 1998), pp. 393\u2013404. ISBN 3-540-64848-8. http:\/\/dl.acm.org\/citation.cfm?id=647908.740136","ISBN":"https:\/\/id.crossref.org\/isbn\/3540648488"},{"key":"2_CR27","unstructured":"J. Misra, Distributed discrete-event simulation. ACM Comput. Surv. 18(1), 39\u201365 (1986), ISSN 0360-0300. doi:http:\/\/doi.acm.org\/10.1145\/6462.6485"},{"key":"2_CR28","volume-title":"Parallel FPGA routing based on the operator formulation, in Proceedings of the 51st Annual Design Automation Conference, DAC \u201914","author":"YOM Moctar","year":"2014","unstructured":"Y.O.M. Moctar, P. Brisk, Parallel FPGA routing based on the operator formulation, in Proceedings of the 51st Annual Design Automation Conference, DAC \u201914 (2014)."},{"key":"2_CR29","volume-title":"Data-driven versus topology-driven irregular computations on GPUs, in Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium, IPDPS \u201913","author":"R Nasre","year":"2013","unstructured":"R. Nasre, M. Burtscher, K. Pingali, Data-driven versus topology-driven irregular computations on GPUs, in Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium, IPDPS \u201913 (Springer, London, 2013)"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"D. Nguyen, K. Pingali, Synthesizing concurrent schedulers for irregular algorithms, in Proceedings of International Conference Architectural Support for Programming Languages and Operating Systems, ASPLOS \u201911, pp. 333\u2013344 (2011). ISBN 978-1-4503-0266-1. doi:10.1145\/1950365.1950404. http:\/\/doi.acm.org\/10.1145\/1950365.1950404","DOI":"10.1145\/1950365.1950404"},{"key":"2_CR31","isbn-type":"print","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1145\/2517349.2522739","volume-title":"A lightweight infrastructure for graph analytics, in Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP \u201913","author":"D Nguyen","year":"2013","unstructured":"D. Nguyen, A. Lenharth, K. Pingali, A lightweight infrastructure for graph analytics, in Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP \u201913 (ACM, New York, 2013), pp. 456\u2013471. ISBN 978-1-4503-2388-8. doi:10.1145\/2517349.2522739. http:\/\/doi.acm.org\/10.1145\/2517349.2522739","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450323888"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"R.W. Numrich, J. Reid, Co-array fortran for parallel programming, in ACM Sigplan Fortran Forum, vol. 17 (ACM, New York, 1998), pp. 1\u201331","DOI":"10.1145\/289918.289920"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"K. Pingali, D. Nguyen, M. Kulkarni, M. Burtscher, M.A. Hassaan, R. Kaleem, T.-H. Lee, A. Lenharth, R. Manevich, M. M\u00e9ndez-Lojo, D. Prountzos, X. Sui, The TAO of parallelism in algorithms, in Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI \u201911, pp. 12\u201325 (2011). ISBN 978-1-4503-0663-8. doi:10.1145\/1993498.1993501. http:\/\/doi.acm.org\/10.1145\/1993498.1993501","DOI":"10.1145\/1993498.1993501"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"D. Prountzos, R. Manevich, K. Pingali, K.S. McKinley, A shape analysis for optimizing parallel graph programs, in Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201911 (ACM, New York, 2011), pp. 159\u2013172. ISBN 978-1-4503-0490-0. doi:http:\/\/doi.acm.org\/10.1145\/1926385.1926405. http:\/\/www.cs.utexas.edu\/users\/dprountz\/popl2011.pdf","DOI":"10.1145\/1926385.1926405"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"J.R. Shewchuk, Triangle: engineering a 2D quality mesh generator and delaunay triangulator, in Applied Computational Geometry: Towards Geometric Engineering, ed. by M.C. Lin, D. Manocha. Lecture Notes in Computer Science, vol. 1148 (Springer, Berlin, 1996), pp. 203\u2013222. From the First ACM Workshop on Applied Computational Geometry","DOI":"10.1007\/BFb0014497"},{"key":"2_CR36","volume-title":"Ligra: a lightweight graph processing framework for shared memory, in Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP, pp 135\u2013146","author":"J Shun","year":"2013","unstructured":"J. Shun, G.E. Blelloch, Ligra: a lightweight graph processing framework for shared memory, in Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP, pp 135\u2013146 (2013)"},{"volume-title":"Introduction to Data Mining","year":"2005","key":"2_CR37","unstructured":"P.-N. Tan, M. Steinbach, V. Kumar (eds.), Introduction to Data Mining (Pearson Addison Wesley, Boston, 2005)"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"J.R. Ullmann, Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. J. Exp. Algorithm. 15, 1.6:1.1\u20131.6:1.64 (2011) ISSN 1084-6654. doi:10.1145\/1671970.1921702. http:\/\/doi.acm.org\/10.1145\/1671970.1921702","DOI":"10.1145\/1671970.1921702"},{"key":"2_CR39","unstructured":"L.G. Valiant, A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990). ISSN 0001-0782. doi:http:\/\/doi.acm.org\/10.1145\/79173.79181"},{"key":"2_CR40","isbn-type":"print","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/223982.223990","volume-title":"The splash-2 programs: characterization and methodological considerations, in Proceedings of the 22nd Annual International Symposium on Computer Architecture, ISCA \u201995","author":"SC Woo","year":"1995","unstructured":"S.C. Woo, M. Ohara, E. Torrie, J.P. Singh, A. Gupta, The splash-2 programs: characterization and methodological considerations, in Proceedings of the 22nd Annual International Symposium on Computer Architecture, ISCA \u201995 (ACM, New York, 1995), pp. 24\u201336. ISBN 0-89791-698-0. doi:10.1145\/223982.223990. http:\/\/doi.acm.org\/10.1145\/223982.223990","ISBN":"https:\/\/id.crossref.org\/isbn\/0897916980"}],"container-title":["Advanced Logic Synthesis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67295-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T01:19:07Z","timestamp":1570324747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67295-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,16]]},"ISBN":["9783319672946","9783319672953"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67295-3_2","relation":{},"subject":[],"published":{"date-parts":[[2017,11,16]]}}}