CECS 526 REVIEW TOPICS FOR FINAL

jaspersugarlandΛογισμικό & κατασκευή λογ/κού

14 Δεκ 2013 (πριν από 3 χρόνια και 7 μήνες)

282 εμφανίσεις

CECS 526


REVIEW TOPICS FOR
MIDTERM 3


Midterm 3

is scheduled on
Thursday
,
12/8
/11
.
The
midterm

is a cl
osed
-
book and closed
-
notes exam, and

will cover

the
topics listed below
.


1.

Process deadlock



Necessary conditions for deadlock



Deadlock prevention

o

Denial of the possibility of one of the necessary conditions



Deadlock avoidance with maximum claim information

o

Safe
-
state checking algorithm



Deadlock detection

o

Graph models, graph reduction algorithm

o

Decision rules with only reusable re
sources

o

Decision rules with reusable and consumable resources

o

Sufficient conditions for deadlock

o

Difficulties with deadlock detection



Critiques of each approach


2.

Distributed

deadlock problems



Deadlock handling strategies
(prevention, avoidance, detection/
resolution)
and their practicality in distributed
systems



System model for the study of distributed deadlock problem



Important issues in deadlock detection (maintenance of the WFGs and search of WFGs for cycles)



Difficulty in deadlock detection/resolution
unique in distributed systems (phantom deadlocks)



Control or
ganizations for deadlock detection in distributed systems

(centralized, distributed, hierarchical)



D
eadlock detection

algorithms in distributed control

o

Obermarck's path
-
pushing algorithm

o

Chandy
-
Misra
-
Haas's edge
-
chasing algorithm


3.

Resource management


memory management



Problems with fixed and variable partition memory (internal and external fragmentation, storage compaction)



Policies relevant in memory management (fetch, placement, and

replacement)



Virtual memory implemented with paging



Instruction execution in a paged virtual memory system



Hardware support required (registers or associative memory, address mapping hardware, extra bits for the
implementation of page replacement polices)



Effective memory access time as a function of the page fault rate, and as a function of the hit ratio in associative
memory



Demand paging



Page Replacement

o

Optimal replacement algorithm

o

Other replacement algorithms (LRU, LFU, FIFO, LIFO, etc.)

o

FIFO anomaly

o

Stack algorithms



Working sets (definition, working set principle, required hardware support, salient features)