H. Attiya, N. A. Lynch and N. Shavit, "Are wait-free algorithms fast?," Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, October 1990, pp. 55-64.  Home/Search   Document Details and Download   Summary   ACM   TOC   Related Articles   Check

....which we call napping and transient faults. A napping failure causes a processor to stop operation and then resume (with or) without recognizing that a failure has occurred. When the requirements above are stated for napping failure they capture the spirit of wait freedom (cf. e.g. La 86b] [ALS 90]. Therefore we call an algorithm that solves the problem described above in the presence of napping failures a wait free clock synchronization algorithm. A transient fault is a fault that causes the state of a process (its local state, program counter, and shared variables) to change ....

H. Attiya, N. A. Lynch and N. Shavit, "Are wait-free algorithms fast?," Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, October 1990, pp. 55-64.

....the implementation, thus, it increases parallelism. 3 The Model We consider an asynchronous shared memory system. In such systems, asynchronous processors communicate by applying atomic memory access operations (operations) to words in the shared memory. The model is standard and follows, e.g. [4, 12], and we describe here only the unique features we require. Each operation has a type, which defines the input and and output arguments to the operation, their allowable values, and the functional dependency between the inputs, the shared memory state and the processor state, on one hand, and the ....

H. Attiya, N. Lynch and N. Shavit, "Are WaitFree Algorithms Fast?" Journal of the ACM, Vol. 41, No. 4 (July 1994), pp. 725-763.

No context found.

H. Attiya, N. Lynch and N. Shavit, "Are Wait-Free Algorithms Fast?", Journal of the ACM, Vol. 41, No. 4 (July 1994), pp. 725-763.

....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 ....

....Section 3 we present our single scanner algorithm. Section 4 presents our multi scanner algorithm. The proofs of both algorithms can be found in Section 5. Finally, Section 6 presents a performance analysis of the algorithms. 2 Snapshots and the Shared Memory Model Our computation model follows [12, 13, 25]. A concurrent system consists of a collection of n processors. Processors communicate through shared data structures called objects. Each object has a set of primitive operations that provide the only means to manipulate that object. Each processor P is a sequential thread of control [25] which ....

Attiya, H., Lynch, N. and Shavit, N. "Are Wait-Free Algorithms Fast?" Journal of the ACM, 41(4), pp. 725--763, July 1994.

No context found.

H. Attiya, N. Lynch and N. Shavit. "Are Wait-Free Algorithms Fast?" In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, Vol. 1, pp. 55--64.

No context found.

H. Attiya, N. Lynch and N. Shavit, "Are Wait-Free Algorithms Fast?" in proceedings of the 31st Annual Symposium on the Foundations of Computer Science, St. Louis, pp. 55-64, October 1990.

....This condition extends the condition for solvability in the presence of one failure [3] It follows from [11, 16] that there is no computable necessary and sufficient condition for wait free solvability. 2 Model of Computation Our model is standard and was used in many papers; we follow [1]. A system consists of n 1 processes p 0 ; pn . Each process is a deterministic state machine, with a possibly infinite number of states. We associate with each process a set of local states. Among the states of each process is a subset called the initial states and another subset called ....

Hagit Attiya, Nancy Lynch and Nir Shavit, "Are Wait-Free Algorithms Fast?" Journal of the ACM, 41(4), pages 725-763, July 1994.

No context found.

Hagit Attiya, Nancy Lynch and Nir Shavit, "Are Wait-Free Algorithms Fast?" Journal of the ACM, 41(4), pages 725-763, July 1994.

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