Scribd Logo
Upload

Welcome to Scribd!

  • Problem Solving 42022 RTpolicies Scheduling PDF

    Uploaded by

    Mzhda AS
    3 views1 page
    i. Aperiodic tasks do not recur at regular intervals while periodic tasks do. ii. Non-preemptive tasks cannot be interrupted once started while preemptive tasks can be interrupted to allow higher priority tasks to execute. iii. RMA scheduling prioritizes tasks based on their periods while EDF prioritizes based on task deadlines. iv. Priority inheritance prevents lower priority tasks from blocking higher priority tasks. Priority ceiling ensures a task is not blocked for longer than its highest priority interaction.

    Original Description:

    problem solving about real time softwares

    Original Title

    Problem Solving 42022 RTpolicies Scheduling.pdf

    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
    i. Aperiodic tasks do not recur at regular intervals while periodic tasks do. ii. Non-preemptive tasks cannot be interrupted once started while preemptive tasks can be interrupted to allow higher priority tasks to execute. iii. RMA scheduling prioritizes tasks based on their periods while EDF prioritizes based on task deadlines. iv. Priority inheritance prevents lower priority tasks from blocking higher priority tasks. Priority ceiling ensures a task is not blocked for longer than its highest priority interaction.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views1 page

    Problem Solving 42022 RTpolicies Scheduling PDF

    Uploaded by

    Mzhda AS
    i. Aperiodic tasks do not recur at regular intervals while periodic tasks do. ii. Non-preemptive tasks cannot be interrupted once started while preemptive tasks can be interrupted to allow higher priority tasks to execute. iii. RMA scheduling prioritizes tasks based on their periods while EDF prioritizes based on task deadlines. iv. Priority inheritance prevents lower priority tasks from blocking higher priority tasks. Priority ceiling ensures a task is not blocked for longer than its highest priority interaction.

    Copyright:

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

    Problem

    Solving: Scheduling Policy 1

    Question [15 marks]


    a. Given the following concepts in real-time scheduling, identify a difference between the
    concepts.
    i. Between aperiodic task and periodic task
    ii. Between non- preemptive task invocation and preemptive task invocation
    iii. Between Rate Monotonic Analysis (RMA) scheduling and Earliest Deadline First
    (EDF) scheduling
    iv. Between Priority inheritance and Priority ceiling protocols
    [6 marks]

    b. Consider  four  periodic  tasks  (T1, T2, T3 and  T4)  with  the  following  arrival  times, 
    computation times, deadlines and priority, in Table Q1.  

    Table Q1
    Tasks Fixed Arrival Computation Deadline
    Priority time times
    T1 Very high 7 3 15
    T2 High 5 5 9
    T3 Low 1 7 15
    T4 Very low 0 5 15

    Draw timeline diagrams to show the execution of the following scheduling policies. In
    each timeline show the three situations: executing, preempted and blocked, when
    appropriate using the legend given in Table Q1.
    i. Non-Preemptive fixed-priority scheduling
    ii. Preemptive fixed-priority scheduling
    iii. Earliest Deadline First (EDF) scheduling
    [9 marks]

    You might also like