442 search results - page 32 / 89 » Fault Tolerant Wide-Area Parallel Computing |
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
ICPP
1998
IEEE
14 years 1 months ago
1998
IEEE
In this paper, we study fault-tolerantmulticastingin multistage interconnection networks (MINs) for constructing large-scale multicomputers. In addition to point-to-point routing ...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
Fault-tolerant programs are typically not only difficult to implement but also incur extra costs in terms of performance or resource consumption. Failures are typically relatively ...
FGCS
2010
13 years 8 months ago
2010
Evolutionary Algorithms, including Genetic Programming (GP), are frequently employed to solve difficult real-life problems, which can require up to days or months of computation. ...
CCGRID
2003
IEEE
14 years 3 months ago
2003
IEEE
Open multi-agent systems need to cope with the characteristics of the Internet, e.g., dynamic availability of computational resources, latency, and diversity of services. Large-sc...