Sciweavers

822 search results - page 57 / 165
» Contention in shared memory algorithms
Sort
View
EUROPKI
2004
Springer
14 years 2 months ago
Trustworthy Accounting for Wireless LAN Sharing Communities
Abstract. The Peer-to-Peer Wireless Network Confederation (P2PWNC) is designed to be an open self-organizing Wireless LAN (WLAN) roaming association where users from one WLAN can a...
Elias C. Efstathiou, George C. Polyzos
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
14 years 3 months ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...
GCC
2004
Springer
14 years 2 months ago
Maintaining Comprehensive Resource Availability in P2P Networks
Abstract. In this paper, the resource availability issue has been addressed with respect to the intermittent connectivity and dynamic presence of peers in a P2P system. We aim to m...
Bin Xiao, Jiannong Cao, Edwin Hsing-Mean Sha
VLDB
2004
ACM
124views Database» more  VLDB 2004»
14 years 2 months ago
Data Sharing Through Query Translation in Autonomous Sources
We consider the problem of data sharing between autonomous data sources in an environment where constraints cannot be placed on the shared contents of sources. Our solutions rely ...
Anastasios Kementsietsidis, Marcelo Arenas
ICPADS
2000
IEEE
14 years 1 months ago
A Practical Nonblocking Queue Algorithm Using Compare-and-Swap
Many nonblocking algorithms have been proposed for shared queues. Previous studies indicate that link-based algorithms perform best. However, these algorithms have a memory manage...
Chien-Hua Shann, Ting-Lu Huang, Cheng Chen