318 search results - page 32 / 64 » Distributed Graph Traversals by Relabelling Systems with App... |
107
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
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...
119
click to vote
AAAI
2006
15 years 2 months ago
2006
With increasing deployment of systems involving multiple coordinating agents, there is a growing need for diagnosing coordination failures in such systems. Previous work presented...
109
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
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...
115
click to vote
ICPP
2008
IEEE
15 years 7 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
125
click to vote
MIDDLEWARE
2010
Springer
14 years 11 months ago
2010
Springer
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...