A high performance,low complexity algorithm for compile-time task scheduling in heterogeneous systems

Hagras, Tarek; Janeček, Jan

doi:10.1109/ipdps.2004.1303056

Cited by 50 publications

(43 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, the proposed decomposition method of [18] has been used. The DBDE heuristic of mapping a i to r j is defined as (3). The closeness of the required time (cost) for prerequisite data transmission and activity execution to its associated sub-deadline (sub-budget) are considered within this heuristic.…”

Section: Heuristicsmentioning

confidence: 99%

“…A heterogonous computing system (HCS) is defined as a distributed suite of heterogeneous resources connected by B Nasrolah Moghadam Charkari moghadam@modares.ac.ir 1 high-speed links [1][2][3][4]. A HCS provides computing resources for compute-intensive applications with diverse computational needs, as well as a payment model that charges for resource and network usages.…”

Section: Introductionmentioning

confidence: 99%

“…A HCS provides computing resources for compute-intensive applications with diverse computational needs, as well as a payment model that charges for resource and network usages. Indeed, HCS is a promising infrastructure for such applications from two aspects [1,3]: (i) Fast processing of large applications is achieved by exploiting parallel processing capability provided by the HCS. (ii) The heterogeneity of the platform provides more diverse capabilities for the application execution, including different hardware/software components and resources.…”

Section: Introductionmentioning

confidence: 99%

“…Using the workflow model, the application is decomposed into several smaller sub-tasks called activities, with dependencies representing the precedence relationship between them [1,3,5]. The generated workflow must be scheduled in order to realize the application execution.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Ant colony based constrained workflow scheduling for heterogeneous computing systems

2016

View full text Add to dashboard Cite

The problem of constrained workflow scheduling on heterogeneous computing systems has been of major interest in the recent years. The user requirements are described by defining constraints on the workflow makespan and/or its execution cost. The uncertainty in the activity execution path and the dynamicity in the resource workload may cause some run-time changes of the makespan or cost. To prohibit runtime constraint violation, the system needs robust schedules. In this paper, probability of violation (POV) of constraints is proposed as a criterion for the schedule robustness. An ant colony system is then used to minimize an aggregation of violation of constraints and the POV. Simulation results on real world workflows show the effectiveness of the proposed method in finding feasible schedules. The results also indicate that the proposed method decreases the POV, as well as the expected penalty at run-time.

show abstract

Section: Heuristicsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Ant colony based constrained workflow scheduling for heterogeneous computing systems

2016

View full text Add to dashboard Cite

show abstract

“…The general form of task scheduling problem for fully-connected homogeneous set of processors has been extensively studied and various heuristics were proposed in the literature [5][6][7][8][9][10][11][12][13][14][15][16]. A number of studies extend the general task scheduling problem by considering fullyconnected heterogeneous processors [17][18][19][20][21][22][23]. Some of the recent studies for heterogeneous systems consider multiple phases of hybridizing different techniques or strategies [24][25][26].…”

Section: Introductionmentioning

confidence: 99%

A task scheduling algorithm for arbitrarily-connected processors with awareness of link contention

Alkaya

Topcuoglu

2006

Cluster Comput

View full text Add to dashboard Cite

In this paper, we present a new task scheduling algorithm, called Contention-Aware Scheduling (CAS) algorithm, with the objective of delivering good quality of schedules in low running-time by considering contention on links of arbitrarily-connected, heterogeneous processors. The CAS algorithm schedules tasks on processors and messages on links by considering the earliest finish time attribute with the virtual cut-through (VCT) or the store-and-forward (SAF) switching. There are three types of CAS algorithm presented in this paper, which differ in ordering the messages from immediate predecessor tasks. As part of the experimental study, the performance of the CAS algorithm is compared with two well-known APN (arbitrary processor network) scheduling algorithms. Experiments on the results of the synthetic benchmarks and the task graphs of the wellknown problems clearly show that our CAS algorithm outperforms the related work with respect to performance (given in normalized schedule length) and cost (given in running time) to generate output schedules.

show abstract

Scheduling trade‐off of dynamic multiple parallel workflows on heterogeneous distributed computing systems

Xie

Liu

et al. 2016

Concurrency and Computation

View full text Add to dashboard Cite

Summary Scheduling multiple parallel workflows, which arrive at different instants on heterogeneous distributed computing systems, is a great challenge because of the different requirements of resource providers and users. Overall scheduling length is the main concern of resource providers, whereas deadlines of workflows are the major requirements of users. Most algorithms use fairness‐based strategies to reduce the overall scheduling length. However, these algorithms cause obvious unfairness to longer‐makespan workflows or shorter‐makespan workflows. Furthermore, the systems cannot meet the deadlines of all workflows, particularly on large‐scale resource‐constrained computational grids. Gaining a reasonable balance between the overall scheduling length and the deadlines of workflows is a desirable goal. In this study, we first propose a fairness‐based scheduling algorithm called fairness‐based dynamic multiple heterogeneous selection value to achieve high performance of systems compared with existing works. Then, to meet the deadlines of partial higher‐priority workflows, we present a priority‐based scheduling algorithm called priority‐based dynamic multiple heterogeneous selection value. Finally, combining fairness‐based dynamic multiple heterogeneous selection value and priority‐based dynamic multiple heterogeneous selection value, we present the tradeoff‐based scheduling algorithm to meet the deadlines of more higher‐priority workflows while still allowing the lower‐priority workflows to be processed actively for better performance of systems. Both example and extensive experimental evaluations demonstrate significant improvement of our proposed algorithms. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

A high performance,low complexity algorithm for compile-time task scheduling in heterogeneous systems

Cited by 50 publications

References 17 publications

Ant colony based constrained workflow scheduling for heterogeneous computing systems

Ant colony based constrained workflow scheduling for heterogeneous computing systems

A task scheduling algorithm for arbitrarily-connected processors with awareness of link contention

Scheduling trade‐off of dynamic multiple parallel workflows on heterogeneous distributed computing systems

Contact Info

Product

Resources

About