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

Gregory Chan

dblp:36/3012 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1988
—ORCID · none

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

Systems, architecture and hardware · 1Software 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
Distributed systems · 100%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
fault tolerance
0.021988
Recovery Management in QuickSilver · ACM Trans. Comput. Syst. 1988
Recovery Management in QuickSilver (Extended Abstract) · SOSP 1987
Distributed systems › transaction processing
atomic transactions
0.011988
Recovery Management in QuickSilver · ACM Trans. Comput. Syst. 1988
Distributed systems › fault tolerance › failure recovery
log-based recovery
0.011988
Recovery Management in QuickSilver · ACM Trans. Comput. Syst. 1988
Distributed systems › distributed system architecture
client-server systems
0.011987
Recovery Management in QuickSilver (Extended Abstract) · SOSP 1987
Distributed systems › fault tolerance
failure recovery
0.011987
Recovery Management in QuickSilver (Extended Abstract) · SOSP 1987
Distributed systems › fault tolerance › failure recovery
recovery control
0.011987
Recovery Management in QuickSilver (Extended Abstract) · SOSP 1987
Distributed systems › distributed database
commit protocol
0.011988
Recovery Management in QuickSilver · ACM Trans. Comput. Syst. 1988
Distributed systems
distributed coordination
0.011988
Recovery Management in QuickSilver · ACM Trans. Comput. Syst. 1988

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

client-server model · 0.0transaction management · 0.0recovery primitives · 0.0
YearPublicationVenuePosition
1988 Recovery Management in QuickSilver
abstract
This paper describes QuickSilver, developed at the IBM Almaden Research Center, which usesatomic transactionsas a unified failure recovery mechanism for a client-server structured distributed system. Transactions allow failure atomicity for related activities at a single server or at a number of independent servers. Rather than bundling transaction management into a dedicated language or recoverable object manager, Quicksilver exposes the basic commit protocol and log recovery primitives, allowing clients and servers to tailor their recovery techniques to their specific needs. Servers can implement their own log recovery protocols rather than being required to use a system-defined protocol. These decisions allow servers to make their own choices to balance simplicity, efficiency, and recoverability.
Roger L. Haskin, Yoni Malachi, Wayne Sawdon, Gregory Chan
ACM Trans. Comput. Syst.4
1987 Recovery Management in QuickSilver (Extended Abstract)
abstract
One price of extensibility and distribution, as implemented in QuickSilver, is a more complicated set of failure modes, and the consequent necessity of dealing with them. In traditional operating systems, services (e.g., file, display) are intrinsic pieces of the kernel. Process state is maintained in kernel tables, and the kernel contains explicit cleanup code (e.g., to close files, reclaim memory, and get rid of process images after hardware or software failures). QuickSilver, however, is structured according to the client-server model, and as in many systems of its type, system services are implemented by user-level processes that maintain a substantial amount of client process state. Examples of this state are the open files, screen windows, address space, etc., belonging to a process. Failure resilience in such an environment requires that clients and servers be aware of problems involving each other. Examples of the way one would like the system to behave include having files closed and windows removed from the screen when a client terminates, and having clients see bad return codes (rather than hanging) when a file server crashes. This motivates a number of design goals:
Roger L. Haskin, Yoni Malachi, Wayne Sawdon, Gregory Chan
SOSP4