摘要
Task scheduling is a key problem for the distributed computation. This thesis analyzes receiver initiated(RI) task scheduling algorithm, finds its weakness and presents an improved algorithm PRI algorithm. This algorithm schedules the concurrent tasks onto network of workstation dynamically at runtime, and initiates task scheduling by the node of low load. The threshold on each node can be modified according to the system information which is periodically detected. Meanwhile, the detecting period can be adjusted in terms of the change of the system state. The result of the experiments shows that the PRI algorithm is superior to the RI algorithm.
0 ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｄｉｓｔｒｉｂｕｔｅｄｃｏｍｐｕｔａｔｉｏｎｉｓａｎｉｍｐｏｒｔａｎｔｗａｙｔｏｒａｉｓｅｔｈｅｓｐｅｅｄｏｆｔｈｅｃｏｍｐｕｔａｔｉｏｎ,ａｎｄｔｈｅｓｕｐｅｒｃｏｍｐｕｔｉｎｇｐｏｗｅｒｐｒｏｖｉｄｅｄｂｙｔｈｅｎ...
