Chng 8: B nh o

Duy Phan

04/2015

Cu hi n tp chng 7
Khi no

Duy Phan

B nh o

Mc tiu
Hiu c cc khi nim tng quan v b nh o

Hiu v vn dng cc k thut ci t c b nh

o:

Demand Paging

Page Replacement

Demand Segmentation

Hiu c mt s vn trong b nh o

Duy Phan

Frames

Thrashing

B nh o

Ni dung
Tng quan v b nh o

Cai t b nh o: Demand Paging

Cai t b nh o: Page Replacement
Cac

gii thut thay trang (Page

Replacement Algorithms)

Vn cp phat Frames
Vn Thrashing
Cai t b b nh o: Demand Segmentation

Duy Phan

B nh o

Tng quan b nh o
Nhn xet: khng phi tt c cac phn cua mt process cn

thit phi c nap vao b nh chinh tai cung mt thi im

Vi d:

oan ma iu khin cac li him khi xy ra

Cac arrays, list, tables c cp phat b nh (cp phat

tinh) nhiu hn yu cu thc s

Mt s tinh nng it khi c dung cua mt chng trinh

C chng trinh thi cung co oan code cha cn dung

B nh o (virtual memory): B nh o la mt k thut cho

phep x ly mt tin trinh khng c nap toan b vao b

nh vt ly

Duy Phan

B nh o

B nh o (tt)
u im cua b nh o

S lng process trong b nh nhiu hn

Mt process co th thc thi ngay c khi kich

thc cua no ln hn b nh thc

Gim nhe cng vic cua lp trinh vin

Khng gian trao i gia b nh chinh va b nh

ph(swap space).
Vi d:

Duy Phan

swap partition trong Linux

file pagefile.sys trong Windows

6

B nh o

Ci t b nh o
Co hai k thut:

Phn trang theo yu cu (Demand Paging)

Phn oan theo yu cu (Segmentation Paging)

Phn cng memory management phi h tr

paging va/hoc segmentation

OS phi qun ly s di chuyn cua trang/oan gia

b nh chinh va b nh th cp
Trong chng nay,

Duy Phan

Chi quan tm n paging

Phn cng h tr hin thc b nh o

Cac gii thut cua h iu hanh

7

B nh o

Phn trang theo yu cu

Demand paging: cac trang cua qua trinh chi c

nap vao b nh chinh khi c yu cu.

Khi co mt tham chiu n mt trang ma khng co
trong b nh chinh (valid bit) thi phn cng se gy
ra mt ngt (goi la page-fault trap) kich khi pagefault service routine (PFSR) cua h iu hanh.
PFSR:
Chuyn process v trang thai blocked
Phat ra mt yu cu oc ia nap trang c
tham chiu vao mt frame trng; trong khi i
I/O, mt process khac c cp CPU thc thi
Sau khi I/O hoan tt, ia gy ra mt ngt n h
iu hanh; PFSR cp nht page table va chuyn
process v trang thai ready.
Duy Phan

B nh o

Li trang v cc bc x l

Duy Phan

B nh o

Thay th trang nh
Bc 2 cua PFSR gi s phi thay trang vi khng tim

c frame trng, PFSR c b sung nh sau:

Xac inh vi tri trn ia cua trang ang cn

Tim mt frame trng:

Nu

co frame trng thi dung no

Nu

khng co frame trng thi dung mt gii thut

thay trang chon mt trang hy sinh (victim page)
victim page ln ia; cp nht page table va
frame table tng ng

Ghi

Duy Phan

oc trang ang cn vao frame trng (a co c t

bc 2); cp nht page table va frame table tng
ng.
10

B nh o

Thay th trang nh (tt)

Duy Phan

11

B nh o

Cc gii thut thay th trang

Hai vn chu yu:
Frame-allocation algorithm
Cp phat cho process bao
nhiu frame cua b nh
thc?
Page-replacement algorithm
Chon frame cua process se
c thay th trang nh
Mc tiu: s lng page-fault
nho nht
c anh gia bng cach
thc thi gii thut i vi mt
chui tham chiu b nh
(memory reference string) va
xac inh s ln xy ra page
fault
Duy Phan

12

Vi d
Th t tham chiu cac ia chi
nh, vi page size = 100:
0100, 0432, 0101, 0612, 0102,
0103, 0104, 0101, 0611, 0102,
0103, 0104, 0101, 0610, 0102,
0103, 0104, 0101, 0609, 0102,
0105
cac trang nh sau c tham
chiu ln lt = chui tham chiu
b nh (trang nh)
1, 4, 1, 6, 1,
1, 1, 1, 6, 1,
1, 1, 1, 6, 1,
1, 1, 1, 6, 1,
1
B nh o

Gii thut thay trang FIFO

Cac d liu cn bit ban u:

Duy Phan

S khung trang

Tinh trang ban u

Chui tham chiu

