Sciweavers

11 search results - page 2 / 3
» Eventually linearizable shared objects
Sort
View
SIROCCO
1998
13 years 7 months ago
The counting pyramid: an adaptive distributed counting scheme
A distributed counter is a concurrent object which provides a fetch-and-increment operation on a shared value. On the basis of a distributed counter, one can implement various fun...
Roger Wattenhofer, Peter Widmayer
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
13 years 11 months ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
DC
2010
13 years 6 months ago
Adaptive progress: a gracefully-degrading liveness property
We introduce a simple liveness property for shared object implementations that is gracefully degrading depending on the degree of synchrony in each run. This property, called adapt...
Marcos Kawazoe Aguilera, Sam Toueg
VLDB
1992
ACM
138views Database» more  VLDB 1992»
13 years 10 months ago
Experiences With an Object Manager for a Process-Centered Environment
Process-centered software engineering environments, such as Arcadia, impose a variety of requirements on database technology that to date have not been well supported by available...
Dennis Heimbigner
CASCON
1996
196views Education» more  CASCON 1996»
13 years 7 months ago
Monitoring overhead in distributed systems: visualization and estimation techniques
Monitoring distributed systems involves the collection, analysis, and display of interactions among managed objects. These functions are carried out by the components of a monitor...
Hasina Abdu, Hanan Lutfi Lutfiyya, Michael A. Baue...