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

Zev Weiss

dblp:135/6818 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2018
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 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
2 papers
Memory systems · 31% Cloud and datacenter computing · 31% Storage systems · 24%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Memory systems
non-volatile memory
0.212015
ANViL: Advanced Virtualization for Modern Non-Volatile Memory Devices · FAST 2015
Cloud and datacenter computing
virtualization
0.212015
ANViL: Advanced Virtualization for Modern Non-Volatile Memory Devices · FAST 2015
Storage systems
i/o workload replay
0.212013
ROOT: replaying multithreaded traces with resource-oriented ordering · SOSP 2013
Operating systems › resource management
memory management
0.112015
ANViL: Advanced Virtualization for Modern Non-Volatile Memory Devices · FAST 2015
Performance modeling and evaluation › simulation
trace replay
0.012013
ROOT: replaying multithreaded traces with resource-oriented ordering · SOSP 2013
Performance modeling and evaluation
workload characterization
0.012013
ROOT: replaying multithreaded traces with resource-oriented ordering · SOSP 2013

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

trace replay · 0.2resource-oriented ordering · 0.2
YearPublicationVenuePosition
2018 DenseFS: a Cache-Compact Filesystem
Zev Weiss, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
HotStorage1
2015 ANViL: Advanced Virtualization for Modern Non-Volatile Memory Devices
Zev Weiss, Sriram Subramanian, Swaminathan Sundararaman, Nisha Talagala, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
FAST1
2013 ROOT: replaying multithreaded traces with resource-oriented ordering
abstract
We describe ROOT, a new method for incorporating the nondeterministic I/O behavior of multithreaded applications into trace replay. ROOT is the application of Resource-Oriented Ordering to Trace replay: actions involving a common resource are replayed in an order similar to that of the original trace. ROOT is based on the idea that how a program manages resources, as seen in a trace, provides hints about an application's internal dependencies. Inferring these dependencies allows us to partially constrain trace replay in a way that reflects the constraints of the original program. We make three contributions: (1) we describe the ROOT approach, (2) we release ARTC, a new ROOT-based tool for replaying I/O traces, and (3) we create Magritte, a file-system benchmark suite generated by applying ARTC to 34 Apple desktop application traces. When collecting traces on one platform and replaying on another, ARTC achieves an average timing inaccuracy of 10.6% on our benchmark workloads, halving the 21.3% achieved by the next-best replay method we evaluate.
Zev Weiss, Tyler Caraza-Harter, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
SOSP1