Zobrazeno 1 - 10
of 461
pro vyhledávání: '"Kulkarni, Sandeep"'
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. By context-aware data structures, we mean that the result of an opera
Externí odkaz:
http://arxiv.org/abs/2404.10151
Lattice-linear systems allow nodes to execute asynchronously. We introduce eventually lattice-linear algorithms, where lattices are induced only among the states in a subset of the state space. The algorithm guarantees that the system transitions to
Externí odkaz:
http://arxiv.org/abs/2311.09760
Autor:
Lagwankar, Ishaan, Kulkarni, Sandeep S
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 properties of interest may not be feasible in an online environment. These p
Externí odkaz:
http://arxiv.org/abs/2311.07842
In this paper, we study the problem of gathering distance-1 myopic robots on an infinite triangular grid. We show that the algorithm developed by Goswami et al. (SSS, 2022) is lattice-linear (cf. Gupta and Kulkarni, SRDS 2023). This implies that a di
Externí odkaz:
http://arxiv.org/abs/2307.13080
Consider the execution of a sequential algorithm that requires the program to converge to an optimal state, and then terminate/stutter. To design such an algorithm, we need to ensure that the state space that it traverses forms a directed acyclic gra
Externí odkaz:
http://arxiv.org/abs/2302.14834
In this article, we study some parallel processing algorithms for multiplication and modulo operations. We demonstrate that the state transitions that are formed under these algorithms satisfy lattice-linearity, where these algorithms induce a lattic
Externí odkaz:
http://arxiv.org/abs/2302.07207
Autor:
Sperling, Luke, Kulkarni, Sandeep S
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. Average consensus is a popular form of consensus, where the agreed u
Externí odkaz:
http://arxiv.org/abs/2301.11882
Lattice-linearity was introduced as modelling problems using predicates that induce a lattice among the global states (Garg, SPAA 2020). Such modelling enables permitting asynchronous execution in multiprocessor systems. A key property of \textit{the
Externí odkaz:
http://arxiv.org/abs/2210.03055
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 algorithms}. A property of these algorithms is that they induce a partia
Externí odkaz:
http://arxiv.org/abs/2209.14703