Critical path and area based scheduling of parallel task graphs on heterogeneous platforms

@article{NTakp2006CriticalPA,
  title={Critical path and area based scheduling of parallel task graphs on heterogeneous platforms},
  author={Tchimou N'Takp{\'e} and Fr{\'e}d{\'e}ric Suter},
  journal={12th International Conference on Parallel and Distributed Systems - (ICPADS'06)},
  year={2006},
  volume={1},
  pages={8 pp.-}
}
While most parallel task graphs scheduling research has been done in the context of single homogeneous clusters, heterogeneous platforms have become prevalent and are extremely attractive for deploying applications at unprecedented scales. In this paper we address the need for scheduling techniques for parallel task applications for heterogeneous clusters of clusters by proposing a method to adapt existing parallel task graphs scheduling heuristics that have proved to be efficient on… CONTINUE READING
Highly Cited
This paper has 36 citations. REVIEW CITATIONS
25 Citations
11 References
Similar Papers

Citations

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

References

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

Simultaneous Exploitation of Task and Data Parallelism in Regular Scientific Applications

  • S. Ramaswany
  • PhD thesis, Univ. of Illinois,
  • 1996
Highly Influential
4 Excerpts

Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints

  • D. Trystram Lepère, G. Woeginger
  • IJFCS
  • 2002

Similar Papers

Loading similar papers…