revQ4 - You may make your own assumption on the PCB...

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

View Full Document Right Arrow Icon
CECS 326 – Operating Systems Review for Quiz 4 on 10/25/05 Quiz covers Chapters 6 and 7. 1. What are the responsibilities of a process manager? 2. What is the difference between a classic process and a modern process? 3. What are user space threads, and what are kernel threads? Why would the entire process block when one of its threads blocks in a user space thread implementation? Why is this not true in a kernel thread implementation? 4. What is a process descriptor (a.k.a. PCB for process control block), and what does it contain? 5. What is a thread descriptor and what does it contain? 6. Understand the basic process/thread state transition, as well as UNIX state transition. 7. What is the process context? When do context switching occur? What does a kernel have to do when it performs a context switch? 8. Show a pseudo code segment to load a new process onto a CPU for a processor that contains arithmetic-logical registers R0-R3, processor status PSR, condition code register CC, program counter PC, and instruction register IR.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: You may make your own assumption on the PCB organization. 9. Show a model of process execution. 10. What does the scheduler in an operating system consist of, and what does each component in the scheduler do? 11. What is required for implementing involuntary CPU sharing? Show pseudo code for the implementation. 12. What is the difference between a scheduling policy and a scheduling mechanism? 13. What are the important considerations for developing/choosing a scheduling policy? 14. Understand these terms in scheduling: service time, wait time, response time, turnaround time, throughput rate, arrival rate, service rate, nonpreemptive scheduling, preemptive scheduling, time quantum (timeslice). 15. Understand the following scheduling policies: first come first served, shortest job next, priority scheduling, deadline scheduling, round robin scheduling, round robin scheduling with overhead, multilevel queues. 16. Exercise problems 2-11 in Chapter 7 (pp. 280-282)....
View Full Document

This note was uploaded on 04/11/2010 for the course CECS 326 taught by Professor Staff during the Spring '08 term at CSU Long Beach.

Ask a homework question - tutors are online