GMGarima Modi

Garima Modi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Garima Modi has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Modeling Energy and Delay for ECC-Enabled Cache Architectures

    by Dinesh Joshi, Aritra Bagchi, Ayushi Agarwal, Garima Modi, Neha Srivastava, Sourav Roy, Preeti Ranjan Panda

    With increasing integration density, modern Systems-on-Chips (SoCs), especially on-chip caches and memories, are critically vulnerable to soft errors. Error Correcting Codes (ECC) are the most widely adopted mitigation technique in safety-critical SoCs, making accurate modeling of ECC overheads essential for effective design decisions. Existing cache modeling frameworks such as CACTI consider only the memory overheads for storing ECC check-bits, and neglect the delay and energy costs of ECC combinational logic, assuming them negligible. We extend CACTI to include the delay and energy overheads due to the ECC logic along with the memory-induced ECC overheads. In addition to the configurations supported by CACTI, we model High Reliability (HR) and High Performance (HP) modes of ECC operation for flexible design exploration. Extensive evaluation across SPEC CPU 2006 and MiBench workloads demonstrates the effectiveness of our modeling, highlighting that neglecting logic overheads underestimates the ECC performance and energy overheads by 12% and 18%, respectively, for SPEC CPU 2006, and 12% and 17%, respectively, for MiBench.

  • Open Access

    FARRE: Fairness Aware Request Response Arbitration in Shared Caches

    by Garima Modi, Priyanka Singla, Neetu Jindal, Ayan Mandal, Preeti Panda

    Contention in shared caches caused by concurrently executing applications can lead to overall performance degradation in multiprocessor systems-on-chip (MPSoCs). To address this issue, various shared cache arbitration techniques have been proposed to manage cache bandwidth contention. These techniques focus on enhancing overall system performance; however, this optimization often comes at the expense of system fairness, leading to some applications experiencing disproportionate slowdowns, or, in the worst case, starvation. Therefore, an effective shared cache bandwidth management policy is needed to optimize performance while ensuring fairness across applications. We propose FARRE , a novel fairness aware request-response arbitration technique for shared caches. FARRE is designed to optimize performance while attempting to maintain a user-defined fairness threshold. We evaluate its effectiveness through extensive simulations including comparisons against state-of-the-art arbitration schemes. The results show that FARRE is able to maintain or exceed the input fairness thresholds, and improves system performance over standard fair scheduling policies such as round-robin; the performance improvement is 14% for lower fairness thresholds such as 0.5, and could even gain 5% performance for aggressive thresholds such as 0.9. Additionally, compared to the best performance optimization techniques, FARRE achieves 81% higher fairness.

  • Open Access

    CABARRE: Request Response Arbitration for Shared Cache Management

    by Garima Modi, Aritra Bagchi, Neetu Jindal, Ayan Mandal, Preeti Ranjan Panda

    Modern multi-processor systems-on-chip (MPSoCs) are characterized by caches shared by multiple cores. These shared caches receive requests issued by the processor cores. Requests that are subject to cache misses may result in the generation of responses . These responses are received from the lower level of the memory hierarchy and written to the cache. The outstanding requests and responses contend for the shared cache bandwidth. To mitigate the impact of the cache bandwidth contention on the overall system performance, an efficient request and response arbitration policy is needed. Research on shared cache management has neglected the additional cache contention caused by responses, which are written to the cache. We propose CABARRE , a novel request and response arbitration policy at shared caches, so as to improve the overall system performance. CABARRE shows a performance improvement of 23% on average across a set of SPEC workloads compared to straightforward adaptations of state-of-the-art solutions.