Sciweavers

822 search results - page 90 / 165
» Contention in shared memory algorithms
Sort
View
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
14 years 9 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
Hagit Attiya, Keren Censor-Hillel
IPPS
1999
IEEE
15 years 6 months ago
Mechanical Verification of a Garbage Collector
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
Klaus Havelund
SRDS
2003
IEEE
15 years 7 months ago
Autonomous Replication for High Availability in Unstructured P2P Systems
We consider the problem of increasing the availability of shared data in peer-to-peer (P2P) systems so that users can access any content, regardless of the current subset of onlin...
Francisco Matias Cuenca-Acuna, Richard P. Martin, ...

Publication
309views
17 years 2 months ago
SOLE: Scalable On-Line Execution of Continuous Queries on Spatio-temporal Data Streams
This paper presents the Scalable On-Line Execution algorithm (SOLE, for short) for continuous and on-line evaluation of concurrent continuous spatio- temporal queries over data str...
Mohamed F. Mokbel, Walid G. Aref
INFOCOM
2008
IEEE
15 years 9 months ago
Delay Tolerant Collaborations among Campus-Wide Wireless Users
Abstract—The ubiquitous deployment of wireless LAN networks are allowing students to embrace laptops as their preferred computing platform. We investigated the viability of build...
Xuwen Yu, Surendar Chandra