13

B nh o

Nghch l Belady

Duy Phan

14

B nh o

Nghch l Belady

Bt thng (anomaly) Belady: s page fault tng

mc du qua trinh a c cp nhiu frame hn.
Duy Phan

15

B nh o

Gii thut thay trang OPT

Gii thut thay trang OPT

Thay th trang nh se c tham chiu tr nht

trong tng lai

Vi d: mt process co 7 trang, va c cp 3 frame

Duy Phan

16

B nh o

Gii thut thay trang LRU

Mi trang c ghi nhn (trong bng phn trang) thi im

c tham chiu trang LRU la trang nh co thi im tham

chiu nho nht (OS tn chi phi tim kim trang nh LRU nay mi
khi co page fault)

Duy Phan

Do vy, LRU cn s h tr cua phn cng va chi phi cho vic

tim kim. It CPU cung cp u s h tr phn cng cho gii thut
LRU.

17

B nh o

LRU v FIFO
So sanh cac gii thut thay trang LRU va FIFO

Duy Phan

18

B nh o

S lng frame cp cho process

OS phi quyt inh cp cho mi process bao nhiu frame.

Cp it frame

nhiu page fault

Cp nhiu frame gim mc multiprogramming

Chin lc cp phat tinh (fixed-allocation)

S frame cp cho mi process khng i, c xac

inh vao thi im loading va co th tuy thuc vao tng
ng dng (kich thc cua no,)

Chin lc cp phat ng (variable-allocation)

Duy Phan

S frame cp cho mi process co th thay i trong khi

no chay
Nu

ty l page-fault cao cp thm frame

Nu

ty l page-fault thp gim bt frame

OS phi mt chi phi c inh cac process

19

B nh o

Chin lc cp pht tnh

Cp phat bng nhau: Vi d, co 100 frame va 5

process mi process c 20 frame

Cp phat theo ti l: da vao kich thc process

V d:

Cp phat theo u tin

Duy Phan

20

B nh o

Tr tr trn ton b h thng

Nu mt process khng co u s frame cn thit thi

ti s page faults/sec rt cao.

Thrashing: hin tng cac trang nh cua mt

process bi hoan chuyn vao/ra lin tc.

Duy Phan

21

B nh o

M hnh cc b
han ch thrashing, h iu hanh phi cung cp

cho process cang u frame cang tt. Bao nhiu

frame thi u cho mt process thc thi hiu qu?
Nguyn ly locality (locality principle)

Locality la tp cac trang c tham chiu gn

nhau

Mt process gm nhiu locality, va trong qua

trinh thc thi, process se chuyn t locality nay
sang locality khac

Vi sao hin tng thrashing xut hin?

Khi

Duy Phan

size of locality > memory size

22

B nh o

Gii php tp lm vic

c thit k da trn nguyn ly locality.

Xac inh xem process thc s s dng bao nhiu

frame.
inh nghia:

WS(t) - s lng cac tham chiu trang nh cua

process gn y nht cn c quan sat.
- khong thi gian tham chiu

Vi d:

=4
chui tham khao
trang nh

24569132639214
thi im t1

Duy Phan

23

B nh o

Gii php tp lm vic (tt)

inh nghia: working set cua process Pi , ky hiu WSi , la tp

gm cac trang c s dng gn y nht.

V d: = 10 v

chui tham khao trang

Nhn xet:

Duy Phan

qua nho khng u bao phu toan b locality.

qua ln bao phu nhiu locality khac nhau.

bao gm tt c cac trang c s dng.

Dung working set cua mt process

xp xi locality cua no.
24

B nh o

Gii php tp lm vic (tt)

inh nghia: WSSi l kch thc cua working ser cua

Pi:

WSSi = s lng cc trang trong WSi

V d: = 10 v

chui tham khao trang

WSS(t1) = 5

Duy Phan

WSS(t2) = 2

25

B nh o

Gii php tp lm vic (tt)

t D = WSSi = tng cac working-set size cua

moi process trong h thng.

Nhn xet: Nu D > m (s frame cua h thng)

se xy ra thrashing.

Gii phap working set:

Khi khi tao mt qua trinh: cung cp cho qua

trinh s lng frame thoa mn working-set size
cua no.

Nu D > m tam dng mt trong cac process.

Cac

trang cua qua trinh c chuyn ra ia

cng va cac frame cua no c thu hi.

Duy Phan

26

B nh o

Gii php tp lm vic (tt)

WS loai tr c tinh trang tri tr ma vn

m bo mc a chng
Theo vt cac WS? => WS xp xi (oc thm

trong sach)
oc thm:

Duy Phan

thng tp tin

thng nhp xut

thng phn tn

27

B nh o

n tp
C

Duy Phan

28

B nh o

Bi tp
C ch:

Duy Phan

29

B nh o

Kt thc chng 8

Duy Phan

04/2015