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

Harrison Metzger

dblp:60/10322 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

Software 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.

Software engineering, system software, and programming languages
1 paper
Operating systems · 100%
Network and information security
1 paper
Systems and software security · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › system security › operating system security › protection mechanism › isolation
memory isolation
0.112011
Ribbons: a partially shared memory programming model · OOPSLA 2011
Operating systems › resource management › memory management
memory protection
0.112011
Ribbons: a partially shared memory programming model · OOPSLA 2011
Operating systems › system security › operating system security › protection mechanism
protection domains
0.112011
Ribbons: a partially shared memory programming model · OOPSLA 2011
Systems and software security › operating system security
privilege separation
0.012011
Ribbons: a partially shared memory programming model · OOPSLA 2011

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

memory protection mechanisms · 0.2
YearPublicationVenuePosition
2011 Ribbons: a partially shared memory programming model
abstract
The need for programs to execute subcomponents in isolation from each other or with lower privileges is prevalent among today's systems. We introduce ribbons: a shared memory programming model that allows for more implicit sharing of memory than processes but is more restrictive than threads. Ribbons structure the heap into protection domains. Privileges between these protection domains are carefully controlled in order to confine computation. We propose RibbonJ, a backwards-compatible extension of Java, to easily create or port programs to use the ribbons model. We study the progress and isolation properties of a subset of the language. Building on JikesRVM we implement ribbons by leveraging existing memory protection mechanisms in modern hardware and operating systems, avoiding the overhead of inline security checks and read or write barriers. We evaluate efficiency via microbenchmarks and the DaCapo suite, observing minor overhead. Additionally, we refactor Apache Tomcat to use ribbons for application isolation, discuss the refactoring's design and complexity, and evaluate performance using the SPECweb2009 benchmark.
Kevin J. Hoffman, Harrison Metzger, Patrick Eugster
OOPSLA2