hw04(1) - 300ms Task Round 1 Round 2 Arrival Run Activity...

Info icon This preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
EE 4770 Homework 4 Due: 24 April 1998 Problem 1: The table below describes tasks on an otherwise empty processor. Show the CPU activity and the task states from time zero until tasks E and F finish or until task B first runs, whichever is later. Assume that the scheduler is called at t = 0. The system uses a two-level scheduler. The first round uses round-robin scheduling with class sequence { α, β, γ, β } , class α will be chosen at time zero. (Note that β appears twice in the class sequence so class β tasks get twice as many opportunities to run.) Class α tasks are chosen using a priority scheme, class β are chosen using deadline scheduling, and γ are chosen using first come, first served. The quantum is 50 ms and the system is not task preemptive. Task A computes for 15 ms then will wait (go into the wait state) for the clock to indicate the next multiple of 100 ms, at which time it will become ready again, it will repeat the process each time it runs. For example, if it finishes running at 237 ms it will go into a wait state until
Image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 300ms. Task Round 1 Round 2 Arrival Run Activity Name Class Info Time Time A α Prio 2 0ms ∞ Repeats: 15ms, wait until multp of 100ms. B α Prio 1 0ms 200ms C β 235ms deadline 215ms 10ms D β 265ms deadline 205ms 30ms E γ FCFS 5ms 70ms F γ FCFS 10ms 90ms Problem 2: The scheduling used above does not guarantee that deadline-scheduled tasks will run as soon as they arrive. Modify the scheduling so that tasks C and D will not have to wait for any of the others, while maintaining the round-robin relationship between tasks in classes α and γ , and the priority and FCFS used within those classes. Problem 3: Compute the worst-case latency and response time for the one-shot events listed in the table below. Event Strong Weak Handler Name Prior. Prior. Run Time A 2 2 2 μ s B 2 1 3 μ s C 1 3 4 μ s D 1 2 5 μ s E 1 1 100 μ s...
View Full Document

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern