Fine-Grained Shared Cache Interference Analysis Using Basic Block's Execution Time
Shared last-level caches in multi-core architectures may lead to mutual interference in memory accesses between cores, resulting in additional access latency. To ensure the accuracy of programs' worst-case execution time (WCET) analysis, the inter-core interference of shared caches must be analyzed. This involves getting the time when memory access may occur between cores (i.e., inter-core context). But due to the uncertainty of inputs, describing inter-core context becomes extremely challenging. Existing works often consider the entire execution time of program as the time when all memory accesses may occur to enhance scalability, which ignores the timing information within programs and may lead to an overestimation of interference. This paper proposes a fine-grained shared cache interference analysis method based on the execution time of basic blocks. It employs a path-based strategy to estimate the execution time of basic blocks and use it as the lifecycles of memory accesses within the blocks, which can effectively eliminate impossible interferences. Experiments show that compared to the all interference method, we can reduce WCET by 65% in the best case and by 14% on average, with only a 130% increase in average analysis time.
Authors
- Wenqi Lou (ORCID: https://orcid.org/0000-0002-2240-6672)
- Xun Gong (ORCID: https://orcid.org/0000-0003-3625-8575)
- Yue Gao (ORCID: https://orcid.org/0000-0001-9357-1766)
- Xi Li (ORCID: https://orcid.org/0000-0003-0147-1368)
- B. JIANG
- Yixuan Zhu (ORCID: https://orcid.org/0009-0004-1400-3306)
Institutions
- University of Science and Technology of China (CN)
Publication Details
- Published
- 2024-11-18
- DOI
- https://doi.org/10.1109/iccd63220.2024.00056
- Citations
- 1
- Primary Topic
- Caching and Content Delivery
- Type
- article
- Field-Weighted Citation Impact
- 0.35