关键词: 互联网计算, 资源共享, 自适应调度, 并行粒度, 工作单元

Abstract: In Internet-oriented computing resource sharing platform，one of the most important topics is how to distribute the subtasks to the volunteers equally.In this paper，a novel scheduling policy is proposed which enables adaptive-parallelism scheduling to be placed between the server and volunteers.The server allocates coarse-grained subtasks to dispatcher alone；volunteers download subtasks from a dispatcher not from the distant server which can decrease the server contention.This approach is also efficient which is strongly supported by its computing capability-based scheduling policy in the volunteers.In order to demonstrate the effectiveness of this approach，two parallel simulation experiments are done.The results obtained from performance analysis show that Master-Slave style parallel applications can benefit a lot from this approach.

Key words: Internet computing, resource sharing, adaptive scheduling, parallel granularity, work unit