Sciweavers

442 search results - page 55 / 89
» Fault Tolerant Wide-Area Parallel Computing
Sort
View
AAAI
2006
13 years 11 months ago
The Power of Sequential Single-Item Auctions for Agent Coordination
Teams of robots are more fault tolerant than single robots, and auctions appear to be promising means for coordinating them. In a recent paper at "Robotics: Science and Syste...
Sven Koenig, Craig A. Tovey, Michail G. Lagoudakis...
CONCURRENCY
2000
123views more  CONCURRENCY 2000»
13 years 9 months ago
A mobile agent based push methodology for global parallel computing
The 1990s are seeing the explosive growth of the Internet and Web-based information sharing and dissemination systems. The Internet is also showing a potential of forming of a sup...
Cheng-Zhong Xu, Brian Wims
PPAM
2005
Springer
14 years 3 months ago
A Web Computing Environment for Parallel Algorithms in Java
We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed ove...
Olaf Bonorden, Joachim Gehweiler, Friedhelm Meyer ...
IPPS
2005
IEEE
14 years 3 months ago
Extended Golomb Rulers as the New Recovery Schemes in Distributed Dependable Computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all computers are up and running, we would like the load to be evenly distri...
Kamilla Klonowska, Lars Lundberg, Håkan Lenn...
IPPS
2003
IEEE
14 years 2 months ago
Recovery Schemes for High Availability and High Performance Distributed Real-Time Computing
Clusters and distributed systems offer fault tolerance and high performance through load sharing, and are thus attractive in real-time applications. When all computers are up and ...
Lars Lundberg, Daniel Häggander, Kamilla Klon...