Sciweavers

292 search results - page 5 / 59
» Objects Shared by Byzantine Processes
Sort
View
SPAA
2009
ACM
14 years 5 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
WDAG
2004
Springer
103views Algorithms» more  WDAG 2004»
14 years 2 months ago
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
We study the power of reliable anonymous distributed systems, where processes do not fail, do not have identifiers, and run identical programmes. We are interested specifically i...
James Aspnes, Faith Ellen Fich, Eric Ruppert
ICDE
2001
IEEE
129views Database» more  ICDE 2001»
14 years 10 months ago
High-Performance, Space-Efficient, Automated Object Locking
The paper studies the impact of several lock manager designs on the overhead imposed to a persistent programming language by automated object locking. Our study reveals that a loc...
Grzegorz Czajkowski, Laurent Daynès
WDAG
2005
Springer
77views Algorithms» more  WDAG 2005»
14 years 2 months ago
Restricted Stack Implementations
We introduce a new object, BH, and prove that a system with one BH object and single-writer Registers has the same computational power as a system with countably many commutative a...
Matei David, Alex Brodsky, Faith Ellen Fich

Publication
394views
15 years 8 months ago
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
Location-aware environments are characterized by a large number of objects and a large number of continuous queries. Both the objects and continuous queries may change their locati...
Xiaopeng Xiong, Mohamed F. Mokbel, Walid G. Aref