Distributed Computing
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity
Distributed Computing - Tập 36 - Trang 89-106 - 2022
This work consideres asynchronous shared memory systems in which any number of processes may crash. It identifies relaxations of fetch & increment, queues, sets and stacks that can be non-blocking or wait-free implemented using only Read/Write operations, without Read-After-Write synchronization patterns. Set-linearizability, a generalization of linearizability designed to specify concurrent behav......
On deadlocks of exclusive AND-requests for resources
Distributed Computing - Tập 9 - Trang 77-94 - 1995
Although there are numerous concurrency control algorithms and they use a variety of techniques, there is an underlying serializability theory that serves both as a basis for analyzing their correctness and as a guide for designing new protocols. Following this paradigm, this paper proposes a uniform framework for characterizing and developing distributed deadlock-related algorithms. The system co......
Distributed data clustering in sensor networks
Distributed Computing - Tập 24 - Trang 207-222 - 2011
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., a local sensor read, and a concise picture of the global system state needs to be obtained. In resource-constrained environments like sensor networks, this needs to be done without collecting all the data at any location,......
Self-stabilizing gathering of mobile robots under crash or Byzantine faults
Distributed Computing - Tập 33 - Trang 393-421 - 2019
Gathering is a fundamental coordination problem in cooperative mobile robotics. In short, given a set of robots with arbitrary initial locations and no initial agreement on a global coordinate system, gathering requires that all robots, following their algorithm, reach the exact same but not predetermined location. Gathering is particularly challenging in networks where robots are oblivious (i.e.,......
Property testing of planarity in the CONGEST model
Distributed Computing - Tập 34 - Trang 15-32 - 2020
We give a distributed algorithm in the CONGEST model for property testing of planarity with one-sided error in general (unbounded-degree) graphs. Following Censor-Hillel et al. (Proceedings of the 30th International Symposium on Distributed Computing, pp. 43–56, 2016), who recently initiated the study of property testing in the distributed setting, our algorithm gives the following guarantee: For ......
On the uncontended complexity of anonymous agreement
Distributed Computing - Tập 30 - Trang 459-468 - 2017
In this paper, we study uncontended complexity of anonymous k-set agreement algorithms, counting the number of memory locations used and the number of memory updates performed in operations that encounter no contention. We assume that in contention-free executions of a k-set agreement algorithm, only “fast” read and write operations are performed, and more expensive synchronization primitives, suc......
Competitive throughput in multi-hop wireless networks despite adaptive jamming
Distributed Computing - Tập 26 Số 3 - Trang 159-171 - 2013
This article presents a simple local medium access control protocol, called Jade, for multi-hop wireless networks with a single channel that is provably robust against adaptive adversarial jamming. The wireless network is modeled as a unit disk graph on a set of nodes distributed arbitrarily in the plane. In addition to these nodes, there are adversarial jammers that know the protocol and its enti......
Safety assurance via on-line monitoring
Distributed Computing - Tập 16 - Trang 269-277 - 2003
This paper proposes a new approach and new techniques for on-line monitoring of concurrent programs to ensure that some of their safety properties are not violated. The techniques modify erroneous systems, which violate a certain safety property, into new systems which satisfy the safety property. It does so by adding a new layer that controls the scheduling of steps in the system. We formally cha......
Randomized proof-labeling schemes
Distributed Computing - Tập 32 - Trang 217-234 - 2018
Proof-labeling schemes, introduced by Korman et al. (Distrib Comput 22(4):215–233, 2010.
https://doi.org/10.1007/s00446-010-0095-3......
Tổng số: 554
- 1
- 2
- 3
- 4
- 5
- 6
- 10