VLDB 2026 Research / reviewers in the wild / expert
Sumeet Bandishte
dblp:211/9987
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Processor architecture and microarchitecture · 82% Memory systems · 18% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Processor architecture and microarchitecture › out-of-order execution
out-of-order processor |
0.6 | 1 | 2022 | Register file prefetching · ISCA 2022 |
Processor architecture and microarchitecture
speculative execution |
0.4 | 1 | 2020 | Focused Value Prediction · ISCA 2020 |
Processor architecture and microarchitecture
value prediction |
0.4 | 1 | 2020 | Focused Value Prediction · ISCA 2020 |
Memory systems › memory access latency
cache access latency |
0.2 | 1 | 2022 | Register file prefetching · ISCA 2022 |
Memory systems
memory wall |
0.2 | 1 | 2022 | Register file prefetching · ISCA 2022 |
Processor architecture and microarchitecture
instruction-level parallelism |
0.1 | 1 | 2020 | Focused Value Prediction · ISCA 2020 |
Methods — techniques the papers use, named apart from their topics
prefetching · 0.6simulation · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Register file prefetchingabstractThe memory wall continues to limit the performance of modern out-of-order (OOO) processors, despite the expensive provisioning of large multi-level caches and advancements in memory prefetching. In this paper, we put forth an important observation that the memory wall is not monolithic, but is constituted of many latency walls arising due to the latency of each tier of cache/memory. Our results show that even though level-1 (L1) data cache latency is nearly 40X lower than main memory latency, mitigating this latency offers a very similar performance opportunity as the more widely studied, main memory latency. Sudhanshu Shukla, Sumeet Bandishte, Jayesh Gaur, Sreenivas Subramoney |
ISCA | 2 |
| 2020 | Focused Value PredictionabstractValue Prediction was proposed to speculatively break true data dependencies, thereby allowing Out of Order (OOO) processors to achieve higher instruction level parallelism (ILP) and gain performance. State-of-the-art value predictors try to maximize the number of instructions that can be value predicted, with the belief that a higher coverage will unlock more ILP and increase performance. Unfortunately, this comes at increased complexity with implementations that require multiple different types of value predictors working in tandem, incurring substantial area and power cost.In this paper we motivate towards lower coverage, but focused, value prediction. Instead of aggressively increasing the coverage of value prediction, at the cost of higher area and power, we motivate refocusing value prediction as a mechanism to achieve an early execution of instructions that frequently create performance bottlenecks in the OOO processor. Since we do not aim for high coverage, our implementation is light-weight, needing just 1.2 KB of storage. Simulation results on 60 diverse workloads show that we deliver 3.3% performance gain over a baseline similar to the Intel Skylake processor. This performance gain increases substantially to 8.6% when we simulate a futuristic up-scaled version of Skylake. In contrast, for the same storage, state-of-the-art value predictors deliver a much lower speedup of 1.7% and 4.7% respectively. Notably, our proposal is similar to these predictors in performance, even when they are given nearly eight times the storage and have 60% more prediction coverage than our solution. Sumeet Bandishte, Jayesh Gaur, Zeev Sperber, Lihu Rappoport, Adi Yoaz, Sreenivas Subramoney |
ISCA | 1 |