Computer Science 162 - Spring 1990 - Anderson - Midterm 2

Computer Science 162 - Spring 1990 - Anderson - Midterm 2 -...

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

View Full Document Right Arrow Icon
CS162 Spring 1990, MT2 CS 162, Spring 1990 Midterm #2 Professor David Anderson Problem #1 (10 points) true/false -I/O buffering can increase CPU utilization. -The two "sides" of a UNIX pseudo-tty are equivelent. -Shortest CPU burst first process scheduling minimizes average turnaround time. -Sun NFS client caches are always consistent -Data can flow both up and down between adjacent protocol layers. Problem #2 (10 points) a) List three input functions and one output function of the BSD UNIX line discipline in cooked mode b) Would system performance increase or decrease if line disciplines were moved from the kernel to the user level? Explain. Problem #3 (10 points) a) What does it mean to say that access to a resource is "fair"? b) What is "aging"? Under what circumstances does aging provide fairness and why? c) The "fair share scheduler" used in some versions of UNIX provides a different kind of fairness.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

Computer Science 162 - Spring 1990 - Anderson - Midterm 2 -...

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

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