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

Thomas W. Barr

dblp:63/8277 · DBLP profile ↗
← Back
4ranked-venue papers
4as 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 · 4 · 4 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
4 papers
Memory systems · 100%
Software engineering, system software, and programming languages
2 papers
Runtime systems and virtual machines · 72% Operating systems · 28%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems › memory management › virtual memory
address translation
0.222011
SpecTLB: a mechanism for speculative address translation · ISCA 2011
Translation caching: skip, don't walk (the page table) · ISCA 2010
Memory systems › memory management
virtual memory
0.222011
SpecTLB: a mechanism for speculative address translation · ISCA 2011
Translation caching: skip, don't walk (the page table) · ISCA 2010
Runtime systems and virtual machines
language runtime
0.112012
Design and Implementation of an Embedded Python Run-Time System · USENIX ATC 2012
Operating systems › special-purpose operating system
embedded operating system
0.112014
Medusa: Managing Concurrency and Communication in Embedded Systems · USENIX ATC 2014
Memory systems › memory management › virtual memory
huge pages
0.012011
SpecTLB: a mechanism for speculative address translation · ISCA 2011
Memory systems › memory management › virtual memory
page table walk
0.012010
Translation caching: skip, don't walk (the page table) · ISCA 2010

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

simulation · 0.1
YearPublicationVenuePosition
2014 Medusa: Managing Concurrency and Communication in Embedded Systems
Thomas W. Barr, Scott Rixner
USENIX ATC1
2012 Design and Implementation of an Embedded Python Run-Time System
Thomas W. Barr, Scott Rixner
USENIX ATC1
2011 SpecTLB: a mechanism for speculative address translation
abstract
Data-intensive computing applications are using more and more memory and are placing an increasing load on the virtual memory system. While the use of large pages can help alleviate the overhead of address translation, they limit the control the operating system has over memory allocation and protection. We present a novel device, the SpecTLB, that exploits the predictable behavior of reservation-based physical memory allocators to interpolate address translations.
Thomas W. Barr, Alan L. Cox, Scott Rixner
ISCA1
2010 Translation caching: skip, don't walk (the page table)
abstract
This paper explores the design space of MMU caches that accelerate virtual-to-physical address translation in processor architectures, such as x86-64, that use a radix tree page table. In particular, these caches accelerate the page table walk that occurs after a miss in the Translation Lookaside Buffer. This paper shows that the most effective MMU caches are translation caches, which store partial translations and allow the page walk hardware to skip one or more levels of the page table.
Thomas W. Barr, Alan L. Cox, Scott Rixner
ISCA1