6 citations · 7 across the 5 of their papers we have counts for
5 papers
Replay Clocks
Ishaan Lagwankar, Sandeep S Kulkarni
In this work, we focus on the problem of replay clocks (RepCL). The need for replay clocks arises from the observation that analyzing distributed computation for all desired proper…
Privacy-Preserving Methods for Outlier-Resistant Average Consensus and Shallow Ranked Vote Leader Election
Luke Sperling, Sandeep S Kulkarni
Consensus and leader election are fundamental problems in distributed systems. Consensus is the problem in which all processes in a distributed computation must agree on some value…
Fully Lattice Linear Algorithms
Arya Tanmay Gupta, Sandeep S Kulkarni
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear al…
Impact of the Consistency Model on Checkpointing of Distributed Shared Memory
Sandeep Kulkarni, Duong Nguyen, Lewis Tseng +1
In this report, we consider the impact of the consistency model on checkpointing and rollback algorithms for distributed shared memory. In particular, we consider specific implemen…
GentleRain+: Making GentleRain Robust on Clock Anomalies
Mohammad Roohitavaf, Sandeep Kulkarni
Causal consistency is in an intermediate consistency model that can be achieved together with high availability and high performance requirements even in presence of network partit…