Sciweavers

318 search results - page 32 / 64
» Distributed Graph Traversals by Relabelling Systems with App...
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
AAAI
2006
13 years 9 months ago
Diagnosis of Multi-Robot Coordination Failures Using Distributed CSP Algorithms
With increasing deployment of systems involving multiple coordinating agents, there is a growing need for diagnosing coordination failures in such systems. Previous work presented...
Meir Kalech, Gal A. Kaminka, Amnon Meisels, Yehuda...
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
13 years 11 months ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde
ICPP
2008
IEEE
14 years 2 months ago
Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
Guojing Cong, Sreedhar B. Kodali, Sriram Krishnamo...
MIDDLEWARE
2010
Springer
13 years 6 months ago
dFault: Fault Localization in Large-Scale Peer-to-Peer Systems
Distributed hash tables (DHTs) have been adopted as a building block for large-scale distributed systems. The upshot of this success is that their robust operation is even more imp...
Pawan Prakash, Ramana Rao Kompella, Venugopalan Ra...