{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:40Z","timestamp":1742914120568,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030352240"},{"type":"electronic","value":"9783030352257"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-35225-7_5","type":"book-chapter","created":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T08:04:56Z","timestamp":1574150696000},"page":"49-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Memory Distance Measurement for Concurrent Programs"],"prefix":"10.1007","author":[{"given":"Hao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jialiang","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zijiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Carr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,15]]},"reference":[{"key":"5_CR1","unstructured":"Fang, C., Carr, S., Onder, S., Wang, Z.: Instruction based memory distance analysis and its application to optimization. In: 14th International Conference on Parallel Architectures and Compilation Techniques (PACT 2005), pp. 27\u201337. IEEE (2005)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Ding, C., Zhong, Y.: Predicting whole-program locality through reuse distance analysis. In: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, PLDI 2003, pp. 245\u2013257 (2003)","DOI":"10.1145\/781158.781159"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Fang, C., Carr, S., \u00d6nder, S., Wang, Z.: Reuse-distance-based miss-rate prediction on a per instruction basis. In: Proceedings of the 2004 Workshop on Memory System Performance, MSP 2004, pp. 60\u201368 (2004)","DOI":"10.1145\/1065895.1065906"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Marin, G., Mellor-Crummey, J.: Cross-architecture performance predictions for scientific applications using parameterized models. In: Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2004\/Performance 2004, pp. 2\u201313 (2004)","DOI":"10.1145\/1005686.1005691"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Burckhardt, S., Kothari, P., Musuvathi, M., Nagarakatte, S.: A randomized scheduler with probabilistic guarantees of finding bugs. In: Fifteenth Edition of ASPLOS on Architectural Support for Programming Languages and Operating Systems, pp. 167\u2013178 (2010)","DOI":"10.1145\/1736020.1736040"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bienia, C., Kumar, S., Singh, J.P., Li, K.: The PARSEC benchmark suite: characterization and architectural implications. In: International Conference on Parallel Architecture and Compilation Techniques, pp. 72\u201381 (2008)","DOI":"10.1145\/1454115.1454128"},{"key":"5_CR7","unstructured":"Wang, C., Mahmoud, S., Gupta, A., Kahlon, V., Sinha, N.: Dynamic test generation for concurrent programs, 12 July 2012. US Patent App. 13\/348,286"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Guo, S., Kusano, M., Wang, C., Yang, Z., Gupta, A.: Assertion guided symbolic execution of multithreaded programs. In: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering, pp. 854\u2013865. ACM (2015)","DOI":"10.1145\/2786805.2786841"},{"key":"5_CR9","unstructured":"Sen, K.: Scalable automated methods for dynamic program analysis. Technical report (2006)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Luk, C.-K., et al.: Pin: building customized program analysis tools with dynamic instrumentation. In: ACM Sigplan Notice, vol. 40, pp. 190\u2013200. ACM (2005)","DOI":"10.1145\/1064978.1065034"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1713254.1713257","volume":"43","author":"L Ciortea","year":"2009","unstructured":"Ciortea, L., Zamfir, C., Bucur, S., Chipounov, V., Candea, G.: Cloud9: a software testing service. Oper. Syst. Rev. 43(4), 5\u201310 (2009)","journal-title":"Oper. Syst. Rev."},{"key":"5_CR13","unstructured":"Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis & transformation. In: Proceedings of the International Symposium on Code Generation and Optimization: Feedback-Directed and Runtime Optimization, p. 75. IEEE Computer Society (2004)"},{"key":"5_CR14","unstructured":"Lattner, C.: LLVM and Clang: next generation compiler technology. In: The BSD Conference, pp. 1\u20132 (2008)"},{"key":"5_CR15","unstructured":"Cadar, C., Dunbar, D., Engler, D.R.: KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs, pp. 209\u2013224 (2008)"},{"issue":"11","key":"5_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1145\/1037187.1024414","volume":"39","author":"X Shen","year":"2004","unstructured":"Shen, X., Zhong, Y., Ding, C.: Locality phase prediction. ACM SIGPLAN Not. 39(11), 165\u2013176 (2004)","journal-title":"ACM SIGPLAN Not."},{"key":"5_CR17","volume-title":"Reuse Distance Analysis","author":"C Ding","year":"2001","unstructured":"Ding, C., Zhong, Y.: Reuse Distance Analysis. University of Rochester, Rochester (2001)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Schuff, D.L., Kulkarni, M., Pai, V.S.: Accelerating multicore reuse distance analysis with sampling and parallelization. In: Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques, pp. 53\u201364. ACM (2010)","DOI":"10.1145\/1854273.1854286"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-11970-5_15","volume-title":"Compiler Construction","author":"Y Jiang","year":"2010","unstructured":"Jiang, Y., Zhang, E.Z., Tian, K., Shen, X.: Is reuse distance applicable to data locality analysis on chip multiprocessors? In: Gupta, R. (ed.) CC 2010. LNCS, vol. 6011, pp. 264\u2013282. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-11970-5_15"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Wu, M.-J., Zhao, M., Yeung, D.: Studying multicore processor scaling via reuse distance analysis. In: ACM SIGARCH Computer Architecture News, vol. 41, pp. 499\u2013510. ACM (2013)","DOI":"10.1145\/2508148.2485965"},{"issue":"1","key":"5_CR21","first-page":"1","volume":"31","author":"W Meng-Ju","year":"2013","unstructured":"Meng-Ju, W., Yeung, D.: Efficient reuse distance analysis of multicore scaling for loop-based parallel programs. ACM Trans. Comput. Syst. (TOCS) 31(1), 1 (2013)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Keramidas, G., Petoumenos, P., Kaxiras, S.: Cache replacement based on reuse-distance prediction. In: 25th International Conference on Computer Design, ICCD 2007, pp. 245\u2013250. IEEE (2007)","DOI":"10.1109\/ICCD.2007.4601909"},{"issue":"6","key":"5_CR23","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/1552309.1552310","volume":"31","author":"Y Zhong","year":"2009","unstructured":"Zhong, Y., Shen, X., Ding, C.: Program locality analysis using reuse distance. ACM Trans. Program. Lang. Syst. (TOPLAS) 31(6), 20 (2009)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Shen, X., Shaw, J., Meeker, B., Ding, C.: Locality approximation using time. In: ACM SIGPLAN Notices, vol. 42, pp. 55\u201361. ACM (2007)","DOI":"10.1145\/1190215.1190227"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Niu, Q., Dinan, J., Lu, Q., Sadayappan, P.: PARDA: a fast parallel reuse distance analysis algorithm. In: 2012 IEEE 26th International Parallel & Distributed Processing Symposium (IPDPS), pp. 1284\u20131294. IEEE (2012)","DOI":"10.1109\/IPDPS.2012.117"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Burckhardt, S., Kothari, P., Musuvathi, M., SNagarakatte, M.: A randomized scheduler with probabilistic guarantees of finding bugs. In: ACM Sigplan Notices, vol. 45, pp. 167\u2013178. ACM (2010)","DOI":"10.1145\/1735971.1736040"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Liu, T., Curtsinger, C., Berger, E.D.: Dthreads: efficient deterministic multithreading. In: Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, pp. 327\u2013336. ACM (2011)","DOI":"10.1145\/2043556.2043587"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Cai, Y., Yang, Z.: Radius aware probabilistic testing of deadlocks with guarantees. In: Proceedings of the 31st IEEE\/ACM International Conference on Automated Software Engineering, ASE 2016, 3\u20137 September 2016, Singapore, pp. 356\u2013367 (2016)","DOI":"10.1145\/2970276.2970307"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35225-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T18:03:25Z","timestamp":1574186605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35225-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030352240","9783030352257"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35225-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LCPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Languages and Compilers for Parallel Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"College Station, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lcpc2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/parasol.tamu.edu\/lcpc2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Hotcrp.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}