1257 search results - page 60 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
101
click to vote
DATE
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper presents a new operation chaining reconfigurable scheduling algorithm (CRS) based on list scheduling that maximizes instruction level parallelism available in distribut...
104
click to vote
GCC
2005
Springer
15 years 5 months ago
2005
Springer
Task Scheduling is a critical design issue of distributed computing. The emerging Grid computing infrastructure consists of heterogeneous resources in widely distributed autonomous...
111
click to vote
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
— The dangerous and time sensitive nature of a disaster area makes it an ideal application for robotic exploration. Our long term goal is to enable humans, software agents, and a...
MOBIHOC
2006
ACM
15 years 11 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
100
click to vote
PDCAT
2005
Springer
15 years 5 months ago
2005
Springer
Scheduling divisible workloads in distributed systems has been one of the interesting research problems over the last few years. Most of the scheduling algorithms previously intro...