1257 search results - page 145 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
116
Voted
SPAA
1999
ACM
15 years 2 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
80
Voted
SSS
2007
Springer
15 years 4 months ago
2007
Springer
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms, and presented three such algorithms for the problem of mutual exclusion on a ring of processors. The thir...
107
click to vote
ESCIENCE
2006
IEEE
15 years 4 months ago
2006
IEEE
Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of the large number of distributed resources that comprise th...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
77
Voted
ICCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We propose the use of programmable Grid resource partitioning heuristics in the context of a distributed service Grid management architecture. The architecture is capable...