Sciweavers

11 search results - page 1 / 3
» Fault-tolerant Wait-free Shared Objects
Sort
View
WDAG
1995
Springer
103views Algorithms» more  WDAG 1995»
13 years 8 months ago
Self-Stabilization of Wait-Free Shared Memory Objects
This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every executio...
Jaap-Henk Hoepman, Marina Papatriantafilou, Philip...
PODC
1991
ACM
13 years 8 months ago
Randomized Wait-Free Concurrent Objects (Extended Abstract)
d abstract) Maurice Herlihy Digital Equipment Corporation Cambridge Research Laboratory One Kendall Square Cambridge MA, 02139 Digital Equipment Corporation Cambridge Research Lab ...
Maurice Herlihy
SPAA
1990
ACM
13 years 9 months ago
Wait-Free Data Structures in the Asynchronous PRAM Model
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
James Aspnes, Maurice Herlihy
RTCSA
1998
IEEE
13 years 9 months ago
Wait-Free Snapshots in Real-Time Systems: Algorithms and Performance
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...
Andreas Ermedahl, Hans Hansson, Marina Papatrianta...
ICVS
2001
Springer
13 years 9 months ago
A Fault-Tolerant Distributed Vision System Architecture for Object Tracking in a Smart Room
Abstract. In recent years, distributed computer vision has gained a lot of attention within the computer vision community for applications such as video surveillance and object tra...
Deepak R. Karuppiah, Zhigang Zhu, Prashant J. Shen...