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

Mitchell Hayenga

dblp:87/7846 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2014
—ORCID · none

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

Systems, architecture and hardware · 3 · 3 first-authorSoftware engineering, systems software and programming languages · 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
Energy-efficient computing · 44% Interconnection networks and networks-on-chip · 30% Processor architecture and microarchitecture · 27%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Energy-efficient computing
clock gating
0.212014
Revolver: Processor architecture for power efficient loop execution · HPCA 2014
Processor architecture and microarchitecture
out-of-order execution
0.212014
Revolver: Processor architecture for power efficient loop execution · HPCA 2014
Energy-efficient computing
power management
0.212014
Revolver: Processor architecture for power efficient loop execution · HPCA 2014
Interconnection networks and networks-on-chip › router architecture
network-on-chip router
0.112011
The NoX router · MICRO 2011
Energy-efficient computing › energy-efficient communication
power-efficient network-on-chip
0.112009
SCARAB: a single cycle adaptive routing and bufferless network · MICRO 2009
Processor architecture and microarchitecture
chip multiprocessor
0.122011
The NoX router · MICRO 2011
SCARAB: a single cycle adaptive routing and bufferless network · MICRO 2009
Processor architecture and microarchitecture
instruction fetch
0.112014
Revolver: Processor architecture for power efficient loop execution · HPCA 2014
Energy-efficient computing › low-power design
low-power interconnect
0.012011
The NoX router · MICRO 2011

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

simulation · 0.2speculative arbitration · 0.1exclusive-OR coding · 0.1opportunistic processor-side buffering · 0.1circuit switching · 0.1
YearPublicationVenuePosition
2014 Revolver: Processor architecture for power efficient loop execution
abstract
With the rise of mobile and cloud-based computing, modern processor design has become the task of achieving maximum power efficiency at specific performance targets. This trend, coupled with dwindling improvements in single-threaded performance, has led architects to predominately focus on energy efficiency. In this paper we note that for the majority of benchmarks, a substantial portion of execution time is spent executing simple loops. Capitalizing on the frequency of loops, we design an out-of-order processor architecture that achieves an aggressive level of performance while minimizing the energy consumed during the execution of loops. The Revolver architecture achieves energy efficiency during loop execution by enabling “in-place execution” of loops within the processor's out-of-order backend. Essentially, a few static instances of each loop instruction are dispatched to the out-of-order execution core by the processor frontend. The static instruction instances may each be executed multiple times in order to complete all necessary loop iterations. During loop execution the processor frontend, including instruction fetch, branch prediction, decode, allocation, and dispatch logic, can be completely clock gated. Additionally we propose a mechanism to preexecute future loop iteration load instructions, thereby realizing parallelism beyond the loop iterations currently executing within the processor core. Employing Revolver across three benchmark suites, we eliminate 20, 55, and 84% of all frontend instruction dispatches. Overall, we find Revolver maintains performance, while resulting in 5.3%- 18.3% energy-delay benefit over loop buffers or micro-op cache techniques alone.
Mitchell Hayenga, Vignyan Reddy Kothinti Naresh, Mikko H. Lipasti
HPCA1
2014 Sources of error in full-system simulation
abstract
In this work we investigate the sources of error in gem5-a state-of-the-art computer simulator-by validating it against a real hardware platform: the ARM Versatile Express TC2 development board. We design a custom gem5 configuration and make several changes to the simulator itself in order to more closely match the Versatile Express TC2 board. With the modifications we make to the simulator, we are able to achieve a mean percentage runtime error of 5% and a mean absolute percentage runtime error of 13% for the SPEC CPU2006 benchmarks. For the PARSEC benchmarks we achieve a mean percentage runtime error of -11% and -12% for single and dual-core runs respectively, and a mean absolute percentage runtime error of 16% and 17% for single and dual-core runs respectively. While prior work typically considers only runtime accuracy, we extend our investigation to include several key microarchitectural statistics as well, showing that we can achieve accuracy within 20% on average for a majority of them. Much of this error is likely from modeling similar, but not identical components.
Anthony Gutierrez, Joseph Pusdesris, Ronald G. Dreslinski, Trevor N. Mudge, Chander Sudanthi, Christopher D. Emmons, Mitchell Hayenga, Nigel C. Paver
ISPASS7
2011 The NoX router
abstract
Power efficient, low latency interconnects are increasingly important in a computing era dominated by growing core counts and diminishing power budgets. This paper proposes the use of a novel coding-based crossbar architecture to perform packet arbitration in parallel with switch traversal. The use of a lightweight exclusive-OR (XOR) coding scheme enables the productive transmission of packets, without waiting for arbitration, even under contention. For marginal cost compared to fully speculative techniques, switch arbitration latency can be hidden while eliminating power consuming misspeculations, increasing router throughput, and maintaining fairness.
Mitchell Hayenga, Mikko H. Lipasti
MICRO1
2009 SCARAB: a single cycle adaptive routing and bufferless network
abstract
As technology scaling drives the number of processor cores upward, current on-chip routers consume substantial portions of chip area and power budgets. Since existing research has greatly reduced router latency overheads and capitalized on available on-chip bandwidth, power constraints dominate interconnection network design. Recently research has proposed bufferless routers as a means to alleviate these constraints, but to date all designs exhibit poor operational frequency, throughput, or latency. In this paper, we propose an efficient bufferless router which lowers average packet latency by 17.6% and dynamic energy by 18.3% over existing bufferless on-chip network designs. In order to maintain the energy and area benefit of bufferless routers while delivering ultra-low latencies, our router utilizes an opportunistic processor-side buffering technique and an energy-efficient circuit-switched network for delivering negative acknowledgments for dropped packets.
Mitchell Hayenga, Natalie D. Enright Jerger, Mikko H. Lipasti
MICRO1