A standard task graph set for fair evaluation of multiprocessor scheduling algorithms

Takao Tobita, Hironori Kasahara

    Research output: Contribution to journalArticle

    97 Citations (Scopus)

    Abstract

    A 'standard task graph set' is proposed for fair evaluation of multiprocessor scheduling algorithms. Developers of multiprocessor scheduling algorithms usually evaluate them using randomly generated task graphs. This makes it difficult to compare the performance of algorithms developed in different research groups. To make it possible to evaluate algorithms under the same conditions so that their performances can be compared fairly, this paper proposes a standard task graph set covering many of the proposed task graph generation methods. This paper also evaluates as examples two heuristic algorithms (CP and CP/MISF), a practical sequential optimization algorithm (DF/IHS), and a practical parallel optimization algorithm (PDF/IHS) using the proposed standard task graph set. This set is available at http://www.kasahara. elec.waseda.ac.jp/schedule/.

    Original languageEnglish
    Pages (from-to)379-394
    Number of pages16
    JournalJournal of Scheduling
    Volume5
    Issue number5
    DOIs
    Publication statusPublished - 2002 Sep

    Fingerprint

    Scheduling algorithms
    Heuristic algorithms
    Evaluation
    Graph

    Keywords

    • Benchmark
    • Multiprocessor scheduling
    • Optimization
    • Performance evaluation
    • Task graph

    ASJC Scopus subject areas

    • Industrial and Manufacturing Engineering
    • Management Science and Operations Research

    Cite this

    A standard task graph set for fair evaluation of multiprocessor scheduling algorithms. / Tobita, Takao; Kasahara, Hironori.

    In: Journal of Scheduling, Vol. 5, No. 5, 09.2002, p. 379-394.

    Research output: Contribution to journalArticle

    @article{e44969605d6c4b5d8c0572f1289989e0,
    title = "A standard task graph set for fair evaluation of multiprocessor scheduling algorithms",
    abstract = "A 'standard task graph set' is proposed for fair evaluation of multiprocessor scheduling algorithms. Developers of multiprocessor scheduling algorithms usually evaluate them using randomly generated task graphs. This makes it difficult to compare the performance of algorithms developed in different research groups. To make it possible to evaluate algorithms under the same conditions so that their performances can be compared fairly, this paper proposes a standard task graph set covering many of the proposed task graph generation methods. This paper also evaluates as examples two heuristic algorithms (CP and CP/MISF), a practical sequential optimization algorithm (DF/IHS), and a practical parallel optimization algorithm (PDF/IHS) using the proposed standard task graph set. This set is available at http://www.kasahara. elec.waseda.ac.jp/schedule/.",
    keywords = "Benchmark, Multiprocessor scheduling, Optimization, Performance evaluation, Task graph",
    author = "Takao Tobita and Hironori Kasahara",
    year = "2002",
    month = "9",
    doi = "10.1002/jos.116",
    language = "English",
    volume = "5",
    pages = "379--394",
    journal = "Journal of Scheduling",
    issn = "1094-6136",
    publisher = "Springer New York",
    number = "5",

    }

    TY - JOUR

    T1 - A standard task graph set for fair evaluation of multiprocessor scheduling algorithms

    AU - Tobita, Takao

    AU - Kasahara, Hironori

    PY - 2002/9

    Y1 - 2002/9

    N2 - A 'standard task graph set' is proposed for fair evaluation of multiprocessor scheduling algorithms. Developers of multiprocessor scheduling algorithms usually evaluate them using randomly generated task graphs. This makes it difficult to compare the performance of algorithms developed in different research groups. To make it possible to evaluate algorithms under the same conditions so that their performances can be compared fairly, this paper proposes a standard task graph set covering many of the proposed task graph generation methods. This paper also evaluates as examples two heuristic algorithms (CP and CP/MISF), a practical sequential optimization algorithm (DF/IHS), and a practical parallel optimization algorithm (PDF/IHS) using the proposed standard task graph set. This set is available at http://www.kasahara. elec.waseda.ac.jp/schedule/.

    AB - A 'standard task graph set' is proposed for fair evaluation of multiprocessor scheduling algorithms. Developers of multiprocessor scheduling algorithms usually evaluate them using randomly generated task graphs. This makes it difficult to compare the performance of algorithms developed in different research groups. To make it possible to evaluate algorithms under the same conditions so that their performances can be compared fairly, this paper proposes a standard task graph set covering many of the proposed task graph generation methods. This paper also evaluates as examples two heuristic algorithms (CP and CP/MISF), a practical sequential optimization algorithm (DF/IHS), and a practical parallel optimization algorithm (PDF/IHS) using the proposed standard task graph set. This set is available at http://www.kasahara. elec.waseda.ac.jp/schedule/.

    KW - Benchmark

    KW - Multiprocessor scheduling

    KW - Optimization

    KW - Performance evaluation

    KW - Task graph

    UR - http://www.scopus.com/inward/record.url?scp=27744573276&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=27744573276&partnerID=8YFLogxK

    U2 - 10.1002/jos.116

    DO - 10.1002/jos.116

    M3 - Article

    VL - 5

    SP - 379

    EP - 394

    JO - Journal of Scheduling

    JF - Journal of Scheduling

    SN - 1094-6136

    IS - 5

    ER -