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

Rammohan Kordale

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

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

Systems, architecture and hardware · 2 · 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 · 83% Memory systems · 17%

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

TopicWeightPapersLastEvidence papers
Distributed systems
consistency protocols
0.011999
Scalable Consistency Protocols for Distributed Services · IEEE Trans. Parallel Distributed Syst. 1999
Distributed systems
replication
0.011999
Scalable Consistency Protocols for Distributed Services · IEEE Trans. Parallel Distributed Syst. 1999
Distributed systems › replication
server replication
0.011999
Scalable Consistency Protocols for Distributed Services · IEEE Trans. Parallel Distributed Syst. 1999
Memory systems
cache coherence
0.011999
Scalable Consistency Protocols for Distributed Services · IEEE Trans. Parallel Distributed Syst. 1999
Memory systems › cache management › storage caching
client-side caching
0.011999
Scalable Consistency Protocols for Distributed Services · IEEE Trans. Parallel Distributed Syst. 1999

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

local consistency protocol · 0.0invalidation-based consistency · 0.0
YearPublicationVenuePosition
1999 Scalable Consistency Protocols for Distributed Services
abstract
A common way to address scalability requirements of distributed services is to employ server replication and client caching of objects that encapsulate the service state. The performance of such a system could depend very much on the protocol implemented by the system to maintain consistency among object copies. We explore scalable consistency protocols that never require synchronization and communication between all nodes that have copies of related objects. We achieve this by developing a novel approach called local consistency (LC). LC based protocols can provide increased flexibility and efficiency by allowing nodes control over how and when they become aware of updates to cached objects. We develop two protocols for implementing strong consistency using this approach and demonstrate that they scale better than a traditional invalidation based consistency protocol along the system load and geographic distribution dimensions of scale.
Mustaque Ahamad, Rammohan Kordale
IEEE Trans. Parallel Distributed Syst.2
1996 A Scalable Technique for Implementing Multiple Consistency Levels for Distributed Objects
abstract
In large scale distributed systems, caching and replication could greatly speedup access and increase availability. Consistency of replicated state can be guaranteed by forcing operations to occur in the same order at all sites. However some applications can preserve correctness with weaker consistency requirements leading to better performance. We propose an object lifetime based mutual consistency detection mechanism that is used to implement multiple consistency levels. This mechanism provides scalable implementations because caching overheads at client nodes depend only on the accesses done at the node. A contribution of this paper is the separation of the the mutual consistency detection mechanism from the policy that decides the desired consistency guarantees. This allows multiple consistency levels to coexist, thus improving system performance through the use of weaker consistency levels when possible. Besides improving performance, the mechanism allows for a graceful weakening of consistency requirements when stronger requirements cannot be maintained, as in the case of disconnection that can be experienced in mobile environments. The mutual consistency detection mechanism also provides a uniform way of hoarding a mutually consistent set of objects during voluntary disconnection.
Rammohan Kordale, Mustaque Ahamad
ICDCS1