tutorial7 - CSCC69 Tutorial 7 Dan Zingaro June 21, 2010...

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

View Full Document Right Arrow Icon
CSCC69 Tutorial 7 Dan Zingaro June 21, 2010
Background image of page 1

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

View Full DocumentRight Arrow Icon
From Fall 2003 Midterm True/false: I a) Multiple threads in the same process share all code and data resources. I b) Hardware support is needed to synchronize more than two processes. I c) It is possible for a single process to deadlock with itself. I d) Minimizing turnaround time is the most important criteria in choosing a scheduling algorithm for an interactive system. I e) With dynamic partitioning, all memory allocated for a process must be contiguous.
Background image of page 2
From Fall 2005 Midterm True/false: I a) Context switch time on modern hardware is small enough to be ignored entirely when designing a CPU scheduler. I c) Setting the “base” and “limit” registers are privileged operations. I d) Setting the program counter register is a privileged operation. I e) Deadlocks can always be detected by finding a cycle in a resource allocation graph. I f) Shortest-job-first scheduling is not suitable for a general-purpose computer system.
Background image of page 3

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

View Full DocumentRight Arrow Icon
.. The next slide contains pthreads code. What is the output of the
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/05/2011 for the course CS 69 taught by Professor Cathy during the Summer '10 term at University of Toronto- Toronto.

Page1 / 8

tutorial7 - CSCC69 Tutorial 7 Dan Zingaro June 21, 2010...

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

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