Zobrazeno 1 - 10
of 406
pro vyhledávání: '"ATTIYA, HAGIT"'
Publikováno v:
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing (PODC 2024). 14-24
A data structure is called history independent if its internal memory representation does not reveal the history of operations applied to it, only its current state. In this paper we study history independence for concurrent data structures, and esta
Externí odkaz:
http://arxiv.org/abs/2403.14445
A powerful tool for designing complex concurrent programs is through composition with object implementations from lower-level primitives. Strongly-linearizable implementations allow to preserve hyper-properties, e.g., probabilistic guarantees of rand
Externí odkaz:
http://arxiv.org/abs/2402.13618
Auditability allows to track all the read operations performed on a register. It abstracts the need of data owners to control access to their data, tracking who read which information. This work considers possible formalizations of auditing and their
Externí odkaz:
http://arxiv.org/abs/2308.16600
Autor:
Attiya, Hagit, Welch, Jennifer L.
Algorithms to solve fault-tolerant consensus in asynchronous systems often rely on primitives such as crusader agreement, adopt-commit, and graded broadcast, which provide weaker agreement properties than consensus. Although these primitives have a s
Externí odkaz:
http://arxiv.org/abs/2308.04646
The paper compares two generic techniques for deriving lower bounds and impossibility results in distributed computing. First, we prove a speedup theorem (a-la Brandt, 2019), for wait-free colorless algorithms, aiming at capturing the essence of the
Externí odkaz:
http://arxiv.org/abs/2308.04213
Recoverable algorithms tolerate failures and recoveries of processes by using non-volatile memory. Of particular interest are self-implementations of key operations, in which a recoverable operation is implemented from its non-recoverable counterpart
Externí odkaz:
http://arxiv.org/abs/2308.03485
The famous asynchronous computability theorem (ACT) relates the existence of an asynchronous wait-free shared memory protocol for solving a task with the existence of a simplicial map from a subdivision of the simplicial complex representing the inpu
Externí odkaz:
http://arxiv.org/abs/2301.13837
HPC systems are a critical resource for scientific research. The increased demand for computational power and memory ushers in the exascale era, in which supercomputers are designed to provide enormous computing power to meet these needs. These compl
Externí odkaz:
http://arxiv.org/abs/2204.11584
Autor:
Attiya, Hagit, Schiller, Noa
Publikováno v:
CIAC 13 (2023) 52-66
This paper presents fault-tolerant asynchronous Stochastic Gradient Descent (SGD) algorithms. SGD is widely used for approximating the minimum of a cost function $Q$, as a core part of optimization and learning algorithms. Our algorithms are designed
Externí odkaz:
http://arxiv.org/abs/2202.10862