1257 search results - page 18 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
CLUSTER
2006
IEEE
14 years 10 months ago
2006
IEEE
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
— We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are sh...
CCR
2004
14 years 9 months ago
2004
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
SSS
2010
Springer
14 years 8 months ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...