Dynamic Variant Rank HEFT Task Scheduling Algorithm Toward Exascle Computing
Authors:
- Suhelah SandokjiSSSuhelah Sandokji
- Fathy EassaFEFathy Eassa
Open Access
- 1 January 2019
- journal article
- Published by Elsevier in Procedia Computer Science
- Vol. 163, 482-493
Abstract
No abstract availableKeywords
Funding Information
- King Abdulaziz City for Science and Technology
This publication has 18 references indexed in Scilit:
- Clustering-Based Task Scheduling in a Large Number of Heterogeneous ProcessorsIEEE Transactions on Parallel and Distributed Systems, 2016
- A survey of techniques for warp scheduling in GPUs2015
- List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost TableIEEE Transactions on Parallel and Distributed Systems, 2013
- DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm2010
- Genetic algorithms for modelling and optimisationJournal of Computational and Applied Mathematics, 2005
- Performance-effective and low-complexity task scheduling for heterogeneous computingIEEE Transactions on Parallel and Distributed Systems, 2002
- Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1996
- DSC: scheduling parallel tasks on an unbounded number of processorsIEEE Transactions on Parallel and Distributed Systems, 1994
- Hypertool: a programming aid for message-passing systemsIEEE Transactions on Parallel and Distributed Systems, 1990
- Simulation of Genetic Systems by Automatic Digital Computers II. Effects of Linkage on Rates of Advance Under SelectionAustralian Journal of Biological Sciences, 1957