Demo Data from EDBT 2026 / reviewers in the wild / expert
Vinodh Cuppu
dblp:31/3907
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 2001
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 4 · 3 first-authorSoftware engineering, systems software and programming languages · 2 · 2 first-author
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
3 papers |
Memory systems · 71% Performance modeling and evaluation · 18% Electronic design automation · 10% |
Topics — the 11 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems › DRAM
DRAM architecture |
0.1 | 2 | 2001 | Concurrency, latency, or system overhead: which has the largest impact on uniprocessor DRAM-system performance? · ISCA 2001 A Performance Comparison of Contemporary DRAM Architectures · ISCA 1999 |
Electronic design automation
design space exploration |
0.0 | 1 | 2001 | Concurrency, latency, or system overhead: which has the largest impact on uniprocessor DRAM-system performance? · ISCA 2001 |
Memory systems
DRAM |
0.0 | 1 | 2001 | High-Performance DRAMs in Workstation Environments · IEEE Trans. Computers 2001 |
Memory systems › memory access latency
DRAM latency |
0.0 | 1 | 2001 | High-Performance DRAMs in Workstation Environments · IEEE Trans. Computers 2001 |
Memory systems
memory access latency |
0.0 | 1 | 2001 | High-Performance DRAMs in Workstation Environments · IEEE Trans. Computers 2001 |
Memory systems › memory controller
memory controller scheduling |
0.0 | 1 | 2001 | Concurrency, latency, or system overhead: which has the largest impact on uniprocessor DRAM-system performance? · ISCA 2001 |
Performance modeling and evaluation › simulation › architectural simulation
memory system simulation |
0.0 | 1 | 2001 | High-Performance DRAMs in Workstation Environments · IEEE Trans. Computers 2001 |
Performance modeling and evaluation › benchmarking › computer architecture benchmarking
memory system benchmarking |
0.0 | 1 | 1999 | A Performance Comparison of Contemporary DRAM Architectures · ISCA 1999 |
Memory systems › memory hierarchy
cache hierarchy |
0.0 | 1 | 2001 | High-Performance DRAMs in Workstation Environments · IEEE Trans. Computers 2001 |
Memory systems › memory hierarchy › cache hierarchy
l2 cache |
0.0 | 1 | 2001 | High-Performance DRAMs in Workstation Environments · IEEE Trans. Computers 2001 |
Memory systems › memory architecture
memory latency and bandwidth |
0.0 | 1 | 1999 | A Performance Comparison of Contemporary DRAM Architectures · ISCA 1999 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | Transparent data-memory organizations for digital signal processorsabstractToday's digital signal processors (DSPs), unlike general-purpose processors, use a non-uniform addressing model in which the primary components of the memory system-the DRAM and dual tagless SRAMs-are referenced through completely separate segments of the address space. The recent trend of programming DSPs in high-level languages instead of assembly code has exposed this memory model as a potential weakness, as the model makes for a poor compiler target. In many of today's high-performance DSPs this non-uniform model is being replaced by a uniform model-a transparent organization like that of most general-purpose systems, in which all memory structures share the same address space as the DRAM systemIn such a memory organization, one must replace the DSP's tagless SRAMs with something resembling a general-purpose cache. This study investigates the performance of a range of traditional and slightly non-traditional cache organizations for a high-performance DSP, the Texas Instruments 'C6000 VLIW DSP. The traditional cache organizations range from a fraction of a kilobyte to several kilobytes; they approach the SRAM performance and, for some benchmarks, beat it. In the non-traditional cache organizations, rather than simply adding tags to the large on-chip SRAM structure, we take advantage of the relatively regular memory access behavior of most DSP applications and replace the tagless SRAM with a near-traditional cache that uses a very small number of wide blocks. This performs similarly to the traditional caches but uses less storage. In general, we find that one can achieve nearly the same performance as a tagless SRAM while using a much smaller footprint. Sadagopan Srinivasan, Vinodh Cuppu, Bruce L. Jacob |
CASES | 2 |
| 2001 | Concurrency, latency, or system overhead: which has the largest impact on uniprocessor DRAM-system performance?abstractGiven a fixed CPU architecture and a fixed DRAM timing specification, there is still a large design space for a DRAM system organization. Parameters include the number of memory channels, the bandwidth of each channel, burst sizes, queue sizes and organizations, turnaround overhead, memory-controller page protocol, algorithms for assigning request priorities and scheduling requests dynamically, etc. In this design space, we see a wide variation in application execution times: for example, execution times for SPEC CPU 2000 integer suite on a 2-way ganged Direct Rambus organization (32 data bits) with 64-byte bursts are 10-20% lower than execution times on an otherwise identical configuration that uses 32-byte bursts. This represents two system configurations that are relatively close to each other in the design space; performance differences become even more pronounced for designs further apart. Vinodh Cuppu, Bruce L. Jacob |
ISCA | 1 |
| 2001 | High-Performance DRAMs in Workstation EnvironmentsabstractThis paper presents a simulation-based performance study of several of the new high-performance DRAM architectures, each evaluated in a small system organization. These small-system organizations correspond to workstation-class computers and use only a handful of DRAM chips (/spl sim/10, as opposed to /spl sim/1 or /spl sim/100). The study covers Fast Page Mode, Extended Data Out, Synchronous, Enhanced Synchronous, Double Data Rate, Synchronous Link, Rambus, and Direct Rambus designs. Our simulations reveal several things: 1) Current advanced DRAM technologies are attacking the memory bandwidth problem but not the latency problem; 2) bus transmission speed will soon become a primary factor limiting memory-system performance; 3) the post-L2 address stream still contains significant locality, though it varies from application to application; 4) systems without L2 caches are feasible for low- and medium-speed CPUs (1 GHz and below); and 5) as we move to wider buses, row access time becomes more prominent, making it important to investigate techniques to exploit the available locality to decrease access time. Vinodh Cuppu, Bruce L. Jacob, Trevor N. Mudge |
IEEE Trans. Computers | 1 |
| 1999 | A Performance Comparison of Contemporary DRAM ArchitecturesabstractIn response to the growing gap between memory access time and processor speed, DRAM manufacturers have created several new DRAM architectures. This paper presents a simulation-based performance study of a representative group, each evaluated in a small system organization. These small-system organizations correspond to workstation-class computers and use on the order of IO DRAM chips. The study covers Fast Page Mode, Extended Data Out, Synchronous, Enhanced Synchronous, Synchronous Link, Rambus, and Direct Rambus designs. Our simulations reveal several things: (a) current advanced DRAM technologies are attacking the memory bandwidth problem but not the latency problem; (b) bus transmission speed will soon become a primary factor limiting memory-system performance; (c) the post-12 address stream still contains significant locality, though it varies from application to application; and (d) as we move to wider buses, row access time becomes more prominent, making it important to investigate techniques to exploit the available locality to decrease access time. Vinodh Cuppu, Bruce L. Jacob, Trevor N. Mudge |
ISCA | 1 |