Mid2-review

Mid2-review - Chapter 7 Deadlocks Necessary conditions for...

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

View Full Document Right Arrow Icon
Silberschatz and Galvin 1999 7.1 Chapter 7: Deadlocks Necessary conditions for deadlock Mutually exclusive access, hold and wait, no preemption, circular wait, Under what conditions a cycle in the resource allocation graph is necessary and sufficient for deadlock Deadlock handling strategies Prevention, avoidance, detection and recovery, ignoring What is a safe state? Does an unsafe state imply deadlock Banker’s algorithm for deadlock avoidance Deadlock detection algorithm (Section 7.6)
Background image of page 1

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

View Full DocumentRight Arrow Icon
Silberschatz and Galvin 1999 7.2 Chapter 8 – Memory Management Overlays, physical and logical address space Swapping Memory allocation for processes Contiguous allocation – advantages and disadvantages – external and internal fragmentation Paged allocation Address translation under paged allocation Page table implementation Associative registers, Translation look aside buffers Effective access time calculation Two level paging scheme
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 12/14/2010.

Page1 / 6

Mid2-review - Chapter 7 Deadlocks Necessary conditions for...

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