TASK SCHEDULING ALGORITHMS FOR MULTIPROCESSOR REAL-TIME CONTROL SYSTEMS.

Munenori Kai, Hironori Kasahara, Seinosuke Narita, Hitoshi Ukaji

    Research output: Contribution to journalArticle

    Abstract

    The computing load for the control of a steel rolling mill plant may be regarded as a group of tasks (each task is an individual program) such as setting of controlled variables and operation monitoring. The task group can be represented by a task graph, an acyclic finite directed graph because precedence relations exist among the tasks. Dynamic scheduling methods are proposed which are extensions of the developed static scheduling algorithms. Their efficiency in comparison with the deadline driven scheduling algorithm developed by Liu and others is shown.

    Original languageEnglish
    Pages (from-to)120-130
    Number of pages11
    JournalElectrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi)
    Volume107
    Issue number2
    Publication statusPublished - 1987 Mar

    Fingerprint

    Real time control
    Scheduling algorithms
    Control systems
    Directed graphs
    Rolling mills
    Scheduling
    Steel
    Monitoring

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    TASK SCHEDULING ALGORITHMS FOR MULTIPROCESSOR REAL-TIME CONTROL SYSTEMS. / Kai, Munenori; Kasahara, Hironori; Narita, Seinosuke; Ukaji, Hitoshi.

    In: Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi), Vol. 107, No. 2, 03.1987, p. 120-130.

    Research output: Contribution to journalArticle

    @article{315e3c5e04254a4a8099bff1360897d3,
    title = "TASK SCHEDULING ALGORITHMS FOR MULTIPROCESSOR REAL-TIME CONTROL SYSTEMS.",
    abstract = "The computing load for the control of a steel rolling mill plant may be regarded as a group of tasks (each task is an individual program) such as setting of controlled variables and operation monitoring. The task group can be represented by a task graph, an acyclic finite directed graph because precedence relations exist among the tasks. Dynamic scheduling methods are proposed which are extensions of the developed static scheduling algorithms. Their efficiency in comparison with the deadline driven scheduling algorithm developed by Liu and others is shown.",
    author = "Munenori Kai and Hironori Kasahara and Seinosuke Narita and Hitoshi Ukaji",
    year = "1987",
    month = "3",
    language = "English",
    volume = "107",
    pages = "120--130",
    journal = "Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi)",
    issn = "0424-7760",
    publisher = "John Wiley and Sons Inc.",
    number = "2",

    }

    TY - JOUR

    T1 - TASK SCHEDULING ALGORITHMS FOR MULTIPROCESSOR REAL-TIME CONTROL SYSTEMS.

    AU - Kai, Munenori

    AU - Kasahara, Hironori

    AU - Narita, Seinosuke

    AU - Ukaji, Hitoshi

    PY - 1987/3

    Y1 - 1987/3

    N2 - The computing load for the control of a steel rolling mill plant may be regarded as a group of tasks (each task is an individual program) such as setting of controlled variables and operation monitoring. The task group can be represented by a task graph, an acyclic finite directed graph because precedence relations exist among the tasks. Dynamic scheduling methods are proposed which are extensions of the developed static scheduling algorithms. Their efficiency in comparison with the deadline driven scheduling algorithm developed by Liu and others is shown.

    AB - The computing load for the control of a steel rolling mill plant may be regarded as a group of tasks (each task is an individual program) such as setting of controlled variables and operation monitoring. The task group can be represented by a task graph, an acyclic finite directed graph because precedence relations exist among the tasks. Dynamic scheduling methods are proposed which are extensions of the developed static scheduling algorithms. Their efficiency in comparison with the deadline driven scheduling algorithm developed by Liu and others is shown.

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

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

    M3 - Article

    AN - SCOPUS:0023298757

    VL - 107

    SP - 120

    EP - 130

    JO - Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi)

    JF - Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi)

    SN - 0424-7760

    IS - 2

    ER -