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

Chuang-Hue Moh

dblp:41/5984 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · none

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

Computer networks · 1 · 1 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
2 papers
Storage systems · 100%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems
archival storage
0.012004
TimeLine: A High Performance Archive for a Distributed Object Store · NSDI 2004
Storage systems › object storage
distributed object store
0.012004
TimeLine: A High Performance Archive for a Distributed Object Store · NSDI 2004
Software maintenance and evolution
software updates
0.012003
Lazy modular upgrades in persistent object stores · OOPSLA 2003
Storage systems › object storage
persistent object store
0.012003
Lazy modular upgrades in persistent object stores · OOPSLA 2003
Storage systems
object storage
0.012004
TimeLine: A High Performance Archive for a Distributed Object Store · NSDI 2004

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

object encapsulation · 0.1
YearPublicationVenuePosition
2004 TimeLine: A High Performance Archive for a Distributed Object Store
Chuang-Hue Moh, Barbara Liskov
NSDI1
2003 Lazy modular upgrades in persistent object stores
abstract
Persistent object stores require a way to automatically upgrade persistent objects. Automatic upgrades are a challenge for such systems. Upgrades must be performed in a way that is efficient both in space and time, and that does not stop application access to the store. In addition, however, the approach must be modular: it must allow programmers to reason locally about the correctness of their upgrades similar to the way they would reason about regular code. This paper provides solutions to both problems. The paper first defines upgrade modularity conditions that any upgrade system must satisfy to support local reasoning about upgrades. The paper then describes a new approach for executing upgrades efficiently while satisfying the upgrade modularity conditions. The approach exploits object encapsulation properties in a novel way. The paper also describes a prototype implementation and shows that our upgrade system imposes only a small overhead on application performance.
Chandrasekhar Boyapati, Barbara Liskov, Liuba Shrira, Chuang-Hue Moh, Steven Richman
OOPSLA4