DFRN: a new approach for duplication based scheduling for distributed memory multiprocessor systems

Park, Gyung-Leen; Shirazi, Behrooz; Marquis, J.

doi:10.1109/ipps.1997.580875

Cited by 47 publications

(1 citation statement)

References 12 publications

(35 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Task Duplication based Heuristics: The idea behind duplication-based scheduling algorithms is to schedule a task graph by mapping some of its tasks redundantly, which reduces the communication overhead (Ahmad & Kwok, 1994;Park, Shirazi & Marquis, 1997;Chung & Ranka, 1992). The only change is to selection strategies of the tasks for duplication in different duplication-based algorithms.…”

Section: Introductionmentioning

confidence: 99%

An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication

Chaudhuri

Agrawal²

2011

International Journal of Grid and High Performance Computing

View full text Add to dashboard Cite

Task scheduling in heterogeneous parallel and distributed computing environment is a challenging problem. Applications identified by parallel tasks can be represented by directed-acyclic graphs (DAGs). Scheduling refers to the assignment of these parallel tasks on a set of bounded heterogeneous processors connected by high speed networks. Since task assignment is an NP-complete problem, instead of finding an exact solution, scheduling algorithms are developed based on heuristics, with the primary goal of minimizing the overall execution time of the application or schedule length. In this paper, the overall execution time (schedule length) of the tasks is reduced using task duplication on top of the Critical-Path-On-a-Processor (CPOP) algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication

Chaudhuri

Agrawal²

2011

International Journal of Grid and High Performance Computing

View full text Add to dashboard Cite

show abstract

A novel task scheduling algorithm based on dynamic critical path and effective duplication for pervasive computing environment

Luo¹,

Dong²,

Cao³

et al. 2008

Wireless Communications

View full text Add to dashboard Cite

In order to effectively utilize massive heterogeneous resources and provide transparent computing capability to upper applications, task scheduling as the key issue of pervasive computing system becomes significantly important. Previous proposed priority and duplication based task scheduling algorithms, which can be applied in pervasive computing environment, usually have following limitations: critical path cannot be calculated accurately while neglecting the effect of resource availability in scheduling; in duplication based resource allocation stage, duplications without restriction would lead to some negative effects on final schedule length (SL). For the purpose of solving these problems, a novel task scheduling algorithm based on dynamic critical path (DCP) and effective duplication, called DCPED, is presented in this paper. In DCPED, a more accurate DCP calculation method which takes resource availability into account is introduced. Meanwhile an effective task duplication strategy is proposed to eliminate ineffective duplications and make an optimized schedule result by using space compression technique and dynamic critical path length (DCPL) based evaluation technique respectively. Finally, simulation results show that DCPED can outperform previous algorithms significantly in NSL and speedup rate metrics. Especially, it is very effective for utilizing computing resources and scheduling the fine‐grain and large‐scale workflow applications in pervasive computing system. Copyright © 2008 John Wiley & Sons, Ltd.

show abstract

Untitled

Wan

et al. 2010

Wireless Communications

View full text Add to dashboard Cite

DFRN: a new approach for duplication based scheduling for distributed memory multiprocessor systems

Abstract: Duplication Based Scheduling (DBS) is a relatively

Cited by 47 publications

References 12 publications

An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication

An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication

A novel task scheduling algorithm based on dynamic critical path and effective duplication for pervasive computing environment

Untitled

Contact Info

Product

Resources

About