Dynamic critical path scheduling parallel programs onto multiprocessors

@article{Hakem2005DynamicCP,
  title={Dynamic critical path scheduling parallel programs onto multiprocessors},
  author={Mourad Hakem and Franck Butelle},
  journal={19th IEEE International Parallel and Distributed Processing Symposium},
  year={2005},
  pages={7 pp.-}
}
  • Mourad Hakem, Franck Butelle
  • Published 2005
  • Computer Science
  • 19th IEEE International Parallel and Distributed Processing Symposium
  • In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is called the dynamic critical path scheduling DCPS. The DCPS is superior to several other algorithms from the literature in terms of computational complexity, processors consumption and solution quality. DCPS has a time complexity of O(e+vlogv), as opposed to DSC algorithm O((e+v) logv) which is the best known algorithm. 

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 24 CITATIONS, ESTIMATED 96% COVERAGE

    Improving Static Task Scheduling in Heterogeneous and Homogeneous Computing Systems

    VIEW 1 EXCERPT
    CITES METHODS

    Task Scheduling Techniques for Asymmetric Multi-Core Systems

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    A cache- and memory-aware mapping algorithm for big data applications

    • T. Xu, V. Leppãnen
    • Computer Science
    • 2015 Fifth International Conference on Digital Information Processing and Communications (ICDIPC)
    • 2015

    FILTER CITATIONS BY YEAR

    2006
    2020

    CITATION STATISTICS

    • 4 Highly Influenced Citations

    References

    Publications referenced by this paper.
    SHOWING 1-9 OF 9 REFERENCES

    Scheduling with Sufficient Loosely Coupled Processors

    VIEW 1 EXCERPT

    DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

    VIEW 3 EXCERPTS

    Scheduling Parallel Program Tasks onto Arbitrary Target Machines

    VIEW 2 EXCERPTS

    On the Granularity and Clustering of Directed Acyclic Task Graphs

    VIEW 1 EXCERPT

    Computer and Intractability : a guide to the Theory of NP-Completness

    • W.H. Freeman & Co,
    • 1979
    VIEW 1 EXCERPT