Scribd Logo
Upload

Welcome to Scribd!

  • Principle of Scheduling

    Uploaded by

    Amir Hakim
    19 views26 pages
    The document discusses real-time systems and scheduling. It covers task states, scheduling examples, dependencies between tasks, and precedence graphs. It provides an example where rearranging the schedule order from D1, D2, D3 allows all tasks to meet their deadlines, resulting in a feasible system. Precedence constraints define the order jobs must run, and precedence graphs can represent these relationships to aid in scheduling.

    Original Description:

    Original Title

    4. Principle of Scheduling

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses real-time systems and scheduling. It covers task states, scheduling examples, dependencies between tasks, and precedence graphs. It provides an example where rearranging the schedule order from D1, D2, D3 allows all tasks to meet their deadlines, resulting in a feasible system. Precedence constraints define the order jobs must run, and precedence graphs can represent these relationships to aid in scheduling.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    19 views26 pages

    Principle of Scheduling

    Uploaded by

    Amir Hakim
    The document discusses real-time systems and scheduling. It covers task states, scheduling examples, dependencies between tasks, and precedence graphs. It provides an example where rearranging the schedule order from D1, D2, D3 allows all tasks to meet their deadlines, resulting in a feasible system. Precedence constraints define the order jobs must run, and precedence graphs can represent these relationships to aid in scheduling.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 26

    Real Time System

    Principle of Scheduling
    Task State
    Task State
    Task State
    Task State
    Task State
    Task State
    Scheduling Example
    Scheduling Example
    Scheduling Example
    Scheduling Example
    Scheduling Example
    Scheduling Example
    If we rearrange the schedule so that D1
    chosen first, and then D2 and then D3, all
    tasks will then meet the deadline.

    Thus we have feasible system.

    Feasible
    Dependencies
    Dependencies
    Dependencies
    Dependencies
    Dependencies
    Dependencies
    Dependencies
    Dependencies
    Dependencies
    Precedence Graphs
    • Precedence constraint are given as a relation of precedence over
    the set of jobs {Ji}: J J’
    Precedence Graphs
    Precedence Graphs
    Precedence Graphs
    • A scheduler determines the order of job execution.

    You might also like