{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T02:13:11Z","timestamp":1775182391118,"version":"3.50.1"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2013,12,1]],"date-time":"2013-12-01T00:00:00Z","timestamp":1385856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0811689 and CNS-0964627"],"award-info":[{"award-number":["CCF-0811689 and CNS-0964627"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CCF-0811689 and CNS-0964627"],"award-info":[{"award-number":["CCF-0811689 and CNS-0964627"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p>To utilize the full potential of modern chip multiprocessors and obtain scalable performance improvements, it is critical to mitigate resource contention created by multithreaded workloads. In this article, we describe ReSense, the first runtime system that uses application characteristics to dynamically map multithreaded applications from dynamic workloads\u2014workloads where multithreaded applications arrive, execute, and terminate continuously in unpredictable ways. ReSense mitigates contention for the shared resources in the memory hierarchy by applying a novel thread-mapping algorithm that dynamically adjusts the mapping of threads from dynamic workloads using a precalculated sensitivity score. The sensitivity score quantifies an application's sensitivity to sharing a particular memory resource and is calculated by an efficient characterization process that involves running the multithreaded application by itself on the target platform. To measure ReSense's effectiveness, sensitivity scores were determined for 21 benchmarks from PARSEC-2.1 and NPB-OMP-3.3 for the shared resources in the memory hierarchy on four different platforms. Using three different-sized dynamic workloads composed of randomly selected two, four, and eight corunning benchmarks with randomly selected start times, ReSense was able to improve the average response time of the three workloads by up to 27.03%, 20.89%, and 29.34% and throughput by up to 19.97%, 46.56%, and 29.86%, respectively, over the native OS on real hardware. By estimating and comparing ReSense's effectiveness with the optimal thread mapping for two different workloads, we found that the maximum average difference with the experimentally determined optimal performance was 1.49% for average response time and 2.08% for throughput.<\/jats:p>","DOI":"10.1145\/2541228.2555298","type":"journal-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T13:39:57Z","timestamp":1389706797000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["ReSense"],"prefix":"10.1145","volume":"10","author":[{"given":"Tanima","family":"Dey","sequence":"first","affiliation":[{"name":"University of Virginia, Charlottesville, Virginia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, Virginia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack W.","family":"Davidson","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, Virginia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mary Lou","family":"Soffa","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, Virginia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Bailey D. H. Barszcz E. Barton J. T. Browning D. S. Carter R. L. Fatoohi R. A. Frederickson P. O. Lasinski T. A. Simon H. D. Venkatakrishnan V. and Weeratunga S. K. 1991. The NAS parallel benchmarks. Tech. rep. The International Journal of Supercomputer Applications.  Bailey D. H. Barszcz E. Barton J. T. Browning D. S. Carter R. L. Fatoohi R. A. Frederickson P. O. Lasinski T. A. Simon H. D. Venkatakrishnan V. and Weeratunga S. K. 1991. The NAS parallel benchmarks. Tech. rep. The International Journal of Supercomputer Applications.","DOI":"10.1177\/109434209100500306"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810085.1810113"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454128"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2010.67"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2005.27"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248396"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2006.31"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2013.6522311"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2015039.2015522"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2013.6495010"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1299042.1299108"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2012.200"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151003"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454146"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Jin H. Hood R. Chang J. Djomehri J. Jespersen D. and Taylor K. 2009. Characterizing application performance sensitivity to resource contention in multicore architectures. Tech. rep. NASA Ames Research Center.  Jin H. Hood R. Chang J. Djomehri J. Jespersen D. and Taylor K. 2009. Characterizing application performance sensitivity to resource contention in multicore architectures. Tech. rep. NASA Ames Research Center.","DOI":"10.1109\/IPDPS.2010.5470399"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2009.14"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis.","author":"Kambadur M.","unstructured":"Kambadur , M. , Moseley , T. , Hank , R. , and Kim , M. A . 2012. Measuring interference between live datacenter applications . In Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis. Kambadur, M., Moseley, T., Hank, R., and Kim, M. A. 2012. Measuring interference between live datacenter applications. In Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2008.48"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2155620.2155650"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1944862.1944887"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772991"},{"key":"e_1_2_1_22_1","unstructured":"Milton J. S. and Arnold J. C. 2003. Introduction to Probability and Statistics 4th Ed. Tata McGraw Hill Publishing Company New Delhi India.   Milton J. S. and Arnold J. C. 2003. Introduction to Probability and Statistics 4th Ed. Tata McGraw Hill Publishing Company New Delhi India."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2005.74"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2011.8"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2400682.2400704"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2006.49"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151002"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the Ottawa Linux Symposium.","author":"Siddha V. P. S.","unstructured":"Siddha , V. P. S. and Mallick , A . 2005. Chip multi processing (CMP) aware Linux kernel scheduler . In Proceedings of the Ottawa Linux Symposium. Siddha, V. P. S. and Mallick, A. 2005. Chip multi processing (CMP) aware Linux kernel scheduler. In Proceedings of the Ottawa Linux Symposium."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379244"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2008.4771796"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508259"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000064.2000099"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2151024.2151031"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the CMP-MSI, Held in Conjunction with ISCA-35","author":"Xie Y.","unstructured":"Xie , Y. and Loh , G . 2008. Dynamic classification of program memory behaviors in CMPs . In Proceedings of the CMP-MSI, Held in Conjunction with ISCA-35 . Xie, Y. and Loh, G. 2008. Dynamic classification of program memory behaviors in CMPs. In Proceedings of the CMP-MSI, Held in Conjunction with ISCA-35."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555754.1555778"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1519065.1519076"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1736020.1736036"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2541228.2555298","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2541228.2555298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:35:01Z","timestamp":1750232101000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2541228.2555298"}},"subtitle":["Mapping dynamic workloads of colocated multithreaded applications using resource sensitivity"],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["10.1145\/2541228.2555298"],"URL":"https:\/\/doi.org\/10.1145\/2541228.2555298","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]},"assertion":[{"value":"2013-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}