List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table

By H. Arabnejad, J. Barbosa. IEEE Transactions on Parallel and Distributed Systems, 2014

601 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture, Information Systems

View Paper: https://www.semanticscholar.org/paper/b25744552b75c50979bbc122e48cd640f2595544

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Gideon Juve
2. Ewa Deelman
3. J. Nabrzyski
4. Albert Y. Zomaya
5. Rajkumar Buyya

In Hardware and Architecture

1. Ewa Deelman
2. Albert Y. Zomaya

In Information Systems

1. Ewa Deelman
2. Albert Y. Zomaya
3. Rajkumar Buyya

Citations in the corpus

• Fast Adaptive Task Offloading in Edge Computing Based on Meta Reinforcement Learning (2020, methodology): “To simulate the heterogeneous DAGs, we implement a synthetic DAG generator according to [27].”
• Cost- and deadline-constrained provisioning for scientific workflow ensembles in IaaS clouds (2012, background): “In [20] authors introduced a novel single DAG static scheduling PEFT algorithm, which outperforms well-known list-based heuristics for makespan optimization, but the budget is not taken into account.”