An approximation analysis of nonpreemptive EDF scheduling

Masaki Hanada, Hidenori Nakazato

    Research output: Contribution to journalArticle

    Abstract

    Due to recent advances in multimedia technology, a real-time capability is needed to a certain extent even in information systems, in addition to control systems. In general, information systems are classified as soft real-time systems, which keep operating even if a deadline is missed. In soft real-time systems, it is more important to provide statistical guarantees (probabilistic analysis) than absolute guarantees (deadline guarantees). In current real-time systems, real-time scheduling such as EDF (Earliest Deadline First) is used to meet timing constraints. EDF scheduling simply assigns higher priorities in the order of earlier deadlines. It can be applied to aperiodic tasks without prior knowledge of their starting times. In this paper, it is assumed that each attribute of the task follows a probabilistic distribution. The system performance when a nonpreemptive EDF scheduling is applied is then mathematically analyzed.

    Original languageEnglish
    Pages (from-to)13-23
    Number of pages11
    JournalElectronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)
    Volume89
    Issue number2
    DOIs
    Publication statusPublished - 2006 Feb

    Fingerprint

    Real time systems
    Scheduling
    Information systems
    Control systems

    Keywords

    • Aperiodic task
    • EDF scheduling
    • Non-preemptive
    • Soft real time

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    @article{781ae4175a994e8dad733e9d9b9f5c8e,
    title = "An approximation analysis of nonpreemptive EDF scheduling",
    abstract = "Due to recent advances in multimedia technology, a real-time capability is needed to a certain extent even in information systems, in addition to control systems. In general, information systems are classified as soft real-time systems, which keep operating even if a deadline is missed. In soft real-time systems, it is more important to provide statistical guarantees (probabilistic analysis) than absolute guarantees (deadline guarantees). In current real-time systems, real-time scheduling such as EDF (Earliest Deadline First) is used to meet timing constraints. EDF scheduling simply assigns higher priorities in the order of earlier deadlines. It can be applied to aperiodic tasks without prior knowledge of their starting times. In this paper, it is assumed that each attribute of the task follows a probabilistic distribution. The system performance when a nonpreemptive EDF scheduling is applied is then mathematically analyzed.",
    keywords = "Aperiodic task, EDF scheduling, Non-preemptive, Soft real time",
    author = "Masaki Hanada and Hidenori Nakazato",
    year = "2006",
    month = "2",
    doi = "10.1002/ecjc.20177",
    language = "English",
    volume = "89",
    pages = "13--23",
    journal = "Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)",
    issn = "1042-0967",
    publisher = "John Wiley and Sons Inc.",
    number = "2",

    }

    TY - JOUR

    T1 - An approximation analysis of nonpreemptive EDF scheduling

    AU - Hanada, Masaki

    AU - Nakazato, Hidenori

    PY - 2006/2

    Y1 - 2006/2

    N2 - Due to recent advances in multimedia technology, a real-time capability is needed to a certain extent even in information systems, in addition to control systems. In general, information systems are classified as soft real-time systems, which keep operating even if a deadline is missed. In soft real-time systems, it is more important to provide statistical guarantees (probabilistic analysis) than absolute guarantees (deadline guarantees). In current real-time systems, real-time scheduling such as EDF (Earliest Deadline First) is used to meet timing constraints. EDF scheduling simply assigns higher priorities in the order of earlier deadlines. It can be applied to aperiodic tasks without prior knowledge of their starting times. In this paper, it is assumed that each attribute of the task follows a probabilistic distribution. The system performance when a nonpreemptive EDF scheduling is applied is then mathematically analyzed.

    AB - Due to recent advances in multimedia technology, a real-time capability is needed to a certain extent even in information systems, in addition to control systems. In general, information systems are classified as soft real-time systems, which keep operating even if a deadline is missed. In soft real-time systems, it is more important to provide statistical guarantees (probabilistic analysis) than absolute guarantees (deadline guarantees). In current real-time systems, real-time scheduling such as EDF (Earliest Deadline First) is used to meet timing constraints. EDF scheduling simply assigns higher priorities in the order of earlier deadlines. It can be applied to aperiodic tasks without prior knowledge of their starting times. In this paper, it is assumed that each attribute of the task follows a probabilistic distribution. The system performance when a nonpreemptive EDF scheduling is applied is then mathematically analyzed.

    KW - Aperiodic task

    KW - EDF scheduling

    KW - Non-preemptive

    KW - Soft real time

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

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

    U2 - 10.1002/ecjc.20177

    DO - 10.1002/ecjc.20177

    M3 - Article

    VL - 89

    SP - 13

    EP - 23

    JO - Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

    JF - Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

    SN - 1042-0967

    IS - 2

    ER -