1515 search results - page 124 / 303 » Parallel computing on any desktop |
134
Voted
ICDCS
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper presents in detail an efficient and provably correct algorithm for database replication over partitionable networks. Our algorithm avoids the need for end-toend acknow...
144
Voted
ICDCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
118
click to vote
ICDCS
2002
IEEE
15 years 8 months ago
2002
IEEE
A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys i...
116
Voted
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
Software-based distributed shared memory (DSM) systems do usually not provide any means to use shared memory regions as stacks or via an efficient heap memory allocator. Instead ...
127
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...