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

Derek Lockhart

dblp:23/6844 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none

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

Systems, architecture and hardware · 5 · 1 first-authorSoftware engineering, systems software and programming languages · 3 · 1 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
4 papers
Processor architecture and microarchitecture · 38% Hardware accelerators and domain-specific architectures · 20% GPUs and heterogeneous computing · 19%
Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 100%

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

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
data-parallel accelerator
0.332013
Exploring the Tradeoffs between Programmability and Efficiency in Data-Parallel Accelerators · ACM Trans. Comput. Syst. 2013
Exploring the tradeoffs between programmability and efficiency in data-parallel accelerators · ISCA 2011
Microarchitectural mechanisms to exploit value structure in SIMT architectures · ISCA 2013
GPUs and heterogeneous computing › GPU microarchitecture
SIMT architecture
0.322013
Exploring the Tradeoffs between Programmability and Efficiency in Data-Parallel Accelerators · ACM Trans. Comput. Syst. 2013
Microarchitectural mechanisms to exploit value structure in SIMT architectures · ISCA 2013
Processor architecture and microarchitecture › vector processor
vector-thread architecture
0.322013
Exploring the Tradeoffs between Programmability and Efficiency in Data-Parallel Accelerators · ACM Trans. Comput. Syst. 2013
Exploring the tradeoffs between programmability and efficiency in data-parallel accelerators · ISCA 2011
Electronic design automation
hardware simulation
0.212014
PyMTL: A Unified Framework for Vertically Integrated Computer Architecture Research · MICRO 2014
Processor architecture and microarchitecture
SIMD
0.222013
Exploring the tradeoffs between programmability and efficiency in data-parallel accelerators · ISCA 2011
Exploring the Tradeoffs between Programmability and Efficiency in Data-Parallel Accelerators · ACM Trans. Comput. Syst. 2013
Parallel and multicore computing › data parallelism
SIMD vectorization
0.112011
Exploring the tradeoffs between programmability and efficiency in data-parallel accelerators · ISCA 2011
Runtime systems and virtual machines › dynamic compilation
just-in-time compilation
0.112014
PyMTL: A Unified Framework for Vertically Integrated Computer Architecture Research · MICRO 2014
Electronic design automation
design space exploration
0.012011
Exploring the tradeoffs between programmability and efficiency in data-parallel accelerators · ISCA 2011
Parallel and multicore computing › parallel architecture
MIMD architecture
0.012011
Exploring the tradeoffs between programmability and efficiency in data-parallel accelerators · ISCA 2011

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

