M. Maekawa. A # n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3:145--159, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Scalable Quorum Based Location Update Scheme for.. - Stojmenovic, Peña (1999) (11 citations) (Correct)
....related to this paper. Given a set S of n servers, a quorum system is a set of mutually disjoint subsets of S whose union is S. When one of servers require information from the other, it suffices to query one server from each quorum. It is possible to form quorums of size approximately n [M]. For example, 25 servers can be organized into 5 rows and 5 columns. Each column serves as a quorum. Thus each node (i,j) located in i th row and j th column) replicated its data to all servers (i ,j) in its column. To extract the information from server (i,j) server (i , j ) may inquire ....
M. Maekawa, A n algorithm for mutual exclusion in decentralized systems, ACM Transactions on Computer Systems, 14-159, May 1985.
On Delay Optimization in Quorum Consensus - Lin (2001) (1 citation) (Correct)
....data consistency. Recent developments in quorum consensus are mainly focused on 1) minimizing the total communication costs for processing a given set of transactions, and 2) minimizing the number of remote sites to be communicated while assembling a quorum. A number of quorum consensus protocols [5, 9, 11, 13, 14, 15, 16, 17, 20, 21] have been developed for these purposes. Note that in quorum consensus, since messages are sent (possibly by the multicast mechanism [18] to the multiple nodes in a quorum in order to ensure consistency of the operations the delays by passing messages through a long distance communication ....
M. Maekawa, A # N Algorithm for Mutual Exclusion in Decentralized Systems, ACM Transactions on Computer Systems, 3(2), 145-159, 1985.
Scalable and Dynamic Quorum Systems - Naor, Wieder (2003) (6 citations) (Correct)
.... System: A possible simplification of the Dynamic Paths system is as follows: Define a quorum set to be all the (elements identified with) cells that intersect the same horizontal and vertical line (see Figure 7) This quorum system is a dynamic adaptation of a quorum system suggested by Maekawa [11]. A slight improvement was suggested by Agrawal et al. in [1] where instead of looking at horizontal and vertical lines, they examine diagonal lines that resemble the paths of billiard balls. Theorem 4.2 implies that the load of these quorum systems is #( The integrity of these systems could ....
Mamoru Maekawa. A # N algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145--159, May 1985.
A Quorum-based Distributed Channel Allocation Algorithm.. - Skawratananond, Garg (Correct)
....the synchronization mechanism in [2] is employed. The second algorithm (G2) reduces the acquisition delay imposed in G1. However, no conflict resolution is used. Therefore a channel selected by two neighbors could potentially be dropped by both of them. Our algorithm (QB) uses Maekawa s technique [7] to reduce message complexity in update algorithms. Like DL, request messages in QB are sent to only a small subset of cells in the interference neighborhood. However, this subset does not depend on the channels being requested. QB improves G2 by reducing the number of messages required per ....
M. Maekawa. A N Algorithm for Mutual Exclusion in Decentralized Systems. In ACM Transactions on Computer Systems, pages 145-159, May 1985.
Fault Detection for Byzantine Quorum Systems - Alvisi, Malkhi, Pierce, Reiter (1999) (7 citations) (Correct)
....is a quorum system based on a nite 27 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0. 9 1 3 4 5 6 1 read 2 reads 3 reads 4 reads 5 reads Figure 5: Probability of detection within 1 5 reads for n = 25; t a = 2 (Example 5) 28 projective plane (FPP) suggested originally as a quorum system by [Mae85]. In the FPP quorum system, there are q q 1 elements and quorums of size q 1 (corresponding to the hyperplanes of the FPP) where q = p r 2 for some prime p and integer r. Each pair of distinct quorums in FPP intersect in exactly one element. For the second quorum system we again ....
M. Maekawa. A p n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems 3(2):145-159, 1985.
Revisiting Hierarchical Quorum Systems - Preguica, Martins (2001) (Correct)
....quorums have different sizes. These systems present good availability, but their load is worse than the best possible (e.g. # for the HQS against for the best load balancing systems [14] An alternative method to reduce the size of quorums have been proposed in [13] using finite projective planes this method uses quorums of size . However, it is only known how to construct this system in a small number of situations. Alternative ways to easily produce quorums of size have been proposed based on the organization of elements in grids [3] or ....
....better availability and load than the grid based constructions. The quorum size is constant and it is smaller than the average quorum size in those systems. The load is almost optimal ( and it is the best from the analyzed systems that present high availability (the system proposed in [13] has optimal load but poor asymptotic availability) It has a quorum size smaller than the average of the quorum size in the studied systems with load and the availability is also the best for the analyzed number of elements in these systems. ....
M. Maekawa. A algorithm for mutual exclusion in decentralized system. ACM Transactions on Computer Systems, May 1985.
Pilgrim Performance over a New CAliF Communication Layer - GARCIA, LAPAYRE, DAVID (Correct)
....ring model could become penalizing if the system is made up of many nodes some of which are inactive: the token continues to travel all around the ring and the time between two turns is wasted. For such a case, other studies have optimized the critical section management in distributed systems [Lam78, Agr81, Mae85, Nai87]. In cooperative work the number of sites is rather low. For example, it is not acceptable to edit a cooperative document with more than one twenty members. 35 33 21 15 12 11 O O O O O O The Token Structure 4 is inactive object with which there is an update or a request no object with ....
M. Maekawa. A p n Algorithm for Mutual Exclusion in Decentralized Systems. ACM Transactions on Computer Systems, 3(2):145{ 159, 1985. 21
Distributed Shared Memory Layer for Cooperative Work.. - Guyennet, Lapayre.. (1997) (Correct)
....a token to each processor. It is not necessary to request the token. The token ring model could become penalizing if the system is made up of many nodes some of which are inactive. For such a case, other studies have optimized the critical section management in distributed systems [Lam78, Agr81, Mae85, Nai87] In cooperative work the number of sites is rather low. In this situation, we developed an algorithm which uses the token technique. But in our algorithm, the token is not a simple variable which is successively transmitted to each node of the ring, but a more complex data structure ....
M. Maekawa. A p n Algorithm for Mutual Exclusion in Decentralized Systems. ACM Transactions on Computer Systems, 3(2):145-159, 1985.
Quorum Placement in Networks to Minimize Access Delays - Gupta, Maggs, Oprea, Reiter (2005) (Correct)
No context found.
M. Maekawa. A # n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3:145--159, 1985.
Quorum Placement in Networks: Minimizing Network.. - Golovin, Gupta, Maggs.. (2006) (Correct)
No context found.
M. Maekawa. A # n algorithm for mutual exclusion in decentralized systems. ACM Trans. on Computer Systems, 3:145--159, 1985.
Approximate Replication - Olston (2003) (Correct)
No context found.
M. Maekawa. A # n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145--159, 1985.
Time-Efficient Self-Stabilizing Algorithms through.. - Gärtner, Pagnia (2003) (Correct)
No context found.
M. Maekawa. A # N algorithm for mutual exclusion in decentralized systems. ACM Trans. on Computer Systems, 3(2):145--159, 1985.
A Distributed Algorithm for Resource Allocation - With Probabilistic Quorum (2002) (Correct)
No context found.
Mamoru Maekawa. A # N algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145--159, March 1985.
Mutual Exclusion in Asynchronous Systems with Failure .. - Delporte-Gallet.. (Correct)
No context found.
M. Maekawa. A # N algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145--159, May 1985.
Approximate Replication - Olston (2003) (Correct)
No context found.
M. Maekawa. A # n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145--159, 1985.
Scalable and Dynamic Quorum Systems - Naor, Wieder (2003) (6 citations) (Correct)
No context found.
Mamoru Maekawa. A # N algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145--159, May 1985.
Services For Networks With Mobile Hosts - Arup Acharya Graduate (Correct)
No context found.
Maekawa, M. A p N algorithm for mutual exclusion in decentralized systems. 117 ACM Transactions on Computer Systems 3, 2 (May 1985).
On Distributed Dynamic Channel Allocation in Mobile.. - Jiang, Lai, Soundarajan (2002) (2 citations) (Correct)
No context found.
M. Maekawa, "A algorithm for mutual exclusion in decentralized systems," ACM Transactions on Computer Systems Volume 3 , Issue 2 (1985) pp. 145-159
Availability Evaluation of Quorum-Based Mutual Exclusion.. - Tsuchiya, Kikuno (Correct)
No context found.
Maekawa, M. (1985) A p N algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst., 3, 145-- 159.
Local Scheduling for Distributed Cooperation - Grzegorz Greg Malewicz (Correct)
No context found.
Maekawa, M.: A # N Algorithm for Mutual Exclusion in Decentralized Systems. ACM Tran. on Computer Systems. Vol. 3(2) (1985) 145--159
Dynamic Byzantine Quorum Systems - Lorenzo Alvisi Dahlia (2000) (9 citations) (Correct)
No context found.
M. Maekawa. A p n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145--159, 1985.
Backoff Protocols for Distributed Mutual Exclusion and.. - Gregory Chockler Dahlia (2001) (2 citations) (Correct)
No context found.
M. Maekawa. A N algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems 3(2):145-- 159, May 1985.
Location Updates for Efficient Routing in Ad Hoc Networks - Stojmenovic (2 citations) (Correct)
No context found.
M. Maekawa, A n algorithm for mutual exclusion in decentralized systems, ACM Transactions on Computer Systems, 14-159, May 1985.
Approximate Replication - Olston (2003) (Correct)
No context found.
M. Maekawa. A # n algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145--159, 1985.
A Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary.. - Yan, al. (1996) (Correct)
No context found.
Maekawa, M. A n algorithm for mutual exclusion in decentralized system. ACM Trans. Comput. Systems (May 1985), 145--159.
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