373 search results - page 39 / 75 » Local Scheduling for Volunteer Computing |
CLUSTER
2007
IEEE
14 years 2 months ago
2007
IEEE
— In large-scale distributed execution environments such as multicluster systems and grids, resource availability may vary due to resource failures and because resources may be a...
IPPS
2005
IEEE
14 years 1 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...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
MOBIHOC
2006
ACM
14 years 7 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...
MSWIM
2005
ACM
14 years 1 months ago
2005
ACM
Wireless Local Area Networks (WLAN) are being deployed at a rapid pace and in different environments. As a result, the demand for supporting a diverse range of applications over w...