VLSI implementation · 0.5meta-tracing · 0.4domain-specific language · 0.4JIT specialization · 0.4design space exploration · 0.2cycle-level modeling · 0.2microbenchmarking · 0.1
YearPublicationVenuePosition
2015 Pydgin: generating fast instruction set simulators from simple architecture descriptions with meta-tracing JIT compilers
abstract
Instruction set simulators (ISSs) remain an essential tool for the rapid exploration and evaluation of instruction set extensions in both academia and industry. Due to their importance in both hardware and software design, modern ISSs must balance a tension between developer productivity and high-performance simulation. Productivity requirements have led to “ADL-driven” toolflows that automatically generate ISSs from high-level architectural description languages (ADLs). Meanwhile, performance requirements have prompted ISSs to incorporate increasingly complicated dynamic binary translation (DBT) techniques. Construction of frameworks capable of providing both the productivity benefits of ADL-generated simulators and the performance benefits of DBT remains a significant challenge. We introduce Pydgin, a new approach to ISS construction that addresses the multiple challenges of designing, implementing, and maintaining ADL-generated DBT-ISSs. Pydgin uses a Python-based, embedded-ADL to succinctly describe instruction behavior as directly executable “pseudocode”. These Pydgin ADL descriptions are used to automatically generate high-performance DBT-ISSs by creatively adapting an existing meta-tracing JIT compilation framework designed for general-purpose dynamic programming languages. We demonstrate the capabilities of Pydgin by implementing ISSs for two instruction sets and show that Pydgin provides concise, flexible ISA descriptions while also generating simulators with performance comparable to hand-coded DBT-ISSs.
Derek Lockhart, Berkin Ilbeyi, Christopher Batten
ISPASS1
2014 PyMTL: A Unified Framework for Vertically Integrated Computer Architecture Research
abstract
Technology trends prompting architects to consider greater heterogeneity and hardware specialization have exposed an increasing need for vertically integrated research methodologies that can effectively assess performance, area, and energy metrics of future architectures. However, constructing such a methodology with existing tools is a significant challenge due to the unique languages, design patterns, and tools used in functional-level (FL), cycle-level (CL), and register-transfer-level (RTL) modeling. We introduce a new framework called PyMTL that aims to close this computer architecture research methodology gap by providing a unified design environment for FL, CL, and RTL modeling. PyMTL leverages the Python programming language to create a highly productive domain-specific embedded language for concurrent-structural modeling and hardware design. While the use of Python as a modeling and framework implementation language provides considerable benefits in terms of productivity, it comes at the cost of significantly longer simulation times. We address this performance-productivity gap with a hybrid JIT compilation and JIT specialization approach. We introduce Sim JIT, a custom JIT specialization engine that automatically generates optimized C++ for CL and RTL models. To reduce the performance impact of the remaining unspecialized code, we combine Sim JIT with an off-the-shelf Python interpreter with a meta-tracing JIT compiler (PyPy). Sim JIT+PyPy provides speedups of up to 72× for CL models and 200× for RTL models, bringing us within 4-6× of optimized C++ code while providing significant benefits in terms of productivity and usability.
Derek Lockhart, Gary Zibrat, Christopher Batten
MICRO1
2013 Microarchitectural mechanisms to exploit value structure in SIMT architectures
abstract
SIMT architectures improve performance and efficiency by exploiting control and memory-access structure across data-parallel threads. Value structure occurs when multiple threads operate on values that can be compactly encoded, e.g., by using a simple function of the thread index. We characterize the availability of control, memory-access, and value structure in typical kernels and observe ample amounts of value structure that is largely ignored by current SIMT architectures. We propose three microarchitectural mechanisms to exploit value structure based on compact affine execution of arithmetic, branch, and memory instructions. We explore these mechanisms within the context of traditional SIMT microarchitectures (GP-SIMT), found in general-purpose graphics processing units, as well as fine-grain SIMT microarchitectures (FG-SIMT), a SIMT variant appropriate for compute-focused data-parallel accelerators. Cycle-level modeling of a modern GP-SIMT system and a VLSI implementation of an eight-lane FG-SIMT execution engine are used to evaluate a range of application kernels. When compared to a baseline without compact affine execution, our approach can improve GP-SIMT cycle-level performance by 4-17% and can improve FG-SIMT absolute performance by 20-65% and energy efficiency up to 30% for a majority of the kernels.
Ji Kim, Christopher Torng, Shreesha Srinath, Derek Lockhart, Christopher Batten
ISCA4
2013 Exploring the Tradeoffs between Programmability and Efficiency in Data-Parallel Accelerators
abstract
We present a taxonomy and modular implementation approach for data-parallel accelerators, including the MIMD, vector-SIMD, subword-SIMD, SIMT, and vector-thread (VT) architectural design patterns. We introduce Maven, a new VT microarchitecture based on the traditional vector-SIMD microarchitecture, that is considerably simpler to implement and easier to program than previous VT designs. Using an extensive design-space exploration of full VLSI implementations of many accelerator design points, we evaluate the varying tradeoffs between programmability and implementation efficiency among the MIMD, vector-SIMD, and VT patterns on a workload of compiled microbenchmarks and application kernels. We find the vector cores provide greater efficiency than the MIMD cores, even on fairly irregular kernels. Our results suggest that the Maven VT microarchitecture is superior to the traditional vector-SIMD architecture, providing both greater efficiency and easier programmability.
Yunsup Lee, Rimas Avizienis, Alex Bishara, Richard Xia, Derek Lockhart, Christopher Batten, Krste Asanovic
ACM Trans. Comput. Syst.5
2011 The Maven vector-thread architecture
Yunsup Lee, Rimas Avizienis, Alex Bishara, Richard Xia, Derek Lockhart, Christopher Batten, Krste Asanovic
Hot Chips Symposium5
2011 Exploring the tradeoffs between programmability and efficiency in data-parallel accelerators
abstract
We present a taxonomy and modular implementation approach for data-parallel accelerators, including the MIMD, vector-SIMD, subword-SIMD, SIMT, and vector-thread (VT) architectural design patterns. We have developed a new VT microarchitecture, Maven, based on the traditional vector-SIMD microarchitecture that is considerably simpler to implement and easier to program than previous VT designs. Using an extensive design-space exploration of full VLSI implementations of many accelerator design points, we evaluate the varying tradeoffs between programmability and implementation efficiency among the MIMD, vector-SIMD, and VT patterns on a workload of microbenchmarks and compiled application kernels. We find the vector cores provide greater efficiency than the MIMD cores, even on fairly irregular kernels. Our results suggest that the Maven VT microarchitecture is superior to the traditional vector-SIMD architecture, providing both greater efficiency and easier programmability.
Yunsup Lee, Rimas Avizienis, Alex Bishara, Richard Xia, Derek Lockhart, Christopher Batten, Krste Asanovic
ISCA5