Scribd Logo
Upload

Welcome to Scribd!

  • 38 views

    Homework #5 - : Scheduling (Chapter 9) RT Scheduling (Chapter 10)

    Uploaded by

    bunty da
    1) The document provides a homework assignment on real-time scheduling concepts including rate monotonic scheduling and parallel computing. It includes 4 questions with sub-parts asking students to analyze scheduling priorities, compute execution times for parallel programs, and develop scheduling diagrams. 2) The first question asks students to assign priorities to subsystems with different interrupt rates and response times using rate monotonic scheduling. The second asks students to compute execution times for a parallel program run on 1 and 32 computers. 3) The third questions tests rate monotonic analysis concepts like CPU utilization and schedulability. The final question asks students to develop scheduling diagrams for 3 periodic tasks using priority scheduling.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Homework #5 - : Scheduling (Chapter 9) RT Scheduling (Chapter 10)

    Uploaded by

    bunty da
    38 views3 pages
    1) The document provides a homework assignment on real-time scheduling concepts including rate monotonic scheduling and parallel computing. It includes 4 questions with sub-parts asking students to analyze scheduling priorities, compute execution times for parallel programs, and develop scheduling diagrams. 2) The first question asks students to assign priorities to subsystems with different interrupt rates and response times using rate monotonic scheduling. The second asks students to compute execution times for a parallel program run on 1 and 32 computers. 3) The third questions tests rate monotonic analysis concepts like CPU utilization and schedulability. The final question asks students to develop scheduling diagrams for 3 periodic tasks using priority scheduling.

    Original Description:

    home work

    Original Title

    HW05

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1) The document provides a homework assignment on real-time scheduling concepts including rate monotonic scheduling and parallel computing. It includes 4 questions with sub-parts asking students to analyze scheduling priorities, compute execution times for parallel programs, and develop scheduling diagrams. 2) The first question asks students to assign priorities to subsystems with different interrupt rates and response times using rate monotonic scheduling. The second asks students to compute execution times for a parallel program run on 1 and 32 computers. 3) The third questions tests rate monotonic analysis concepts like CPU utilization and schedulability. The final question asks students to develop scheduling diagrams for 3 periodic tasks using priority scheduling.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    38 views3 pages

    Homework #5 - : Scheduling (Chapter 9) RT Scheduling (Chapter 10)

    Uploaded by

    bunty da
    1) The document provides a homework assignment on real-time scheduling concepts including rate monotonic scheduling and parallel computing. It includes 4 questions with sub-parts asking students to analyze scheduling priorities, compute execution times for parallel programs, and develop scheduling diagrams. 2) The first question asks students to assign priorities to subsystems with different interrupt rates and response times using rate monotonic scheduling. The second asks students to compute execution times for a parallel program run on 1 and 32 computers. 3) The third questions tests rate monotonic analysis concepts like CPU utilization and schedulability. The final question asks students to develop scheduling diagrams for 3 periodic tasks using priority scheduling.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 3

    Grading: 3 = correct

    Homework #5 _______________________________ _____


    (41 points) (Name) (Section)
    2 = almost
    Scheduling (Chapter 9)
    RT Scheduling (Chapter 10)
    Questions: Answers:
    1. (8 points) Suppose that an automobile microcontroller has
    four priority levels for interrupts (level 1 being the highest).
    The units interrupting the controller include an impact sensor
    subsystem, which needs attention within 0.1 ms, along with
    four other subsystems as follows:

    Interrupt Max service


    Subsystem rate time (ms)
    Fuel/ignition 500/sec 1 ms
    Engine temperature 1/sec 100 ms
    Dashboard display 800/sec 0.2 ms
    Air conditioner 1/sec 100 ms

    Use rate monotonic scheduling to assign a priority to each


    subsystem that guarantees the response time of 0.1 ms for the
    impact sensor and handles each of the other critical units
    before the next interrupt is produced.

    a. Justify your priority assignments.


    b. Does RMA guarantee schedulability?

    BYU, CS 345, W2020 Homework #5 Page 1/3


    2. (12 points) The following C program is to be executed on a
    computer and a parallel version is to be executed on a 32-
    computer cluster.
    L1: for (i = 0; i < 1024; i++)
    L2: { sum[i] = 0;
    L3: for (j = 0; j <= i; j++)
    L4: { sum[i] = sum[i] + i;
    L5: }
    L6: }

    Suppose lines 2 and 4 each take two machine cycle times,


    including all processor and memory-access activities. Ignore
    the overhead caused by the software loop control statements
    (lines 1, 3, 5, 6) and all other system overhead.

    a. What is the total execution time (in machine cycle times) of


    the program on a single computer?

    b. Divide the i-loop iterations among the 32 computers as


    follows: Computer 1 executes the first 32 iterations (i = 0 to
    31), processor 2 executes the next 32 iterations, and so on.
    What is the execution time and speedup factor compared with
    part (a)? (Note that the computational workload, dictated by
    the j-loop, is unbalanced among the computers.)

    c. Show how to modify the parallelizing to facilitate a balanced


    parallel execution of all the computational workload over 32
    computers. (A balanced load means an equal number of
    additions assigned to each computer with respect to both
    loops.)

    d. What is the execution time resulting from the balanced


    parallel execution on 32 computers? What is the resulting
    speedup over a single computer? (Show your calculations.)

    3. (9 points) Use Rate-monotonic Analysis (RMA) to


    answer the following questions:

    Process Execution Time Period


    P1 1 ms 8 ms
    P2 2 ms 5 ms
    P3 2 ms 10 ms

    a. What is the CPU utilization?


    b. What is the theoretical limit for 3 processes?
    c. Is this system schedulable?

    4. (10.1, page 477) (12 points) Consider a set of three periodic tasks with the execution profiles and arrival order
    shown below. Develop scheduling diagrams similar to those of Figure 10.5 for this set of tasks. Round-robin the two
    lower priority tasks. (Use ascending alphabetical order for simultaneous arrivals.) Preempt only on task arrivals.

    BYU, CS 345, W2020 Homework #5 Page 2/3


    Arrival Execution Ending
    Process Time Time Deadline
    A(1) 0 10 20
    A(2) 20 10 40
    A(3) 40 10 60
    A(4) 60 10 80
    A(5) 80 10 100
    … … … …
    B(1) 0 10 50
    B(2) 50 10 100
    … … … …
    C(1) 0 15 50
    C(2) 50 15 100
    … … … …

    A1 A2 A3 A4 A5 A6
    B1 B2 B3
    C1 C2 C3
    0 10 20 30 40 50 60 70 80 90 100

    A Priority
    0 10 20 30 40 50 60 70 80 90 100

    B Priority
    0 10 20 30 40 50 60 70 80 90 100

    C Priority
    0 10 20 30 40 50 60 70 80 90 100

    Earliest
    Deadline
    0 10 20 30 40 50 60 70 80 90 100

    BYU, CS 345, W2020 Homework #5 Page 3/3

    You might also like