Yehuda Afek and Eytan Weisberger. The instancy of snapshots and commuting objects. Journal of Algorithms, 30(1):68--105, January 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....see [1] Claim 5.4. Algorithm 3 satis es Properties 1,2, 3 and 4 (validity, gather, collect, snapshot) It is adaptive to point contention with step complexity O(k 6. ADAPTIVE IMMEDIATE SNAPSHOT Adaptive immediate snapshot ( 10] algorithms were presented in [12] and in [13] based on [14] which appears also in [15] However, these algorithms are only adaptive to total contention, which means that every process that had ever took steps during the algorithm is counted in the contention. We transform the algorithm of [13] into an adaptive to point contention algorithm. The ....

....appears also in [15] However, these algorithms are only adaptive to total contention, which means that every process that had ever took steps during the algorithm is counted in the contention. We transform the algorithm of [13] into an adaptive to point contention algorithm. The algorithm in [14, 13] is implemented by an in nite number of oors, where each oor represents a possible snapshot of the values written by the di erent executions of the immediate snapshot (each oor corresponds to one atomic write operation) It is assumed that the values written by every process in its di erent ....

[Article contains additional citation context not shown here]

Yehuda Afek and Eytan Weisberger. The instancy of snapshots and commuting objects. Journal of Algorithms, 30(1):68-105, January 1999.

....recognize the importance of snapshots and presented several algorithms for implementing and using them. The rst snapshot algorithm implemented in the shared memory model was presented in [22] Since then, many snapshot algorithms were suggested in di erent models and with different complexities [43, 44, 45]. The rst adaptive snapshot was presented in [18] However, this algorithm is only adaptive to the total contention. Borowsky and Gafni extended the de nition of a snapshot and de ned the immediate snapshot object [37, 46] An interesting lower bound was introduced this year by Afek, Boxer and ....

Yehuda Afek and Eytan Weisberger. The instancy of snapshots and commuting objects. Journal of Algorithms, 30(1):68-105, January 1999.

....f) can be made adaptive by substituting our collect algorithm. More sophisticated applications of our collect algorithms yield adaptive wait free algorithms for atomic snapshots, with O(k log k) step complexity (based on [15] and for immediate snapshots, with O(k 3 ) step complexity (based on [7, 16]) Atomic snapshots [1] provide instantaneous global views of the shared memory. Immediate snapshots [17] extend atomic snapshots, and guarantee that no process obtains a view which is strictly between an update of process p j and the following view p j obtains. In the M renaming problem [11] ....

....a view is represented by a set of counters, holding the number of updates performed by processes. Each process owns an unbounded array of values. 4 In an 3 If u does not exist, then M = 1 and a simpler version of the following argument can be applied. 4 This array can be bounded, see [7]. 11 im upscan operation, a process writes the new value into its array and increments a counter holding the number of values it has written; then it obtains a view of the counters (which can be used to retrieve the values from the arrays) The sum of counters in a view V , denoted P V , is the ....

[Article contains additional citation context not shown here]

Y. Afek and E. Weisberger. The instancy of snapshots and commuting objects. J. Alg., 30(1):68--105, Jan. 1999.

.... algorithm in an adaptive wait free algorithm for atomic snapshots, with O(k 2 ) step complexity (based on [2] A more sophisticated usage of our collect algorithm is required in order to obtain an adaptive wait free algorithm for immediate snapshots, with O(k 3 ) step complexity (based on [7, 17]) Finally, we show how atomic snapshots and immediate snapshots are used to derive adaptive versions of several 1 well known wait free (2k Gamma 1) renaming algorithms; in particular, the one shot algorithm with O(k 3 ) step complexity [19] and the long lived algorithm with exponential step ....

....Immediacy: If V 1 , the view returned by some im upscan operation, includes the value written in the th im upscan of p j and V 2 is the view returned by the th im upscan operation of p j , then V 2 V 1 . Our adaptive immediate snapshot algorithm is based on the algorithm of Afek and Weisberger [7] (see also [17] We start with a brief description of the AW algorithm, and discuss how it can be made adaptive. Since the AW algorithm is presented as a derivative of another algorithm (to implement general using strong operations) and since our modifications go inside this algorithm, we also ....

[Article contains additional citation context not shown here]

Y. Afek and E. Weisberger. The instancy of snapshots and commuting objects. Journal of Algorithms, 30(1):68--105, Jan. 1999.

....shared memory that can be atomically read in its entirety. The ability to collect such an instantaneous view is a powerful tool for designing concurrent data structures, as it greatly reduces the need to argue about inconsistent views of memory. Snapshots have been widely used in theoretical work [1, 2, 12, 14, 15, 22, 24], and offer a yet untapped potential for practical use in applications such as check pointing, generating concurrent backups, or interactive debugging of multiprocessor programs. Snapshots can also serve as building blocks of state of the art fault tolerant realtime applications such as a ....

Afek, Y. and Weisberger, E. The Instancy of Snapshots and Commuting Objects. Tel-Aviv University, June 1993.

No context found.

Yehuda Afek and Eytan Weisberger. The instancy of snapshots and commuting objects. Journal of Algorithms, 30(1):68--105, January 1999.

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