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

Joshua J. Bloch

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

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

Systems, architecture and hardware · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › replication › data replication
replicated directory
0.011987
A weighted voting algorithm for replicated directories · J. ACM 1987
Distributed systems
replication
0.011987
A weighted voting algorithm for replicated directories · J. ACM 1987
Distributed systems › quorum systems
weighted voting
0.011987
A weighted voting algorithm for replicated directories · J. ACM 1987
Distributed systems
fault tolerance
0.011987
A weighted voting algorithm for replicated directories · J. ACM 1987

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

simulation · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
1989 The Camelot library: A C language extension for programming a general purpose distributed transaction system
abstract
The Camelot library extends the programming language to provide a high-level programming interface to Camelot, a general-purpose distributed transaction system. The Camelot library is implemented as a collection of C functions and macros. The interface presented by the library also provides a concise high-level model of the services offered by a general-purpose transaction system. A broad overview of the interface is given, and implementation experience is briefly summarized.>
Joshua J. Bloch
ICDCS1
1987 A weighted voting algorithm for replicated directories
abstract
Weighted voting is used as the basis for a replication technique for directories. This technique affords arbitrarily high data availability as well as high concurrency. Efficient algorithms are presented for all of the standard directory operations. A structural property of the replicated directory that permits the construction of an efficient algorithm for deletion is proven. Simulation results are presented and the system is modeled and analyzed. The analysis agrees well with the simulation, and the space and time performance are shown to be good for all configurations of the system.
Joshua J. Bloch, Dean S. Daniels, Alfred Z. Spector
J. ACM1