4 search results - page 1 / 1 » Fault Tolerant Asynchronous Adder through Dynamic Self-recon... |
157
click to vote
ICPP
2000
IEEE
15 years 9 months ago
2000
IEEE
The idle computers on a local area, campus area, or even wide area network represent a significant computational resource--one that is, however, also unreliable, heterogeneous, an...
137
click to vote
JCP
2006
15 years 5 months ago
2006
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
173
click to vote
SIGADA
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...