{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:28Z","timestamp":1750306768384,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T00:00:00Z","timestamp":1374537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,7,23]]},"DOI":"10.1145\/2486159.2486192","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"164-175","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["HEX"],"prefix":"10.1145","author":[{"given":"Danny","family":"Dolev","sequence":"first","affiliation":[{"name":"Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"F\u00fcgger","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Lenzen","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Perner","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Schmid","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,23]]},"reference":[{"issue":"3","key":"e_1_3_2_1_1_1","first-page":"83","volume":"6","author":"Bhamidipati R.","year":"2002","unstructured":"R. Bhamidipati , A. Zaidi , S. Makineni , K. Low , R. Chen , K.-Y. Liu , and J. Dalgrehn . Challenges and Methodologies for Implementing High-Performance Network Processors. Intel Technology Journal , 6 ( 3 ): 83 -- 92 , 2002 . R. Bhamidipati, A. Zaidi, S. Makineni, K. Low, R. Chen, K.-Y. Liu, and J. Dalgrehn. Challenges and Methodologies for Implementing High-Performance Network Processors. Intel Technology Journal, 6(3):83--92, 2002.","journal-title":"Challenges and Methodologies for Implementing High-Performance Network Processors. Intel Technology Journal"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.766819"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2050613.2050627"},{"volume-title":"US2004108876","author":"Fairbanks S.","key":"e_1_3_2_1_6_1","unstructured":"S. Fairbanks . Method and Apparatus for a Distributed Clock Generator, 2004. US patent no . US2004108876 . S. Fairbanks. Method and Apparatus for a Distributed Clock Generator, 2004. US patent no. US2004108876."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASYNC.2005.29"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.929649"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/EDCC.2010.35"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0151-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.881199"},{"key":"e_1_3_2_1_12_1","volume-title":"IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems","author":"Standards Board SA","year":"2008","unstructured":"IEEE- SA Standards Board . IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems . IEEE Std 1588-- 2008 (Revision of IEEE Std 1588--2002), pages c1--269, 2008. IEEE-SA Standards Board. IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems. IEEE Std 1588--2008 (Revision of IEEE Std 1588--2002), pages c1--269, 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.982426"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2010.5537932"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133429.2133523"},{"key":"e_1_3_2_1_16_1","first-page":"632","volume-title":"Multilevel Tree Fusion for Robust Clock Networks. In 2011 Conference on Computer-Aided Design (ICCAD)","author":"Lee D.-J.","year":"2011","unstructured":"D.-J. Lee and I. Markov . Multilevel Tree Fusion for Robust Clock Networks. In 2011 Conference on Computer-Aided Design (ICCAD) , pages 632 -- 639 , 2011 . D.-J. Lee and I. Markov. Multilevel Tree Fusion for Robust Clock Networks. In 2011 Conference on Computer-Aided Design (ICCAD), pages 632--639, 2011."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/764808.764819"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.62819"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1275295"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05118-0_40"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.406400"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1131481.1131783"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.918917"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/882517.885570"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/785169.785384"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2040012"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735023.1735058"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2007.151"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2006.33"}],"event":{"name":"SPAA '13: 25th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"SPAA '13"},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486192","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2486159.2486192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:53Z","timestamp":1750231733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486192"}},"subtitle":["scaling honeycombs is easier than scaling clock trees"],"short-title":[],"issued":{"date-parts":[[2013,7,23]]},"references-count":28,"alternative-id":["10.1145\/2486159.2486192","10.1145\/2486159"],"URL":"https:\/\/doi.org\/10.1145\/2486159.2486192","relation":{},"subject":[],"published":{"date-parts":[[2013,7,23]]},"assertion":[{"value":"2013-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}