Dinesh Joshi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Dinesh Joshi has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Aritra Bagchi
Indian Institute of Technology Delhi
3 shared publications - Preeti Ranjan Panda
Indian Institute of Technology Delhi
3 shared publications - Ayushi Agarwal
Indian Institute of Technology Delhi
1 shared publication - Garima Modi
Indian Institute of Technology Delhi
1 shared publication - Neha Srivastava
NXP Semiconductors
1 shared publication - Sourav Roy
NXP Semiconductors
1 shared publication
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (11) , 5657-5661
Modeling Energy and Delay for ECC-Enabled Cache Architectures
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.
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (11) , 5657-5661
Modeling Energy and Delay for ECC-Enabled Cache Architectures
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
- 26 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5s) , 1-25
SHARP: SHARing-Aware Cache Writeback byPass
In modern multi-processor systems-on-chips (MPSoCs), writebacks from the private caches to the shared cache can introduce significant performance bottlenecks, especially because multiple threads from different co-executing programs contend for the shared cache resources. Intelligent cache bypass decisions for writebacks help mitigate such contention and enhance the utilization of the shared cache. Most prior cache bypass strategies account for contention for shared cache capacity by focusing primarily on data reuse, with only recent research beginning to consider bandwidth contention also in dynamic bypass decisions. However, data sharing, a crucial characteristic of modern multithreaded workloads, remains largely overlooked by state-of-the-art cache bypass decisions. Bypassing highly shared cache lines can increase the volume of main memory accesses, potentially resulting in performance bottlenecks. We introduce SHARP, a novel cache bypass policy that incorporates three key factors: data sharing, contention, and data reuse, into its dynamic bypass decisions for cache writebacks. In addition to prioritizing the caching of data with high reuse, we prioritize the caching of data shared across multiple threads to enhance cache utilization. We dynamically modulate our bypass decisions, employing aggressive bypass for writebacks when shared cache contention is high, while employing conservative bypass when contention is low. Experiments across a diverse set of PARSEC workloads demonstrate that SHARP improves overall system throughput by 12% and 8% compared to the no-bypass baseline and the state-of-the-art bypass baseline, respectively. SHARP also reduces the overall cache energy consumption by 14% over the no-bypass baseline.
- 26 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 24 (5s) , 1-25
Open AccessSHARP: SHARing-Aware Cache Writeback byPass
In modern multi-processor systems-on-chips (MPSoCs), writebacks from the private caches to the shared cache can introduce significant performance bottlenecks, especially because multiple threads from different co-executing programs contend for the shared cache resources. Intelligent cache bypass decisions for writebacks help mitigate such contention and enhance the utilization of the shared cache. Most prior cache bypass strategies account for contention for shared cache capacity by focusing primarily on data reuse, with only recent research beginning to consider bandwidth contention also in dynamic bypass decisions. However, data sharing, a crucial characteristic of modern multithreaded workloads, remains largely overlooked by state-of-the-art cache bypass decisions. Bypassing highly shared cache lines can increase the volume of main memory accesses, potentially resulting in performance bottlenecks. We introduce SHARP, a novel cache bypass policy that incorporates three key factors: data sharing, contention, and data reuse, into its dynamic bypass decisions for cache writebacks. In addition to prioritizing the caching of data with high reuse, we prioritize the caching of data shared across multiple threads to enhance cache utilization. We dynamically modulate our bypass decisions, employing aggressive bypass for writebacks when shared cache contention is high, while employing conservative bypass when contention is low. Experiments across a diverse set of PARSEC workloads demonstrate that SHARP improves overall system throughput by 12% and 8% compared to the no-bypass baseline and the state-of-the-art bypass baseline, respectively. SHARP also reduces the overall cache energy consumption by 14% over the no-bypass baseline.
- Open Access
- 10 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 23 (1) , 1-30
COBRRA: COntention-aware cache Bypass with Request-Response Arbitration
In modern multi-processor systems-on-chip (MPSoCs), requests from different processor cores, accelerators, and their responses from the lower-level memory contend for the shared cache bandwidth, making it a critical performance bottleneck. Prior research on shared cache management has considered requests from cores but has ignored crucial contributions from their responses. Prior cache bypass techniques focused on data reuse and neglected the system-level implications of shared cache contention. We propose COBRRA, a novel shared cache controller policy that mitigates the contention by aggressively bypassing selected responses from the lower-level memory and scheduling the remaining requests and responses to the cache efficiently. COBRRA is able to improve the average performance of a set of 15 SPEC workloads by 49% and 33% compared to the no-bypass baseline and the best-performing state-of-the-art bypass solution, respectively. Furthermore, COBRRA reduces the overall cache energy consumption by 38% and 31% compared to the no-bypass baseline and the most energy-efficient state-of-the-art bypass solution, respectively.
- 10 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 23 (1) , 1-30
Open AccessCOBRRA: COntention-aware cache Bypass with Request-Response Arbitration
In modern multi-processor systems-on-chip (MPSoCs), requests from different processor cores, accelerators, and their responses from the lower-level memory contend for the shared cache bandwidth, making it a critical performance bottleneck. Prior research on shared cache management has considered requests from cores but has ignored crucial contributions from their responses. Prior cache bypass techniques focused on data reuse and neglected the system-level implications of shared cache contention. We propose COBRRA, a novel shared cache controller policy that mitigates the contention by aggressively bypassing selected responses from the lower-level memory and scheduling the remaining requests and responses to the cache efficiently. COBRRA is able to improve the average performance of a set of 15 SPEC workloads by 49% and 33% compared to the no-bypass baseline and the best-performing state-of-the-art bypass solution, respectively. Furthermore, COBRRA reduces the overall cache energy consumption by 38% and 31% compared to the no-bypass baseline and the most energy-efficient state-of-the-art bypass solution, respectively.