List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table

@article{Arabnejad2014ListSA,
  title={List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table},
  author={Hamid Arabnejad and Jorge G. Barbosa},
  journal={IEEE Transactions on Parallel and Distributed Systems},
  year={2014},
  volume={25},
  pages={682-694}
}
Efficient application scheduling algorithms are important for obtaining high performance in heterogeneous computing systems. In this paper, we present a novel list-based scheduling algorithm called Predict Earliest Finish Time (PEFT) for heterogeneous computing systems. The algorithm has the same time complexity as the state-of-the-art algorithm for the same purpose, that is, O(v2.p) for v tasks and p processors, but offers significant makespan improvements by introducing a look-ahead feature… CONTINUE READING
Highly Influential
This paper has highly influenced 26 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 177 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 100 extracted citations

177 Citations

0204060'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 177 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 30 references

DAG Generation Program

  • F. Suter
  • http://www.loria.fr/ ~suter/dags.html, 2010.
  • 2010
Highly Influential
14 Excerpts

Similar Papers

Loading similar papers…