4 papers · 1 filter
Domain Extension of Lock-Freedom and Wait-Freedom for Group Computations
Raaghav Ravishankar, Sandeep Kulkarni, Sathya Peri +3
A domain extension of a definition refers to broadening the scope of a definition so that it applies to a larger set of cases than originally specified. The notion of lock-free and…
Asynchronous Checkpoint for Eventually Consistent Databases
Raaghav Ravishankar, Sandeep Kulkarni, Nitin H Vaidya
We focus on the problem of checkpointing (or taking a snapshot) in fully replicated eventually consistent distributed databases. In particular, we consider the problem of taking Di…
Lock-free Asynchronously Distributed Linked Lists
Raaghav Ravishankar, Sandeep Kulkarni, Sathya Peri +1
Modern databases use dynamic search structures that store an enormous amount of data, and often serve them using multi-threaded algorithms to support the ever-increasing throughput…
Distributing Context-Aware Shared Memory Data Structures: A Case Study on Singly-Linked Lists
Raaghav Ravishankar, Sandeep Kulkarni, Sathya Peri +1
In this paper, we study the partitioning of a context-aware shared memory data structure so that it can be implemented as a distributed data structure running on multiple machines.…