{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:11:18Z","timestamp":1763467878396,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,7]],"date-time":"2008-06-07T00:00:00Z","timestamp":1212796800000},"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":[[2008,6,7]]},"DOI":"10.1145\/1375527.1375537","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"46-55","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Preserving time in large-scale communication traces"],"prefix":"10.1145","author":[{"given":"Prasun","family":"Ratn","sequence":"first","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Mueller","sequence":"additional","affiliation":[{"name":"North Carolina State University, Raleigh, NC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bronis R.","family":"de Supinski","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Schulz","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The ASCI purple benchmarks.http:\/\/www.llnl.gov\/asci\/purple\/benchmarks 2002.]]  The ASCI purple benchmarks.http:\/\/www.llnl.gov\/asci\/purple\/benchmarks 2002.]]"},{"key":"e_1_3_2_1_2_1","volume-title":"Supercomputing","author":"Adiga N.","year":"2002","unstructured":"N. Adiga and et al. An overview of the BlueGene\/Lsupercomputer . In Supercomputing , November 2002 .]] N. Adiga and et al. An overview of the BlueGene\/Lsupercomputer. In Supercomputing, November 2002.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370254"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370238"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645456.654829"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2391541.2391544"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1168857.1168903"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646667.700191"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11846802_43"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.86110"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11758525_71"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2005.28"},{"key":"e_1_3_2_1_13_1","volume-title":"Fundamental Algorithms","author":"Knuth D. E.","year":"1973","unstructured":"D. E. Knuth . The Art of Computer Programming : Fundamental Algorithms , volume 2 . Addison-Wesley , 2edition, 1973 .]] D. E. Knuth. The Art of Computer Programming: Fundamental Algorithms, volume 2. Addison-Wesley, 2edition, 1973.]]"},{"key":"e_1_3_2_1_14_1","first-page":"289","volume-title":"International Symposium on Code Generation and Optimization","author":"Marathe J.","year":"2003","unstructured":"J. Marathe , F. Mueller , T. Mohan , B. R. de Supinski , S. A. McKee , and A. Yoo . METRIC: Tracking down inefficiencies in the memory hierarchy via binary rewriting . In International Symposium on Code Generation and Optimization , pages 289 - 300 , March 2003 .]] J. Marathe, F. Mueller, T. Mohan, B. R. de Supinski, S. A.McKee, and A. Yoo. METRIC: Tracking down inefficiencies in the memory hierarchy via binary rewriting. In International Symposium on Code Generation and Optimization, pages 289-300, March 2003.]]"},{"key":"e_1_3_2_1_15_1","volume-title":"USENIX Conference on File and Storage Technologies","author":"Mesnier M.","year":"2007","unstructured":"M. Mesnier , M. Wachs , R. Sambasivan , J. Lopez , J. Hendricks , and G. R. Ganger . \/\/trace: Parallel trace replay with approximate causal events . In USENIX Conference on File and Storage Technologies , February 2007 .]] M. Mesnier, M. Wachs, R. Sambasivan, J. Lopez, J. Hendricks, and G. R. Ganger. \/\/trace: Parallel trace replay with approximate causal events. In USENIX Conference on File and Storage Technologies, February 2007.]]"},{"issue":"1","key":"e_1_3_2_1_16_1","first-page":"69","article-title":"VAMPIR: Visualization and analysis of MPIresources","volume":"12","author":"Nagel W. E.","year":"1996","unstructured":"W. E. Nagel , A. Arnold , M. Weber , H. C. Hoppe , and K. Solchenbach . VAMPIR: Visualization and analysis of MPIresources . Supercomputer , 12 ( 1 ): 69 -- 80 , 1996 .]] W. E. Nagel, A. Arnold, M. Weber, H. C. Hoppe, and K. Solchenbach. VAMPIR: Visualization and analysis of MPIresources. Supercomputer, 12(1):69--80, 1996.]]","journal-title":"Supercomputer"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/648136.746482"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188605"},{"key":"e_1_3_2_1_19_1","first-page":"17","volume-title":"Proceedings of WoTUG-18: Transputer and occam Developments,volume 44 of Transputer and Occam Engineering","author":"Pillet V.","year":"1995","unstructured":"V. Pillet , J. Labarta , T. Cortes , and S. Girona . PARAVER: A tool to visualise and analyze parallel code . In Proceedings of WoTUG-18: Transputer and occam Developments,volume 44 of Transputer and Occam Engineering , pages 17 -- 31 , April 1995 .]] V. Pillet, J. Labarta, T. Cortes, and S. Girona. PARAVER: A tool to visualise and analyze parallel code. In Proceedings of WoTUG-18: Transputer and occam Developments,volume 44 of Transputer and Occam Engineering, pages 17--31, April 1995.]]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1048935.1050172"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1362622.1362663"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/379539.379590"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/331532.331573"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1177\/109434209901300310"}],"event":{"name":"ICS08: International Conference on Supercomputing","sponsor":["ACM Association for Computing Machinery","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Island of Kos Greece","acronym":"ICS08"},"container-title":["Proceedings of the 22nd annual international conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1375527.1375537","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1375527.1375537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:36Z","timestamp":1750255056000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1375527.1375537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,7]]},"references-count":24,"alternative-id":["10.1145\/1375527.1375537","10.1145\/1375527"],"URL":"https:\/\/doi.org\/10.1145\/1375527.1375537","relation":{},"subject":[],"published":{"date-parts":[[2008,6,7]]},"assertion":[{"value":"2008-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}