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

John Eberhard

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

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

Software engineering, systems software and programming languages · 2 · 2 first-authorSystems, architecture and hardware · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › consistency models
cache consistency
0.112010
Semantics-Based Object Caching in Distributed Systems · IEEE Trans. Parallel Distributed Syst. 2010
Distributed systems
distributed caching
0.112010
Semantics-Based Object Caching in Distributed Systems · IEEE Trans. Parallel Distributed Syst. 2010
Distributed systems
object caching
0.112010
Semantics-Based Object Caching in Distributed Systems · IEEE Trans. Parallel Distributed Syst. 2010

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

theorem proving · 0.1semantic specification · 0.1
YearPublicationVenuePosition
2010 Semantics-Based Object Caching in Distributed Systems
abstract
In order to utilize the semantics of object methods to ensure cached object consistency, method group commutativity specifies the conditions under which a group of methods will commute. Method group commutativity is determined using a semantic specification of object methods, provided in terms of logical expressions, to create commutativity conjectures that are analyzed using the PVS theorem prover. This analysis results in the creation of a method commutativity specification (MCS), which is used by a distributed caching system to ensure the consistency of method invocations. For greater commutativity, weaker consistency requirements can be specified in the MCS. This base approach is enhanced by optimizations that consider a client's sequential execution of methods and that reduce the amount of data cached by the client. The effectiveness of method group commutativity and associated optimizations is evaluated using Java RMI application benchmarks.
John Eberhard, Anand R. Tripathi
IEEE Trans. Parallel Distributed Syst.1
2007 Mechanisms for object caching in distributed applications using Java RMI
abstract
Abstract Remote Method Invocation (RMI), a mechanism to access remote objects in Java‐based distributed applications, uses network communication for each method invocation. Consequently, using RMI in a wide‐area environment can cause poor application performance. One solution to improve performance is to cache the objects such that network communication is not necessary for each method invocation. In this paper, we present mechanisms to transparently add object caching to RMI. These mechanisms are compatible with existing RMI applications and use an event‐based model to support different consistency policies. The mechanisms also include the ability to adaptively select the consistency policy for an object based on its usage pattern. A novel feature of our mechanisms is the use of a ‘reduced object’, which is a partial representation of the RMI object. We experimentally evaluate and demonstrate the benefits of our mechanisms. Copyright © 2006 John Wiley & Sons, Ltd.
John Eberhard, Anand R. Tripathi
Softw. Pract. Exp.1
2001 Efficient Object Caching for Distributed Java RMI Applications
John Eberhard, Anand R. Tripathi
Middleware1