663 search results - page 128 / 133 » Process Algebra with Local Communication |
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
HASE
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents a scalable, adaptive and timebounded general approach to assure reliable, real-time Node-Failure Detection (NFD) for large-scale, high load networks comprised ...
P2P
2006
IEEE
14 years 1 months ago
2006
IEEE
Peer-to-peer grids aim to build computational grids encompassing thousands of sites. To achieve this scale, such systems cannot rely on trust or off-line negotiations among partic...
HICSS
2005
IEEE
14 years 1 months ago
2005
IEEE
The Public Domain (PD) always serves as an agent to provide better and reliable services and information to citizens. Recent advancements in technology, citizen-demand and new pub...