6939 search results - page 893 / 1388 » Algorithm Engineering for Parallel Computation |
191
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
178
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
—The performance of Particle Swarm Optimization (PSO) algorithms depends strongly upon the interaction among the particles. The existing communication topologies for PSO (e.g. st...
165
click to vote
DCOSS
2009
Springer
16 years 1 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
182
click to vote
JSSPP
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we examine the concept of giving every job a trial run before committing it to run until completion. Trial runs allow immediate job failures to be detected shortly a...
153
click to vote
JSSPP
2009
Springer
16 years 1 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...