{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:37Z","timestamp":1750307917210,"version":"3.41.0"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2007,3,1]],"date-time":"2007-03-01T00:00:00Z","timestamp":1172707200000},"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":["SIGARCH Comput. Archit. News"],"published-print":{"date-parts":[[2007,3]]},"abstract":"<jats:p>Efficient utilizing on-chip storage space on Chip-Multiprocessors (CMPs) has become an important research topic. Tradeoffs between data accessibility and effective on-chip capacity have been studied extensively. It requires costly simulations to understand a wide-spectrum of the design space. In this paper, we first develop an abstract model for understanding the performance impact with respect to data replication. To overcome the lack of real-time interactions among multiple cores in the abstract model, we propose a global stack simulation strategy to study the performance of a variety of cache organizations on CMPs. The global stack logically incorporates a shared stack and per-core private stacks to collect shared\/private reuse (stack) distances for every memory reference in a single simulation pass. With the collected reuse distances, performance in terms of hits\/misses and average memory access times can be calculated for various cache organizations. We verify the stack results against individual execution-driven simulations that consider realistic cache parameters and delays using a set of commercial multithreaded workloads. The results show that stack simulations can accurately model the performance of various cache organizations. The single-pass stack simulation results demonstrate that the effectiveness of various techniques for optimizing the CMP on-chip storage is closely related to the working sets of the workloads as well as to the total cache sizes.<\/jats:p>","DOI":"10.1145\/1241601.1241607","type":"journal-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:16Z","timestamp":1181140636000},"page":"13-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["CMP cache performance projection"],"prefix":"10.1145","volume":"35","author":[{"given":"Xudong","family":"Shi","sequence":"first","affiliation":[{"name":"University of Florida, Gainesville, FL"}]},{"given":"Feiqi","family":"Su","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL"}]},{"given":"Jih-kwon","family":"Peir","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL"}]},{"given":"Ye","family":"Xia","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL"}]},{"given":"Zhen","family":"Yang","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL"}]}],"member":"320","published-online":{"date-parts":[[2007,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/63404.63407"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2004.21"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2006.10"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.194.0353"},{"key":"e_1_2_1_5_1","unstructured":"E. Berg and E. Hagersten \"StatCache: A Probabilistic Approach to Efficient and Accurate Data Locality Analysis \" Proc. of Int'l Symp. on Performance Analysis of Systems and Software March 2004.   E. Berg and E. Hagersten \"StatCache: A Probabilistic Approach to Efficient and Accurate Data Locality Analysis \" Proc. of Int'l Symp. on Performance Analysis of Systems and Software March 2004."},{"key":"e_1_2_1_6_1","unstructured":"E. Berg H. Zeffer and E. Hagersten \"A Statistical Multiprocessor Cache Model \" Proc. of Int'l Symp. on Performance Analysis of Systems and Software March 2006.  E. Berg H. Zeffer and E. Hagersten \"A Statistical Multiprocessor Cache Model \" Proc. of Int'l Symp. on Performance Analysis of Systems and Software March 2006."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2005.27"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2006.17"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.39"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/377792.377797"},{"key":"e_1_2_1_11_1","unstructured":"B. Fraguela R. Doallo and E. Zapata \"Automatic Analytical Modeling for the Estimation of Cache Misses \" Proc. of Int'l Conf. on Parallel Architectures and Compilation Techniques Sep. 1999.   B. Fraguela R. Doallo and E. Zapata \"Automatic Analytical Modeling for the Estimation of Cache Misses \" Proc. of Int'l Conf. on Parallel Architectures and Compilation Techniques Sep. 1999."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.40842"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1088149.1088154"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/605397.605420"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/107971.107995"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.34"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2004.10017"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.982916"},{"key":"e_1_2_1_19_1","unstructured":"Matlab http:\/\/www.mathworks.com\/products\/matlab\/.  Matlab http:\/\/www.mathworks.com\/products\/matlab\/."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.92.0078"},{"key":"e_1_2_1_21_1","unstructured":"Open source development labs database test 2. http:\/\/www.osdl.org\/lab_activities\/kernel_testing\/osdl_database_test_suite\/osdl_dbt-2\/.  Open source development labs database test 2. http:\/\/www.osdl.org\/lab_activities\/kernel_testing\/osdl_database_test_suite\/osdl_dbt-2\/."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.8"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/200912.200918"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:SUPE.0000014800.27383.8f"},{"key":"e_1_2_1_25_1","unstructured":"J. G. Thompson \"Efficient Analysis of Caching Systems \" Computer Science Division Technical Report UCB\/Computer Science Dept. 87\/374 University of California Berkeley October 1987.   J. G. Thompson \"Efficient Analysis of Caching Systems \" Computer Science Division Technical Report UCB\/Computer Science Dept. 87\/374 University of California Berkeley October 1987."},{"key":"e_1_2_1_26_1","unstructured":"X. Vera and J. Xue \"Let's Study Whole-Program Cache Behavior Analytically \" Proc. of 8th Int'l Symp. on High Performance Computer Architecture Feb. 2002.   X. Vera and J. Xue \"Let's Study Whole-Program Cache Behavior Analytically \" Proc. of 8th Int'l Symp. on High Performance Computer Architecture Feb. 2002."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1993.74"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.466631"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2005.53"}],"container-title":["ACM SIGARCH Computer Architecture News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1241601.1241607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1241601.1241607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:26Z","timestamp":1750258286000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1241601.1241607"}},"subtitle":["accessibility vs. capacity"],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3]]}},"alternative-id":["10.1145\/1241601.1241607"],"URL":"https:\/\/doi.org\/10.1145\/1241601.1241607","relation":{},"ISSN":["0163-5964"],"issn-type":[{"type":"print","value":"0163-5964"}],"subject":[],"published":{"date-parts":[[2007,3]]},"assertion":[{"value":"2007-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}