{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:48:50Z","timestamp":1750308530441,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,3,29]],"date-time":"2015-03-29T00:00:00Z","timestamp":1427587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1320585"],"award-info":[{"award-number":["CCF-1320585"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,3,29]]},"DOI":"10.1145\/2717764.2717771","type":"proceedings-article","created":{"date-parts":[[2015,3,12]],"date-time":"2015-03-12T12:18:15Z","timestamp":1426162695000},"page":"103-110","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Accelerated Path-Based Timing Analysis with MapReduce"],"prefix":"10.1145","author":[{"given":"Tsung-Wei","family":"Huang","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA"}]},{"given":"Martin D.F.","family":"Wong","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,3,29]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Apache Hadoop: http:\/\/hadoop.apache.org\/.  Apache Hadoop: http:\/\/hadoop.apache.org\/."},{"key":"e_1_3_2_1_2_1","unstructured":"MapReduce MPI Library: http:\/\/mapreduce.sandia.gov\/.  MapReduce MPI Library: http:\/\/mapreduce.sandia.gov\/."},{"key":"e_1_3_2_1_3_1","unstructured":"OpenMP: http:\/\/openmp.org\/wp\/.  OpenMP: http:\/\/openmp.org\/wp\/."},{"key":"e_1_3_2_1_4_1","unstructured":"POSIX\n  : https:\/\/computing.llnl.gov\/.  POSIX: https:\/\/computing.llnl.gov\/."},{"key":"e_1_3_2_1_5_1","first-page":"8434040","author":"Bhardwaj S.","year":"2013","unstructured":"S. Bhardwaj , K. Rahmat , and K. Kucukcakar , ''Clock-Reconvergence Pessimism Removal in Hierarchical Static Timing Analysis,\" US patent 8434040 , 2013 . S. Bhardwaj, K. Rahmat, and K. Kucukcakar, ''Clock-Reconvergence Pessimism Removal in Hierarchical Static Timing Analysis,\" US patent 8434040, 2013.","journal-title":"''Clock-Reconvergence Pessimism Removal in Hierarchical Static Timing Analysis,\" US patent"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1611282"},{"key":"e_1_3_2_1_7_1","volume-title":"Efficient exhaustive path-based static timing analysis using a fast estimation technique,\" US patent 8079004","author":"Cristian S.","year":"2009","unstructured":"S. Cristian , N. H. Rachid , and R. Khalid , '' Efficient exhaustive path-based static timing analysis using a fast estimation technique,\" US patent 8079004 , 2009 . S. Cristian, N. H. Rachid, and R. Khalid, ''Efficient exhaustive path-based static timing analysis using a fast estimation technique,\" US patent 8079004, 2009."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2560519.2565876"},{"key":"e_1_3_2_1_10_1","volume-title":"UI-Timer: An Ultra-Fast Clock Network Pessimism Removal Algorithm,\" Proc","author":"Huang T.-W.","year":"2014","unstructured":"T.-W. Huang , P.-C. Wu , and M. D. F. Wong , '' UI-Timer: An Ultra-Fast Clock Network Pessimism Removal Algorithm,\" Proc . IEEE\/ACM ICCAD , 2014 . T.-W. Huang, P.-C. Wu, and M. D. F. Wong, ''UI-Timer: An Ultra-Fast Clock Network Pessimism Removal Algorithm,\" Proc. IEEE\/ACM ICCAD, 2014."},{"key":"e_1_3_2_1_11_1","volume-title":"Sign Off Quality Hierarchical Timing Constraints: Wishful Thinking or Reality?\" TAU workshop","author":"Levitsky O.","year":"2014","unstructured":"O. Levitsky , '' Sign Off Quality Hierarchical Timing Constraints: Wishful Thinking or Reality?\" TAU workshop , 2014 . O. Levitsky, ''Sign Off Quality Hierarchical Timing Constraints: Wishful Thinking or Reality?\" TAU workshop, 2014."},{"key":"e_1_3_2_1_12_1","volume-title":"EDA Vendors should Improve the Runtime Performance of Path-Based Timing Analysis,\" Electronic Design","author":"Molina R.","year":"2013","unstructured":"R. Molina , '' EDA Vendors should Improve the Runtime Performance of Path-Based Timing Analysis,\" Electronic Design , 2013 . R. Molina, ''EDA Vendors should Improve the Runtime Performance of Path-Based Timing Analysis,\" Electronic Design, 2013."}],"event":{"name":"ISPD'15: International Symposium on Physical Design","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Monterey California USA","acronym":"ISPD'15"},"container-title":["Proceedings of the 2015 Symposium on International Symposium on Physical Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2717764.2717771","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2717764.2717771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:55:53Z","timestamp":1750272953000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2717764.2717771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,29]]},"references-count":12,"alternative-id":["10.1145\/2717764.2717771","10.1145\/2717764"],"URL":"https:\/\/doi.org\/10.1145\/2717764.2717771","relation":{},"subject":[],"published":{"date-parts":[[2015,3,29]]},"assertion":[{"value":"2015-03-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}