2421 search results - page 326 / 485 » Message from the Co-Chairs |
ISCAPDCS
2001
13 years 11 months ago
2001
Reliable communication in injured hypercubes with faulty links/nodes using directed safety levels is studied in this paper. In this approach, each node u in an n-dimensional hyper...
PDCN
2004
13 years 11 months ago
2004
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
USS
2004
13 years 11 months ago
2004
We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding per...
CCGRID
2010
IEEE
13 years 11 months ago
2010
IEEE
Although shared memory programming models show good programmability compared to message passing programming models, their implementation by page-based software distributed shared m...
CCS
2010
ACM
13 years 10 months ago
2010
ACM
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...