A distributed algorithm for multiple entries to a critical section

“…To facilitate fault tolerance without assuming failure detection, the general mutual exclusion problem has been extended to the k-mutual exclusion one [17], where at most k different processes can concurrently access the same resource; general strategies working in a failure-free environment have been adapted to solve this more general problem in an asynchronous message passing system (e.g. [14], [8]).…”

Section: Related Workmentioning

confidence: 99%

“…Examples of such algorithms in the context of distributed mutual exclusion are ( [14], [16], [17], [18]). A class of algorithms that satisfies the necessary condition of Lemma 1 is the one based on a rotating coordinator approach (also called perpetual circulating token [5], [15]) as shown in the next section.…”

Section: Solvability Issues For O-ma and So-ma Problemsmentioning

confidence: 99%

Oblivious Assignment with m Slots

Ateniese

Baldoni

Bonomi

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Preserving anonymity and privacy of customer actions within a complex software system, such as a cloud computing system, is one of the main issues to be solved in order to boost private computation outsourcing. In this paper, we propose a coordination paradigm, namely oblivious assignment with m slots of a resource R (with m ≥ 1), allowing processes to compete in order to get a slot of R, while ensuring at the same time both fairness in the resource slots assignment and that no process knows which slot of R is assigned to a process. We study oblivious assignment with m slots solvability issues related to the message pattern of the algorithm. We also present a distributed algorithm solving oblivious assignment with m slots within a distributed systems, assuming the existence of at least two honest processes and m ≤ n (where n is the number of processes). The algorithm is based on a rotating token paradigm and employs an adaptation of the ElGamal encryption scheme to work with multiple parties and ensuring obliviousness of the assignment. Finally, the correctness of the algorithm is formally proved.

show abstract

“…Unlike the solution by Fischer et al this solution does not use a powerful read-modified-write primitive. A number of k-exclusion algorithms have been also proposed in the asynchronous network setting [17,28]. The major paradigms for the resource allocation problem on the asynchronous network setting are the permission based ones and the token based ones.…”

Section: Introductionmentioning

confidence: 99%

“…The major paradigms for the resource allocation problem on the asynchronous network setting are the permission based ones and the token based ones. For example, the algorithm proposed by Kakugawa et al [17] and the algorithm proposed by Raymond [28] are permission based.…”

Section: Introductionmentioning

confidence: 99%

Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem

Omori

Obokata

Motegi³

et al. 2002

IIS

View full text Add to dashboard Cite

We analyze two algorithms for the k-exclusion problem on the asynchronous multi-writer/reader shared memory model and show their correctness. The first algorithm is a natural extension of the n-process algorithm by Peterson for the mutual exclusion algorithm to the k-exclusion problem, and the second algorithm is a combination of the first algorithm and the tournament algorithm by Peterson and Fischer for the mutual exclusion problem. These two algorithms satisfy k-exclusion, and can tolerate up to k À 1 process failures of the stopping type. The running times by the first algorithm and by the second algorithm are bounded by ðn À kÞc þ Oðnðn À kÞ 2 Þl and ð n k Þ k c þ Oðð n k Þ kþ1 kÞl, respectively, even if there exist at most k À 1 process failures of the stopping type, where n is the number of processes, l is an upper bound on the time between successive two atomic steps for any faultless process, and c is an upper bound on the time that any user spends in the critical region.

show abstract

A distributed algorithm for multiple entries to a critical section

Cited by 70 publications

References 4 publications

ModelingK-coteries by well-covered graphs

ModelingK-coteries by well-covered graphs

Oblivious Assignment with m Slots

Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem

Contact Info

Product

Resources

About