Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Krishna K. Rangan

dblp:94/6854 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

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
Electronic design automation · 20% Processor architecture and microarchitecture · 19% Parallel and multicore computing · 19%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
chip multiprocessor
0.222011
Achieving uniform performance and maximizing throughput in the presence of heterogeneity · HPCA 2011
Thread motion: fine-grained power management for multi-core systems · ISCA 2009
Hardware reliability and fault tolerance
process variation
0.112011
Achieving uniform performance and maximizing throughput in the presence of heterogeneity · HPCA 2011
Electronic design automation › high-level synthesis
scheduling
0.112011
Achieving uniform performance and maximizing throughput in the presence of heterogeneity · HPCA 2011
Parallel and multicore computing › task scheduling
throughput-constrained scheduling
0.112011
Achieving uniform performance and maximizing throughput in the presence of heterogeneity · HPCA 2011
Energy-efficient computing › power management
dynamic voltage and frequency scaling
0.112009
Thread motion: fine-grained power management for multi-core systems · ISCA 2009
Energy-efficient computing
power management
0.112009
Thread motion: fine-grained power management for multi-core systems · ISCA 2009
Parallel and multicore computing › parallel programming runtimes › thread management
thread migration
0.112009
Thread motion: fine-grained power management for multi-core systems · ISCA 2009
Electronic design automation › power integrity
inductive noise
0.112008
DeCoR: A Delayed Commit and Rollback mechanism for handling inductive noise in processors · HPCA 2008
Distributed systems › fault tolerance
rollback recovery
0.112008
DeCoR: A Delayed Commit and Rollback mechanism for handling inductive noise in processors · HPCA 2008
Energy-efficient computing
power delivery
0.012008
DeCoR: A Delayed Commit and Rollback mechanism for handling inductive noise in processors · HPCA 2008
Electronic design automation › power integrity
voltage fluctuation
0.012008
DeCoR: A Delayed Commit and Rollback mechanism for handling inductive noise in processors · HPCA 2008

Methods — techniques the papers use, named apart from their topics

throughput-driven fairness · 0.1hardware/firmware scheduling · 0.1store queue and reorder buffer reuse · 0.1checkpoint-recovery · 0.1
YearPublicationVenuePosition
2011 Achieving uniform performance and maximizing throughput in the presence of heterogeneity
abstract
Continued scaling of process technologies is critical to sustaining improvements in processor frequencies and performance. However, shrinking process technologies exacerbates process variations - the deviation of process parameters from their target specifications. In the context of multi-core CMPs, which are implemented to feature homogeneous cores, within-die process variations result in substantially different core frequencies. Exposing such process-variation induced heterogeneity interferes with the norm of marketing chips at a single frequency. Further, application performance is undesirably dictated by the frequency of the core it is running on. To work around these challenges, a single uniform frequency, dictated by the slowest core, is currently chosen as the chip frequency sacrificing the increased performance capabilities of cores that could operate at higher frequencies. In this paper, we propose choosing the mean frequency across all cores, in lieu of the minimum frequency, as the single-frequency to use as the chip sales frequency. We examine several scheduling algorithms implemented below the O/S in hardware/firmware that guarantee minimum application performance near that of the average frequency, by masking process-variation induced heterogeneity from the end-user. We show that our Throughput-Driven Fairness (TDF) scheduling policy improves throughput by an average of 12% compared to a naive fairness scheme (round-robin) for frequency-sensitive applications. At the same time, TDF allows 98% of chips to maintain minimum performance at or above 90% of that expected at the mean frequency, providing a single uniform performance level to present for the chip.
Krishna K. Rangan, Michael D. Powell, Gu-Yeon Wei, David Brooks 0001
HPCA1
2009 Thread motion: fine-grained power management for multi-core systems
abstract
Dynamic voltage and frequency scaling (DVFS) is a commonly-used power-management scheme that dynamically adjusts power and performance to the time-varying needs of running programs. Unfortunately, conventional DVFS, relying on off-chip regulators, faces limitations in terms of temporal granularity and high costs when considered for future multi-core systems. To overcome these challenges, this paper presents thread motion (TM), a fine-grained power-management scheme for chip multiprocessors (CMPs). Instead of incurring the high cost of changing the voltage and frequency of different cores, TM enables rapid movement of threads to adapt the time-varying computing needs of running applications to a mixture of cores with fixed but different power/performance levels. Results show that for the same power budget, two voltage/frequency levels are sufficient to provide performance gains commensurate to idealized scenarios using per-core voltage control. Thread motion extends workload-based power management into the nanosecond realm and, for a given power budget, provides up to 20% better performance than coarse-grained DVFS.
Krishna K. Rangan, Gu-Yeon Wei, David Brooks 0001
ISCA1
2008 DeCoR: A Delayed Commit and Rollback mechanism for handling inductive noise in processors
abstract
Increases in peak current draw and reductions in the operating voltage of processors stress the importance of dealing with voltage fluctuations in processors. Noise-margin violations lead to undesired effects, like timing violations, which may result in incorrect execution of applications. Several recent architectural solutions for inductive noise have been proposed that, unfortunately, have a strong correlation to the underlying power-delivery package model and require a feedback loop that is largely constrained by the voltage/current sensor characteristics. The resulting solutions are not robust across a wide range of microprocessor designs and packaging technologies. This paper proposes a Delayed-commit and rollback scheme (DeCoR) that guarantees correctness, insensitive to the package model or the responsiveness of the voltage sensors. In particular, our approach recovers from, rather than attempting to avoid, voltage emergencies. This approach incurs a small performance penalty when compared to an ideal machine that does not have voltage emergencies. We show that explicit checkpoint-recovery schemes, intended to handle infrequent events, e.g., radiation-induced soft errors, suffer from large performance overheads for frequently-occurring voltage emergencies. DeCoR requires very few modifications to modern processor designs, as it leverages the existing store queue and reorder buffers. Unlike conventional designs that conservatively protect all components of the processor from inductive noise with overly-large timing margins, our approach only requires conservative protection of the architected register state and cache write paths.
Meeta Sharma Gupta, Krishna K. Rangan, Michael D. Smith 0001, Gu-Yeon Wei, David Brooks 0001
HPCA2
2007 Towards a software approach to mitigate voltage emergencies
abstract
Increases in peak current draw and reductions in the operating voltages ofprocessors continue to amplify the importance of dealing with voltage fluctuations in processors. One approach suggested has been to not only react to these fluctuations but also attempt to eliminate future occurrences of these fluctuations by dynamically modifying the executing program. This paper investigates the potential of a very simple dynamic scheme to appreciably reduce the number of run-time voltage emergencies. It shows that we can map many of the voltage emergencies in the execution of the SPEC benchmarks on an aggressive superscalar design to a few static loops, categorize the microarchitectural cause of the emergencies in each important loop through simple observations and a simple priority function, and finally apply straight forward software optimization strategies to mitigate up to 70% of the future voltage swings.
Meeta Sharma Gupta, Krishna K. Rangan, Michael D. Smith 0001, Gu-Yeon Wei, David Brooks 0001
ISLPED2