Network computing attracts the attention of many computer researchers and scientists because it can better utilize existing computing resources. The key challenge of network computing is the search for the best method to distribute computing resources to submitted tasks. This thesis demonstrates a distributed dynamic scheduling of composite tasks on a grid computing system. It describes how a computer program was written to simulate a real world computer network.; Submitted tasks consist of subtasks represented by DAGs. The adopted scheduling and mapping include two steps: one external and the other internal. External scheduling and mapping are performed on the task level, and internal scheduling and mapping are done on the subtask level. A task and its subtask must go through these two steps to be allocated computing resources.; This research analyzes different factors on the distributed dynamic scheduling algorithm. The factors include Subtask Waiting Queue size, submitted task number, task submission interval, and network infrastructure. The percentage of tasks completed before deadline and average response times are used as indexes of network computing performance.
展开▼
