This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
Scheduling Proxy: Enabling Adaptive-Grained Scheduling for Global Computing System
Pittsburgh, PA
November 08-November 08
ISBN: 0-7695-2256-4
Jaesun Han, Korea Advanced Institute of Science and Technology
Daeyeon Park, Korea Advanced Institute of Science and Technology
Global computing system(GCS) harnesses the idle CPU resources of clients connected to Internet for solving large problems that require high volume of computing power. Since GCS scale to millions of clients, many projects usually adopt coarse-grained scheduling in order to reduce server-side contention at the expense of sacrificing the degree of parallelism and wasting CPU resources. In this paper, we propose a new type of client, i.e., a scheduling proxy that enables adaptive-grained scheduling between the server and clients. While the server allocates coarse-grained work units to scheduling proxies alone, clients download fine-grained work units from a relatively nearby scheduling proxy not from the distant server. By computation of small work units at client side, the turnaround time of work unit can be reduced and the waste of CPU time by timeout can be minimized without increasing the performance cost of contention at the server.
Index Terms:
global computing system, desktop grid, adaptive scheduling, task granularity
Citation:
Jaesun Han, Daeyeon Park, "Scheduling Proxy: Enabling Adaptive-Grained Scheduling for Global Computing System," grid, pp.415-420, Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.