M. Raynal, Algorithms for Mutual Exclusion, MIT press, 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....words, the robotic system needs to treat the parts bin as a critical section which both arms access in a mutually exclusive manner. q 1 q 1 A2 A1 B PB D1 D2 x y Figure 1: Free Floating Robotic System A candidate solution to the mutual exclusion problem can be readily developed [58] [59] [62] Let s assume that each arm is controlled by a computer process (an instantiation of the arm control program) We therefore have two concurrently running computer processes that need to coordinate their actions if they are to ensure the physical system (i.e. the robotic arms) enters the ....

Raynal, M., Algorithms for mutual exclusion, MIT Press, 1986.

....on philosophers in attending the same forum when no other philosophers is interested in a different forum. For example, solutions that simply adopt a conventional n process mutual exclusion algorithm for the problem are obviously an overkill. For a survey of such algorithms see the books [8, 1, 12, 7]. Moreover, solutions that may allow philosophers to be in a forum simultaneously, but still require them to compete with one another in some mutually exclusive style in order to enter the meeting room are also not proper to this problem. As usual, we are interested in completely decentralized ....

M. Raynal. Algorithms for Mutual Exclusion. MIT Press, 1986.

....Our focus in this paper will be on the third approach to predicate detection. Control of distributed computations can be at various levels. So far, the literature has focussed mainly on the most basic form of control: deterministic replaying of distributed computations to recreate failures [10, 14]. This leads to a debugging cycle consisting of passive observation and computation replaying. We believe that a more effective and active debugging method would involve instead a cycle of observation followed by controlled replaying based on observation [17] We may classify control into on line ....

M. Raynal. Algorithms for mutual exclusion. MIT Press, 1986.

....to deploy server replicas across an asynchronous distributed system such as the Internet. 1 Introduction Distributed agreement among processes is one of the fundamental building blocks for the solution of many important problems in asynchronous distributed sys tems, e.g. mutual exclusion[9] and replication[10,3,8] As an example, in the context of software replication replicas have to run a distributed agreement protocol in order to maintain replica consistency. In particular, in the case of ac tive replication[10] the agreement problem reduces to the total order multicast problem ....

M. Raynal. Algorithms for Mutual Exclusion. MIT Press, 1986.

....several applications, including many communications protocols, such as the IEEE 1394 firewire, the sliding window protocol, the bounded retransmission protocol, etc. As an example of the capabilities, we here report on the use of our prototype on two small systems, viz. Lamport s Bakery Protocol [25], and the Alternating Bit Protocol [3] Both systems have infinite state spaces due to the use of infinite data domains, and the properties we are interested in are both liveness and safety properties. We first briefly introduce the two systems, and the properties we study. Bakery Protocol The ....

M. Raynal. Algorithms for Mutual Exclusion. North Oxford Academic, 1986.

....The problem requires that at most K nodes be in a critical section (CS) at any given time. The proposed algorithm achieves this using K tokens; only a process in possession of a token may enter the critical section. Although there has been extensive research on distributed 1 mutual exclusion [13, 18, 4, 11, 10, 16, 15, 2, 3, 5, 6, 9, 7, 12, 17], research on distributed K mutual exclusion (K 1) is limited [19, 20, 21, 22] Our approach for K mutual exclusion is derived by improving and extending the 1mutual exclusion algorithm by Trehel and Naimi [12] The proposed algorithm is compared with three other distributed K mutual exclusion ....

....the token queue that has its tag field NULL( Gamma) If none of the tag fields are NULL, then pointer[t] of node I is set equal to A, which is at the head of the token queue. Example: If node I has token 2 with the token queue shown in Figure 1, then it sends the token to node 3 and sets pointer[2] equal to 9 (the last node on the token queue that has its tag field NULL) If none of the tag fields were NULL then, node I would have set pointer[2] equal to 3 (the node at the head of the token queue) Handle INFORM(Y; t) This procedure is executed when the node receives an INFORM message ....

[Article contains additional citation context not shown here]

M. Raynal, Algorithms for Mutual Exclusion. Cambridge, MA: MIT Press, 1st ed., 1986.

....only on local memory. We use semaphore to mean a word of memory that is accessed using test and set with exponential backoff; we do not use test and test an set, as we do not assume the presence of caches. x The literature describes several different fairness conditions that can be implemented [3, 8, 16]: first come first serve, reader priority, and fair readers priority are but a few. We have not implemented any of these conditions, as we consider fairness to be a secondary concern. The addition of fairness constraints would involve additional synchronization, which would probably lead to a ....

M. Raynal. Algorithms for Mutual Exclusion. MIT Press, 1986, pages 90-97.

