On network-aware clustering of Web clients
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
SETI@home: an experiment in public-resource computing
Communications of the ACM
Enhanced Algorithms for Multi-site Scheduling
GRID '02 Proceedings of the Third International Workshop on Grid Computing
Models and Scheduling Mechanisms for Global Computing Applications
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Clustering Hosts in P2P and Global Computing Platforms
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Distributed Job Scheduling on Computational Grids Using Multiple Simultaneous Requests
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
Novel adaptive scheduling algorithm for computational grid
IMSAA'09 Proceedings of the 3rd IEEE international conference on Internet multimedia services architecture and applications
| Hi-index | 0.00 |
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.