SRDS
1998
IEEE
13 years 9 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
SRDS
1998
IEEE
13 years 9 months ago
1998
IEEE
Dependable distributed systems are difficult to build. This is particularly true if they have dependability requirements that change during the execution of an application, and are...
SRDS
1998
IEEE
13 years 9 months ago
1998
IEEE
SRDS
1998
IEEE
13 years 9 months ago
1998
IEEE
For mobile users who move frequently but receive relatively rare calls, a forwarding scheme has been shown to outperform the normal IS-41 location management scheme. But the forwa...
SRDS
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper presents the semi-passive replication technique
SRDS
1999
IEEE
13 years 9 months ago
1999
IEEE
Numerous mathematical approaches have been proposed to determine the optimal checkpoint interval for minimizing total execution time of an application in the presence of failures....
SRDS
1999
IEEE
13 years 9 months ago
1999
IEEE
The paper presents the design of a software infrastructure that can support negotiation and competition among buyers and sellers of goods (auctioning) over the Internet. The goals...
SRDS
1999
IEEE
13 years 9 months ago
1999
IEEE
In CORBA-based applications that depend on object replication for fault tolerance, inconsistencies in the states of the replicas of an object can arise when concurrent threads wit...
SRDS
1999
IEEE
13 years 9 months ago
1999
IEEE
In order for mobile agents to be accepted as a basic technology for enabling electronic commerce, proper security mechanisms must be developed. Hosts must be protected from malici...
SRDS
1999
IEEE
13 years 9 months ago
1999
IEEE
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...