检索结果-南通市图书馆

task scheduling scheme by checkpoint sharing and task duplication in P2P-based desktop grids

在线全文

学校读者我要写书评

暂无评论

Journal of Central South University 2014年第10期21卷 3864-3872页

作者： Joon-Min Gil Young-Sik Jeong School of IT Engineering Catholic University of Daegu13-13Hayang-ro Hayang-eup Gyeongsan-si Gyeongbuk 712-701 Korea Department of Multimedia Engineering Dongguk University 30 Pildong-rol-gilJung-gu Seoul 100-715 Korea

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.

关键词： P2P-based desktop grids checkpoint sharing task duplication embedded Markov chain

Clustering and Scheduling Method Based on task duplication

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2007年第2期12卷 260-266页

作者： HE Kun ZHAO Yong Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 Hubei China

A new heuristic approach that resembles the evolution of interpersonal relationships in human society is put forward for the problem of scheduling multitasks represented by a directed acyclic graph. The algorithm includes dynamic-group, detachgraph and front-sink components. The priority rules used are new. Relationship number, potentiality, weight and merge degree are defined for cluster＇s priority, and task potentiality for tasks＇ priority. Experiments show the algorithm could get good result in short time. The algorithm produces another optimal solution for the classic MJD benchmark. Its average performance is better than five latter-day representative algorithms, especially six benchmarks of the nines.

关键词： clustering directed acyclic graph task duplication task scheduling

Scheduling algorithm based on critical tasks in heterogeneous environments

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2008年第2期19卷 398-404,F0003页

作者： Lan Zhou Sun Shixin Coll. of Computer Science and Engineering Univ. of Electronic Science and Technology of China Chengdu 610054 P. R. China

Heterogeneous computing is one effective method of high performance computing with many advantages. task scheduling is a critical issue in heterogeneous environments as well as in homogeneous environments. A number of task scheduling algorithms for homogeneous environments have been proposed, whereas, a few for heterogeneous environments can be found in the literature. A novel task scheduling algorithm for heterogeneous environments, called the heterogeneous critical task （HCT） scheduling algorithm is presented. By means of the directed acyclic graph and the gantt graph, the HCT algorithm defines the critical task and the idle time slot. After determining the critical tasks of a given task, the HCT algorithm tentatively duplicates the critical tasks onto the processor that has the given task in the idle time slot, to reduce the start time of the given task. To compare the performance of the HCT algorithm with several recently proposed algorithms, a large set of randomly generated applications and the Gaussian elimination application are randomly generated. The experimental result has shown that the HCT algorithm outperforms the other algorithm.

关键词： list scheduling task duplication task graphs heterogeneous environment parallel processing.

A Scheduling Algorithm for Fork-Join DAG in Bus-based and Heterogeneous Environment

在线全文

学校读者我要写书评

暂无评论

A Scheduling Algorithm for Fork-Join DAG in Bus-based and He...