Y. Afek, G. Stupp, and D. Touitou, "Longlived adaptive splitter and applications." Unpublished manuscript, Dec. 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Adaptive Algorithms for Mutual Exclusion - Bortnikov (Correct)
....mutual exclusion algorithm. Since adaptive long lived collect has O(k 4 ) step complexity, the remote step complexity of the resulting mutual exclusion algorithm is also O(k 4 ) Another mutual exclusion algorithm they presented has O(k 2 ) system response time and remote step complexity [3] . Peterson [27] presents an adaptive mutual exclusion algorithm with O(k) individual response time and O(N 2 ) space complexity. The remote step complexity and the system response time of this algorithm is O(k) A number of lower bounds on the space complexity of any mutual exclusion ....
.... has not been measured in any of the previously known adaptive algorithms except the algorithms in [27] 7 Algorithms Remote Step System Space Complexity Complexity Response Time Choy and Singh [16] O(N) O(k) O(N) Adaptive Bakery O(k 4 ) O(k 4 ) O(N 3 ) Algorithm [4] Afek et al. [3] O(min(k 2 ; k log N) O(k 2 ) O(N2 2n ) Anderson and Kim [8] O(k) O(k) O(N) Peterson [27] O(k) O(k) O(N 2 ) First Algorithm O(k) O(log k) O(N log n) Second Algorithm O(k) O(log k) O(n log n) Table 2.1: Comparison with previous adaptive mutual exclusion algorithms 8 Chapter 3 ....
Y. Afek, G. Stupp, and D. Touitou. Long-lived adaptive splitter and applications. Unpublished manuscript, Dec. 1999.
Adaptive and Efficient Algorithms for Lattice Agreement and.. - Attiya, Fouren (1998) (1 citation) (Correct)
....time complexity the time between consecutive entries to the critical section is O(k) using only read write operations. Afek, Stupp and Touitou [6] use an adaptive collect algorithm to derive an adaptive version of the Bakery algorithm [24] they present another mutual execlusion algorithm in [5]. Recently, Attiya and Bortnikov [11] presented a mutual exclusion algorithm whose time complexity is O(log k) this algorithm employs an unbalanced tournament tree with the same structure as our adaptive lattice agreement tree. 2. Preliminaries. 2.1. The Model. In the shared memory model, ....
....ff of A, step(A; ff) f(n) Namely, the step complexity of A in every execution is bounded by a function of the total number of processes (which is known in advance) it does not depend on the range of the initial names. Adaptive Lattice Agreement and Renaming 5 0 [0] 2 [1] 5 9 [3] 8 [5] 7 [8] 3 [7] 1 [4] 6 [9] 4 [2] 6] diagonal Fig. 2. The grid used for O(k 2 ) renaming (depicted for n = 4) Algorithm A is adaptive (to total contention) if there is a function f : N 7 N such that in every execution ff of A, step(A; ff) f(k(ff) Namely, the step complexity of A ....
[Article contains additional citation context not shown here]
Y. Afek, G. Stupp, and D. Touitou, Long-lived adaptive splitter and applications. Unpublished manuscript, Dec. 1999.
Adaptive and Efficient Mutual Exclusion (Extended Abstract) - Attiya, Bortnikov (2000) (Correct)
.... The algorithm is constructed from an adaptive long lived non wait free k renaming and an adaptive tourna Algorithms Remote Step System Space Complexity Complexity Response Time Choy and Singh [11] O(N) O(k) O(N) Adaptive Bakery Algorithm [4] O(k 4 ) O(k 4 ) O(N 3 ) Afek et al. [3] O(min(k 2 ; k log N) O(k 2 ) O(N2 2n ) Anderson and Kim [7] O(k) O(k) O(N) First Algorithm O(k) O(log k) O(nN) Second Algorithm O(k) O(log k) O(n 2 ) Table 1: Comparison with previous adaptive mutual exclusion algorithms ment tree for mutual exclusion. Our non wait free renaming ....
....to transform the Bakery algorithm [15] into an adaptive mutual exclusion algorithm. Since adaptive long lived collect has O(k 4 ) step complexity, the remote step complexity of the resulting mutual exclusion algorithm is also O(k 4 ) They present another adaptive mutual exclusion algorithm [3]; both the system response time and the remote step complexity of this algorithm are O(k 2 ) Table 1 summarizes the results of this paper and compares them to the known adaptive mutual exclusion algorithms. 2. PRELIMINARIES We assume a standard asynchronous shared memory model of computation ....
Y. Afek, G. Stupp, and D. Touitou. Long-lived adaptive splitter and applications. Unpublished manuscript, Dec. 1999.
A Simple Algorithmic Characterization of Uniform Solvability.. - Gafni (2002) (1 citation) (Correct)
No context found.
Y. Afek, G. Stupp, and D. Touitou, "Longlived adaptive splitter and applications." Unpublished manuscript, Dec. 1999.
Appendix D - Detailed Proof Of (Correct)
No context found.
Y. Afek, G. Stupp, and D. Touitou. Long-lived adaptive splitter and applications. Distributed Computing, 15(2):67-86, 2002.
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