检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:石威
出 处:《High Technology Letters》2000年第1期10-15,共6页高技术通讯(英文版)
摘 要: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 IntroductionThedistributedcomputationisanimportantwaytoraisethespeedofthecomputation,andthesupercomputingpowerprovidedbythen...
关 键 词:Task scheduling Distributed computation RECEIVER initiated Network of WORKSTATIONS RUNTIME Low load THRESHOLD
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3