Device Drivers Scheduler Walter operates a system with 2 CPU cores and 5 completely identical processes running all the time. He notices that 4 out of 5 processes are getting equal CPU time but the fifth process does not seem to get any. Which part of the operating system should Walter look at for understanding why the fifth process is not running as it should? File System Skip Memory Manager
Added by Stephen H.
Close
Step 1
This suggests that the fifth process is not being scheduled to run. Show more…
Show all steps
Your feedback will help us improve your experience
Akash M and 71 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Akash M.
CPU Scheduling: The table below describes the CPU-I/O Burst cycles for processes P1, P2, and P3. Assume the processes arrived in the order P1, P2, P3, all at time 0. Process | Priority | CPU Burst 1 | I/O Burst 1 | CPU Burst 2 | I/O Burst 2 | CPU Burst 3 --- | --- | --- | --- | --- | --- | --- P1 | 1 | 12 | 4 | 12 | - | - P2 | 1 | 2 | 10 | 2 | 12 | 3 P3 | 0 | 6 | 2 | 6 | - | - (a) Draw the Gantt chart timeline, illustrating the interleaving of processes, and calculate the average waiting time for each process under 1. a non-preemptive priority scheduling algorithm 2. a round-robin scheduling algorithm with a quantum = 4. (b) Should you increase the time quantum? Explain your answer.
Madhur L.
Operating Systems 1. A process in a paged system accesses the following virtual addresses: 10, 11, 104, 170, 73, 309, 185, 245, 246, 434, 458, 364 Derive the corresponding reference string if the page size is 100 words, 200 words, and 300 words. 2. A two-dimensional 512 x 512 array is stored in row major in a paged virtual memory with a page size of 512. Thus, each row occupies 1 page. Physical memory contains fewer than 512 frames. (a) Using FIFO page replacement, determine how many page faults occur when accessing all elements sequentially: in row major in column major (b) Would the number of page faults be different under LRU page replacement? 3. Physical memory consists of 4 page frames, initially all empty. The following reference string is processed: 0 1 4 0 2 3 0 1 0 2 3 4 2 3 (a) Show which pages are resident under the second chance page replacement algorithm. Indicate when page faults occur. (b) Assume that references to page 1 are write references (modifying page 1) and all others are read references. Show which pages are resident under the third chance page replacement algorithm. Indicate when page faults occur. 4. Physical memory is initially empty. The following reference string is processed: 0 1 4 0 2 3 0 1 0 2 3 4 2 3 (a) Show which pages are resident in an optimal working set with d = 3. Indicate when page faults occur. Determine the average working set size. (b) Show which pages are resident under the working set page replacement algorithm with d = 3. Indicate when page faults occur. Determine the average working set size. 5. For d = 5 and the reference string 1 0 0 0 0 0 0 1 1 3 0 0 0 1 5 1 5 4 4 2 0 0 4 4 (a) What is the largest working set the reference string will require? (b) What is the smallest working set the reference string will require?
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD