homework8 - a. P(); b. V(); 5. [10] Q6-19. Given the...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CprE 488 Embedded Systems Design Homework 8, Fall 2006 Name: Lab Section: 1. [10] Q6-4. Which should have lower overhead – a preemptive or cooperative context switch mechanism? Explain. 2. [10] Q6-8 and Q6-9. a. Draw a UML sequence diagram showing a cooperative context switch. b. Draw a UML sequence diagram showing a preemptive context switch. 3. [10] Q6-13. What is the distinction between the ready and waiting states of processor scheduling?
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4. [10] Q6-15. Assuming that you have a routine called swap(int *a, int *b) that atomatically swaps the values of the memory locations pointed to a and b, write C code for:
Background image of page 2
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a. P(); b. V(); 5. [10] Q6-19. Given the following set of processes running on a single CPU, what is the maximum execution time P5 for which all the processes will be schedulable using RMS? Explain. Process Execution Time Deadline P1 1 10 P2 18 100 P3 2 20 P4 5 50 P5 x 25 6. [10] Q6-21. For the given process execution times and periods, show how much CPU time of higher-priority processes will be required during one period of each of the following processes. The processes are scheduled using RMS. Process Execution Time Deadline P1 1 5 P2 2 10 P3 2 25 P4 5 50 P1: P2: P3: P4:...
View Full Document

Page1 / 3

homework8 - a. P(); b. V(); 5. [10] Q6-19. Given the...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online