为了提高桌面网格中资源的利用率,在FCFS(first come first service)调度的基础上,利用了检查点技术,提出与描述了几种高效的任务调度策略:FCFS-AT(adaptive timeout),FCFS-TR(task replication),FCFS-PD(prediction on demand)等。分...为了提高桌面网格中资源的利用率,在FCFS(first come first service)调度的基础上,利用了检查点技术,提出与描述了几种高效的任务调度策略:FCFS-AT(adaptive timeout),FCFS-TR(task replication),FCFS-PD(prediction on demand)等。分析了调度策略对资源挥发性与不可用所带来的负面影响,建立了实验环境,采用对子任务数据跟踪的工具,在不同的设置条件下对这些调度策略上进行了测试。测试结果表明,大部分的检查点调度策略都比经典的FCFS算法性能好,检查点的数目也影响系统的性能,但是影响不是很明显。展开更多
A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a res...A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a resource) is used as an intermediate result and executed in other peers via its duplication and transmission. As the checkpoint is close to a final result, the reduction of execution time for each task becomes higher, leading to reducing turnaround time. To evaluate the performance of our scheduling scheme in terms of transmission cost and execution time, an analytical model with an embedded Markov chain is presented. We also conduct simulations with a failure rate of tasks and compare the performance of our scheduling scheme with that of the existing scheme based on client-server architecture. Performance results show that our scheduling scheme is superior to the existing scheme with respect to the reduction of execution time and turnaround time.展开更多
文摘为了提高桌面网格中资源的利用率,在FCFS(first come first service)调度的基础上,利用了检查点技术,提出与描述了几种高效的任务调度策略:FCFS-AT(adaptive timeout),FCFS-TR(task replication),FCFS-PD(prediction on demand)等。分析了调度策略对资源挥发性与不可用所带来的负面影响,建立了实验环境,采用对子任务数据跟踪的工具,在不同的设置条件下对这些调度策略上进行了测试。测试结果表明,大部分的检查点调度策略都比经典的FCFS算法性能好,检查点的数目也影响系统的性能,但是影响不是很明显。
基金supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2012R1A1A4A0105777)supported by the MSIP (Ministry of Science, ICT and Future Planning), Korea, under the ITRC (Information Technology Research Center) support program (NIPA-2013-H030113-4007) supervised by the NIPA (National IT Industry Promotion Agency)
文摘A scheduling scheme is proposed to reduce execution time by means of both checkpoint sharing and task duplication under a peer-to-peer(P2P) architecture. In the scheme, the checkpoint executed by each peer(i.e., a resource) is used as an intermediate result and executed in other peers via its duplication and transmission. As the checkpoint is close to a final result, the reduction of execution time for each task becomes higher, leading to reducing turnaround time. To evaluate the performance of our scheduling scheme in terms of transmission cost and execution time, an analytical model with an embedded Markov chain is presented. We also conduct simulations with a failure rate of tasks and compare the performance of our scheduling scheme with that of the existing scheme based on client-server architecture. Performance results show that our scheduling scheme is superior to the existing scheme with respect to the reduction of execution time and turnaround time.