....the intersection property, if every two sets S; R 2 S have a nonempty intersection. Set systems with the intersection property are known as quorum systems, and the sets in such a system are called quorums. Quorum systems have been used in the study of problems such as mutual exclusion (cf. [39]) data replication protocols (cf. 7, 18] name servers (cf. 32] selective dissemination of information (cf. 46] and distributed access control and signatures (cf. 34] A protocol template based on quorum systems works as follows. In order to perform some action (e.g. update the ....

M. Raynal, Algorithms for Mutual Exclusion, MIT press, 1986.

....architecture, a basic issue like the synchronization among processes spread over the computer network has to be faced. Synchronization in the presence of failures is the fundamental building block for the solution of many important problems in distributed systems such as mutual exclusion ([20]) and replication ( 13] just to name a few. Synchronization in mutual exclusion is needed to get a total order on critical section accesses while in replication to get the same total order of updates at each replica . In the context of a closed group, the solutions proposed for this class of ....

M. Raynal, Algorithms for Mutual Exclusion, MIT Press, 1986. 18

....Mutual Exclusion: Major Research Trends Since 1986 James H. Anderson and Yong Jik Kim Department of Computer Science University of North Carolina at Chapel Hill June 2001 Abstract In 1986, Michel Raynal published a comprehensive survey of algorithms for mutual exclusion [54]. In this paper, we survey major research trends since 1986 in work on shared memory mutual exclusion. Keywords: Adaptive mutual exclusion, atomicity, fast mutual exclusion, group mutual exclusion, k exclusion, local spinning, sequential consistency, shared memory systems, time complexity 1 ....

....published by Knuth in 1966 was the rst starvation free solution [37] In the years since the publication of Dijksta s and Knuth s algorithms, a great many other algorithms have been proposed. Many of these algorithms are described in a survey on the topic published by Michel Raynal in 1986 [54]. In this paper, we supplement Raynal s survey of shared memory algorithms by considering research conducted since its publication. Raynal s book also discusses message passing algorithms, which are not considered here. Taken together, these two surveys should provide readers with a ....

M. Raynal. Algorithms for Mutual Exclusion. The MIT Press, Cambridge, Massachusetts, 1986.

....as well as transient faults, which the solution in [12] does not. In this work we present for the rst time a self stabilizing exclusion algorithm. A preliminary version of this paper appears in [3] The common shared memory model is the one considered in most works on mutual exclusion (e.g. [21, 23, 24, 26]) and this is also the model employed here in our solution. Our algorithm uses single writer multi reader regular registers which are of weaker type and therefore easier to implement than the basic atomic register. These types of registers were de ned by Lamport in [20] The traditional ....

M. Raynal, Algorithms for Mutual Exclusion, MIT Press, 1986.

....used and which ones not. 1. Introduction Reachability of states is one of the key problems in the area of automatic verification. Most safety properties of systems can be reduced to simple reachability properties; a typical example is the mutual exclusion property of mutual exclusion algorithms [Ray86]. When systems are presented as automata communicating through rendez vous or through bounded buffers, as synchronous products of transition # This work was partially supported by the project Advanced Validation Techniques for Telecommunication Protocols of the Information Societies Technology ....

M. Raynal. Algorithms For Mutual Exclusion, 1986.

....the other three problems. The algorithm takes O(np) time, where n is the number of concurrent processes and p is the number of critical sections. The problems have been termed off line problems to distinguish them from their more popular on line variants (i.e. the usual mutual exclusion problems [14]) The difference between the on line and off line problems is that in the online case, the computation is provided on line, whereas in the off line case, the computation is known a priori . Ignorance of the future makes on line mutual exclusion a harder problem to solve. In general, in on line ....

M. Raynal. Algorithms for mutual exclusion. MIT Press, 1986.

....exclusion problems are fundamental problems in distributed systems, and # This work is supported in part by the Ministry of Education, Science and Culture under grant No. 11780229 and 10205221. they have been investigated extensibly. For example, the mutual exclusion problem is investigated in [19, 27, 21, 29, 26, 1, 25], and the leader election problem is investigated in [20, 6, 9, 12, 24, 30] The concept of self stabilization is introduced by Dijkstra in [8] A distributed system is said to be self stabilizing if it converges to a correct system state from arbitrary initial system states. A self stabilizing ....

Michel Raynal. Algorithms for Mutual Exclusion. North Oxford Academic, 1986. (Translated by D. Beeson).

No context found.

M. Raynal, Algorithms for Mutual Exclusion, MIT press, 1986.

No context found.

M. Raynal and D. Beeson. Algorithms for mutual exclusion. MIT Press, Cambridge, MA, USA, 1986.

No context found.

M. Raynal. Algorithms For Mutual Exclusion, 1986.

No context found.

M. Raynal. Algorithms For Mutual Exclusion, 1986.

No context found.

M. Raynal. Algorithms for Mutual Exclusion. MIT Press, 1986.

No context found.

M. Raynal. Algorithms for Mutual Exclusion. MIT Press, Cambridge, Massachusetts, 1986.

No context found.

Raynal, M. Algorithms for Mutual Exclusion. MIT Press, Cambridge, MA, 1986, 107.

No context found.

M. Raynal. Algorithms for Mutual Exclusion. The MIT Press, Cambridge, Massachusetts, 1986.

No context found.

M. Raynal, Algorithms for Mutual Exclusion, North Oxford Academic, 1986.

No context found.

) Raynal, M.: Algorithms for Mutual Exclusion, North Oxford Academic (1986). (Translated by D. Beeson).

No context found.

Michel Raynal. Algorithms for Mutual Exclusion. North Oxford Academic, 1886. (Translated by D. Beeson).

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC