Download as pdf or txt
Download as pdf or txt
You are on page 1of 51

H IU HHH

Qun l b nh

Quan ly bo nh

Cac kieu a ch nh
Chuyen oi a ch nh
Overlay va swapping
Mo hnh quan ly bo nh n gian

Fixed partitioning
Dynamic partitioning
C che
che phan
phan trang (paging)
C che phan oan (segmentation)

-9.2-

V sao phi qun l b nh

Mt chng trnh mun chy th phi c np vo


trong b nh chnh.

Vn :

Khi no np?
Np vo u?
Np nhng phn no?

Qun l b nh gip ti u ha hot ng ca b nh

Ti u ha s tin trnh cng lc trong b nh chnh nng


g
cao tnh a chng
Tn dng ti a b nh ca my tnh

-9.3-

B nh

L mt dy cc nh lin tc nhau
Mi nh (mt word) c mt a ch
Chng
g trnh = tp
p cc cu lnh
((ch th my)
y) + d liu

Np chng trnh vo b nh t cc ch th v d liu vo cc


nh xc nh nh x gia cc ch th, d liu vo a ch trong b
nh
0

MOV AX, 10

MOV BX, 20

ADD AX, AX, BX

12
16

-9.4-

Cac kieu a ch nh

a ch vat ly (physical address) (a ch thc, a ch tuyet oi) la

mot v tr thc trong bo nh chnh.

a ch luan ly (logical address) la mot v tr nh oc lap vi cau

truc, to chc vat ly cua bo nh.

Cac trnh bien dch


((compiler)
p ) tao
ra ma lenh chng
g trnh ma trong
g
o moi tham chieu bo nh eu la a ch luan ly

a
ch tng
g oi ((relative address)) la mot kieu a
ch luan ly
y

trong o cac a ch c bieu dien tng oi so vi mot iem


xac nh nao o trong chng trnh (v du: 12 byte so vi iem
bat au chng trnh)
Khi mot lenh c thc thi, cac tham chieu en a ch luan ly
phai c chuye
p
y n oi thanh a
ch thc. Thao tac chuye
y n oi
nay thng co s ho tr cua phan cng e at hieu suat cao.
-9.5-

Nap chng trnh vao bo nh

Bo linker: ket hp cac object module thanh mot file nh phan kha
thc thi goi la load module.
Bo loader: nap
nap load module va
vao
o bo nh
nh chnh
System
Library
y

dynamic linking

static linking

System
S
t
Library
-9.6-

C che thc hien linking


0

CALL B

L-1
0

L
Length
th L

Relocatable
object modules

Return

Module A
JMP L

L-1 Return
L

Module B
CALL C

M-1

Module A

Length M

Load module

Module B
JMP L+M

L+M-1 Return

Return

L+M Module C

Module C
Length N
L+M+N-1 Return

N-1
N
1

Return

-9.7-

Chuyen oi a ch nh

Chuyen oi a ch la qua trnh anh xa mot a ch t khong gian


a ch nay sang khong gian a ch khac.
Bieu dien
Bieu
dien a ch nh
nh
Trong source code: symbolic (cac bien, hang, pointer,...)
Thi iem bien dch: la a ch kha tai nh v (relocatable address),
y la a
ch tng
g oi ((relative address))
hay
V du: a v tr 14 bytes so vi phan header cua module.
Thi iem linking/loading: la a ch tuyet oi. V du: d lieu nam tai
a ch bo nh thc: 2030

int I;
goto p1;

2000

250

2250

p1

Symbolic address

Relocatable address

Absolute address
(Ph i l memory))
(Physical
-9.8-

Chuyen oi a ch

a ch cua lenh (instruction) va d lieu (data) c chuyen


oi thanh a ch vat ly, viec nay co the xay ra tai ba thi
iem khac nhau
Compile time: neu biet trc a ch bo nh th co the ket gan
a ch vat ly luc bien dch.

V du
du:: chng trnh .COM
COM cua
cua MS
MS-DOS,
DOS phat
phat bieu
bieu assemply
Khuyet iem: phai bien dch lai neu thay oi a ch

Load time: tai thi iem bien dch, neu khong biet a ch thc
th vao thi iem loading, phai chuyen oi a ch kha tai nh
v ((relocatable)) theo mot a
ch nen ((base address).
)
a ch thc c tnh toan lai vao thi iem chng trnh thc thi
phai tien hanh reload neu a ch base thay oi.

-9.9-

Chuyen oi a ch vao thi iem thc


thi
Execution time: qua trnh chuyen oi
c tr hoan en thi iem thc thi
(run time)
Trong
T
qua trnh
h th
h c thi,
hi process co
the c di chuyen t segment nay
sang segment khac trong bo nh.
CPU tao
tao ra ca
cac
c a ch tng o
oii
cho process
Can s ho tr cua phan cng cho
viec anh xa a ch (v du co thanh
ghi
hi base
b
va limit,...)
li it )
S dung trong a so cac OS a
dung (general-purpose) trong o co
pp g, paging,
p g g,
cac c che swapping,
segmentation

Relative (relocatable)
addresses
0
JMP 400
400
LOAD 1200

1200

max

= 2000

-9.10-

Dynamic linking

Qua trnh link mot so module ngoai (external module) c thc


hien sau khi a tao xong load module (i.e. file co the thc thi)
V du
du: ttrong
o g Windows,
do s, module
odu e ngoa
goai la
a cac
cac file
e .DLL;; co
con ttrong
o gU
Unix,,
cac module ngoai la cac file .so (shared library)

Load module ch cha cac tham chieu ((reference)) en cac


external module. Cac tham chieu nay co the c chuyen oi vao
hai thi iem sau:
Loading time (load-time dynamic linking)
Run time: khi co mot li goi en thu tuc c nh ngha trong
external module (run-time dynamic linking)

He ieu hanh chu trach nhiem tm cac external module va ket


noi vao load module (kiem tra xem external module a nap vao
bo nh cha)

-9.11-

u iem cua dynamic linking

Thong thng, external module la mot th vien cung cap cac tien
ch cua OS. Cac chng trnh thc thi co the dung cac phien ban
khac nhau cua external module ma khong can sa oi, bien dch

lai.

Chia se
se ma
ma (code sharing): mot external module ch ca
can
n na
nap
p vao
vao
bo nh mot lan. Cac process can dung external module nay th
cung chia se oan ma cua external module tiet kiem khong
gian nh va a.
g

Dynamic linking can s ho tr cua OS trong viec kiem tra xem


mot thu
thu tu
tuc
c na
nao
o o
o co
co the
the
c
c chia se
se gia
gia cac
cac process hay la
la
phan ma cua rieng mot process ( bi v ch co OS mi co quyen
thc hien viec kiem tra nay).

-9.12-

Dynamic loading

C che: ch khi nao c goi en th mot thu tuc mi c nap

vao bo nh chnh tang o hieu dung cua bo nh (memory


utilization)) bi v cac thu tuc t c dung se khong chiem cho
trong bo nh

Rat hieu q
qua trong
g trng hp
p ton tai khoi lng
g ln ma chng
g
trnh khong c s dung thng xuyen (v du cac thu tuc x ly
loi)
Khong can s ho tr ac biet cua he ieu hanh
Thong thng, user chu trach nhiem thiet ke va hien thc cac
chng
g trnh co dynamic-loading.
y
g
He ieu hanh chu yeu cung cap mot so thu tuc th vien ho tr, tao
ieu kien de dang hn cho lap trnh vien

-9.13-

C che overlay

Tai moi thi iem, ch gi lai trong bo nh nhng lenh hoac d


lieu can thiet, giai phong cac lenh/d lieu cha hoac khong can
dung en.
C che nay rat hu dung khi kch thc mot process ln hn
khong gian
g
bo nh cap cho process
p
o.
C che nay c ieu khien bi ngi s dung (thong qua s ho
tr cua
tr
cua cac
cac th vien lap trnh) ch
ch khong
khong ca
can
n s
s ho
ho tr
tr cua
cua he
ieu hanh

-9.14-

C che overlay (tt)


Pass 1

70KB

Pass 2

80KB

Symbol table

20KB

Common routines

30KB

Assembler
Total memory
available = 150KB

pass 1

symbol
table

20KB

common
routines

30KB

overlay
driver

10KB
80KB
pass 2

70KB
-9.15-

C che swapping

Mot process co the tam thi b swap ra khoi bo nh


chnh va lu tren mot he thong lu tr phu. Sau o,
process co
co the
the
c
c nap
nap lai
lai va
vao
o bo nh
nh e
e tiep
tiep tu
tuc
c
qua trnh thc thi
Round-robin: swap-out A, swap-in B, thc thi C
Roll out, roll in dung trong c che nh thi theo o u tien
(priority-based scheduling)
Process co o u tien thap hn se b swap-out
p
nhng
cho cho process co o u tien cao hn c nap vao bo
nh e thc thi
Medium-term scheduler

-9.16-

Minh hoa c che swapping

-9.17-

Mo hnh quan ly bo nh thc

Trong chng nay, mo hnh quan ly bo nh la mot mo hnh n


gian, khong co bo nh ao.
Mot process phai c nap hoan toan vao bo nh th mi c
thc thi (ngoai tr viec s dung c che overlay).
Cac c che quan ly bo nh thc sau ay rat t (hau nh khong
con) c dung trong cac he thong hien ai, tuy nhien o la cac
y tng
y
tng c s
s cho mo
mo hnh quan
quan ly
ly bo nh
nh ao
ao sau nay:
nay:

Phan chia co nh (fixed partitioning)


Phan chia ong (dynamic partitioning)
Phan trang n gia
Phan
gian
n (simple paging)
Phan oan n gian (simple segmentation)

-9.18-

Phan manh (fragmentation)

Phan manh ngoai (external fragmentation)


Kch thc khong gian bo nh con trong u e thoa man mot
yeu cau
yeu
cau cap
cap phat,
phat tuy nhie
nhien
n khong
khong gian nh
nh nay
nay kho
khong
ng lie
lien
n
tuc phai dung c che ket khoi (compaction).

Ph n manh noi (internal


Pha
(i t
l fragmentation)
f
t ti )
Kch thc vung nh c cap phat hi ln hn vung nh yeu
cau. V du: cap mot khoang trong 18.464 bytes cho mot
process yeu cau 18.462 bytes
Hien tng phan manh noi thng xay ra khi bo nh thc
(physical memory) c chia thanh cac khoi kch thc co
nh(fixed-sized block) va cac process c cap phat theo
n v khoi. V du: c che phan trang (paging)

-9.19-

Phan manh noi


operating
system
y

yeu cau ke tiep la


18.462 bytes!!!

(used)
hole kch thc
18 464 bytes
18.464

can quan ly khoang


trong 2 bytes!?!

OS se cap phat han khoi 18.464 bytes cho yeu cau


process d ra 2 bytes
y
khong dung!
g
cua p

-9.20-

Fixed partitioning

Chia bo nh chnh thanh nhieu


phan khong trung lap goi la cac
partition co kch thc bang
p
nhau hoac khac nhau
Process nao co kch thc nho
hn hoac bang kch thc
partition th co the nap vao
partition o.
Neu chng
g trnh co kch thc
ln hn partition th phai dung
c che overlay.
Nhan xet
Khong hieu qua do b phan
g trnh du
manh noi: mot chng
ln hay nho eu chiem tron mot
partition.
-9.21-

Chien lc placement

Partition co kch thc bang nhau


Con mot partition trong process
partition o
mi c nap vao p
Khong con partition trong nhng
trong o co process ang b blocked
swap process o ra bo nh phu
nh
hng cho
h cho
h process m
i.

Partition co kch thc khong bang


nhau
G
Gan moi process vao partition
i i nho
h
nhat phu hp vi no
Co hang i cho moi partition
Giam
Giam thie
thieu
u phan
phan manh
manh noi
Van e: co the co mot so hang i
trong khong (v khong co process vi
kch thc
thc tng ng)
ng) va
va hang
hang
ii
day ac
-9.22-

Chien lc placement (tt)

Partition co kch thc khong


bang nhau
Ch co mot hang i chung
g
cho cac partition
Khi can nap mot process vao
bo nh chnh chon
partition
i i nho
h nha
h t con trong

-9.23-

Dynamic partitioning

So lng partition khong co nh va partition co kch thc khac


nhau
Moi process c cap phat chnh xac dung lng bo nh can
thiet
Gay ra hien tng phan manh ngoai (external fragmentation)

-9.24-

Chien lc placement

Dung e quyet nh cap phat


khoi bo nh trong nao cho
mot process
Muc tieu: giam thieu chi ph
compaction (time consuming)
Cac chie
Cac
c en lc
c p
placement
ace e
Best-fit: chon khoi nh trong
nho nhat
First-fit: chon khoi nh trong
phu hp au tien ke t au
bo nh
Next-fit: chon khoi nh trong
phu
h h
hp au
tien
ti ke
k t
t v tr
t
cap phat cuoi cung
Worst fit: chon khoi nh
trong l
trong
ln
n nha
nhatt

-9.25-

Phan trang (paging)

C che phan trang cho phep khong gian a ch thc (physical


address space) cua mot process co the khong lien tuc nhau.
Bo nh
nh th
thc
c
c
c chia tha
thanh
nh ca
cac
c kho
khoii kch thc
thc co
co nh bang
bang
nhau goi la frame.
Thong thng kch thc cua frame la luy tha cua 2, t khoang 512
byte
y en 16MB

Bo nh luan ly (logical memory) cung c chia thanh khoi cung


kch thc goi la trang nh (page).
He ie
ieu
u hanh
hanh phai
phai thie
thiett lap mot bang
bang phan
phan trang (page table) e
e
anh xa a ch ao, luan ly thanh a ch thc
Moi process co mot bang phan trang c quan ly bang mot con tro
lu g
gi trong
g PCB. Cong viec nap bang phan trang
g vao he thong (do
CPU dispatcher thc hien) la mot phan cua chuyen ng canh

C che phan trang khien bo nh b phan manh noi, tuy nhien lai
khac phuc c phan manh ngoai.

-9.26-

C che phan trang

frame
number

page 0

0
0

page 2

page 3

page 1

logical memory

page table

page 0

2
3

page 2

page 1

page 3
physical memory
-9.27-

Mo hnh chuyen oi a ch

a ch nh do CPU tao ra (logical address) gom co:


Page number (p) c dung lam ch muc trong bang phan
t
trang.
M
Moi muc ttrong b
bang pha
h n ttrang ch
ha
a ch
h c
s
(h
(hay
ch so frame) cua trang tng ng trong bo nh thc.
Page offset (d) c ket hp vi a ch c s (base address)
e nh v mot a ch thc.

Neu kch thc cua khong gian a ch ao la 2m, kch


thc cua
thc
cua trang la
la 2n
page offset

page number
p

m-n bits
((nh v t 0 2m-n -1))

n bits
(nh v t 0 2n-1)

Do o, bang phan trang se co tong cong 2m/2n = 2m-n muc


-9.28-

Paging hardware
physical
address

logical
address
CPU

f
f000 0000
f0000000

d
f1111111

p
f

Neu kch thc cua khong


gian nh thc la 2l bytes,
th moi muc cua bang phan
t
trang
co l-n
l bits
bit

p y
physical
memory
page table
frame number frame offset
f (l-n bits)
d (n bits)
-9.29-

Chuyen oi bo nh vi paging

-9.30-

Hien thc bang phan trang

Bang phan trang c lu gi trong bo nh chnh (kernel


memory)
M
Moi process co mot b
bang pha
h n ttrang
Thanh ghi page-table base (PTBR) tro en bang phan trang
Thanh ghi page-table length (PTLR) bieu thi kch thc cua bang
phan trang (va dung e bao ve bo nh)

Moii tac
Mo
tac vu
vu truy cap d
d lieu/lenh can
can hai thao tac
tac truy xua
xuatt
vung nh
Mot thao tac truy xuat bang phan trang (page number: p) va mot
thao tac
tac truy xuat
xuat d
d lieu/lenh (page offset: d displacement)
Thng dung mot bo phan cache phan cng co toc o truy xuat
va tm kiem cao, goi la thanh ghi ket hp (associative register)
hoac translation look-aside
look aside buffers (TLBs)
-9.31-

Associative register (hardware)

Thanh ghi ket hp (associative register): ho tr tm kiem truy xuat d


lieu ong thi vi toc o cc nhanh.
page #

frame #

So muc cua TLB


khoang 8 2048
TLB la
la cache
cache cua
cua
bang phan trang
Khi co chuyen ng
canh TLB b xoa
canh,
xoa
Khi TLB b ay, thay
the bang LRU

Anh xa a ch ao (A, A)
Neu A nam trong TLB (hit) lay ngay c ch so frame tiet kiem c
~ 10% thi gian tm kiem.
Ngc lai (miss), phai tm ch so frame t bang phan trang nh bnh thng.
-9.32-

Paging hardware vi TLB

-9.33-

Bao ve bo nh

Viec bao ve bo nh c hien thc bang cach gan vi frame cac bit
bao ve (protection bits). Cac bit nay bieu th cac thuoc tnh sau
read-only,
d
l read-write,
d it execute-only
t
l

Ngoaii ra, con


Ngoa
con co
co mot valid
valid-invalid
invalid bit gan
gan vi
vi mo
moii muc
muc trong bang
bang
phan trang
valid: cho biet la trang bo nh tng ng nam trong khong gian nh a
ch ao
ao cua
cua process
process, do o
o la
la mot trang h
hp
p le.
invalid: cho biet la trang bo nh tng ng khong nam trong khong gian
nh a ch ao cua process, do o la mot trang bat hp le.

-9.34-

Bao ve bang valid-invalid bit


00000

page 0

page 2

0
1
2

page 0

page 1

page 2

page 3

page 6

page 4

page 7

page 5

page 4
12287
8

valid-invalid bit

page 1

page 3

10468

frame number

page 5

...

Moi trang nh co kch thc 2KB = 2048 bytes


Process co kch thc 10,468bytes phan manh noi page 5
cac
cac a ch > 12287 la
la cac
cac a ch invalid
invalid.
Dung PTLR e kiem tra kch thc bang phan trang

page n

-9.35-

Hierarchical page table

Cac he thong hien ai eu ho tr khong gian a ch ao rat ln (232


en 264).
Kch thc
thc trang nh
nh la
la 4KB (=
( 212) bang
bang phan
phan trang se
se co
co ~ 232/212 =
220 = 1M entries.
Gia s moi phan t la mot con tro 32 bit th moi process can 4MB cho
bang phan
bang
phan trang

Mot giai phap c at ra la chia thanh nhieu bang phan trang quan
ly cac vung khong gian bo nh ao khac nhau bang a mc
(multilevel paging table).
C che tao bang phan trang 2-mc (two-level page table), hay con
c goi la forward-mapped page table trong he thong Intel
P ti -II
Pentium
II
-9.36-

Mo hnh bang 2-mc (two-level)

-9.37-

Phan trang 2-mc

Mot a ch luan ly (tren he thong 32-bit vi trang nh 4KB) c


chia thanh cac phan sau:
Page
age number:
u be 20
0 bit
bt
Neu moi muc 4 byte
220 * 4 byte = 4 MB
Page offset: 12 bit

20 bit

offset
12 bit

Bang phan trang cung b chia nho nen page number cung c chia
nho thanh
nho
thanh 2 phan:
phan:
10-bit page number
10-bit page offset

page #

page number
p1
10 bit

p2
10 bit

page offset
d
12 b
bitt

V vay, mot a luan ly se bieu dien nh hnh ve


p1 : ch muc cua bang ngoai (outer page table)-mc 1
p2 : o d
dii (displacement)
trong trang m
mc
c 2 (xac
(xac nh bi
bi *p
p1)
-9.38-

S o anh xa a ch

S o anh xa a ch (address-translation scheme) cho kien truc


bang phan trang 2 mc, 32-bit a ch

Memory Address: A

-9.39-

Phan trang a mc (multilevel)

Khong gian a ch luan ly 64-bit vi trang nh 4KB

Trong s o phan trang 2-mc, so muc cua bang phan trang =


252 (264/212 = 252) qua ln. Thc hien tng t mo hnh 2 mc,
pha
h n chia
hi tha
th nh ba
b ng 3,
3 4,...,
4
n-m
c
page number
52

page offset
12

page number
b
page offset
ff t
32
10 10
2

page number
42
10

page offset
12

page number
b
page offset
ff t
22 10 10 10
2

He thong SPARC 32-bit ho tr c che 3-mc con cac he thong


Motorolla 68030 32 bit ho tr c che 4-mc. He thong 64bit
Ult SPARC th dung
UltraSPARC
d bang
b phan
h trang
t
7
7-mc

Hieu suat cua he thong phan trang a mc?


-9.40-

Bang bam (hashed page table)

Dung bang bam e giam bt khong gian bang phan trang, tang toc
o tm kiem trang.
Ra
att pho
p ob
bie
en ttrong
o g cac
cac he
e tho
t ong l
n hn
3
32 b
bitt a ch.
c

e giai quyet ung o, moi entry cua bang phan trang c gan mot
danh sa
sach
ch lien
lien ket.
ket. Mo
Moii pha
phan
n t
t danh sa
sach
ch cha
cha ch so
so trang a
ao
o
(virtual page number) va ch so frame tng ng.
Ch so trang ao c bien oi qua ham bam thanh mot hashed value.
Cac thong tin nh ch so trang ao va ch so frame se c lu vao danh
sach lien ket tai v tr ng vi hashed value.

Giai thuat do tm trang:


Ch so trang ao c bien oi thanh hashed value (vi cung ham bam
nh tren). Hashed value c dung e truy xuat en entry tng ng
trong bang phan trang. Sau o, do tm trong danh sach lien ket phan t
cha ch so
cha
so trang a
ao
o e
e trch rut
rut ra c
c so
so frame tng ng.
ng
-9.41-

Hashed page tables

Cac he thong 64-bit a ch thng dung clustered page table, i.e.


moi muc ttrong h
hash
h ttable
bl tham
th
chie
hi u
en nhie
hi u ttrang ((~ 16 trang)
t
)
thay v 1 trang.
-9.42-

Chia se cac trang nh


Process 1

ed 1

data 1

ed 2

data 3

ed 3

ed 1

ed
d2

data 1

Process 2
ed 1

ed 2

ed 3

data 2

ed 3
ed 1

ed 2

ed 2

data 3

data 2

8
9
10

Process 3
-9.43-

Phan oan (segmentation)

Nhn lai c che phan trang


user-view (khong gian a ch ao) tach biet vi khong gian bo nh thc.
C che p
phan trang
g thc hien p
phep anh xa user-view vao bo nh thc.

Trong thc te, di goc nhn cua user, mot chng trnh cau thanh t
nhieu p
phan oan (segment).
( g
) Moi p
phan oan la mot n v luan ly
y,, v
du nh:
main program, procedure, function, local variables, global variables,
common block, stack, symbol table, arrays

C che phan oan la mo hnh quan ly bo nh ho tr user-view


Khong gian a ch ao la mot tap cac phan oan (segment), moi phan
oan co ten va kch thc rieng.
Mot a ch luan ly c nh v bang ten phan oan va o di (offset)
ben trong phan oan o

-9.44-

User-view cua mot chng trnh

Thong thng, mot chng trnh


c bien dch. Trnh bien dch se
t ong xay dng cac segment.
g
V du, trnh bien dch Pascal se tao
ra ca
cac
c segment sau:

Global variables
Procedure call stack
Procedure/function code
Local variable

Trnh loader se
se gan
gan moi
moi segment
mot so nh danh rieng.

stack
procedure
p
symbol
table
function
sqrt
main program

Logical address space

-9.45-

Mo hnh c che phan oan


user space

physical memory space


1

4
2

3
4

3
2

-9.46-

To chc cua c che phan oan

a ch luan ly la mot cap gia tr


<segment-number, offset>

Bang phan oan (segment table)


base cha a ch khi au cua phan oan trong bo nh
limit xa
xac
c nh kch thc
thc cu
cua
a pha
phan
n oa
oan
n

Segment-table base register (STBR): tro en v tr bang phan oan

Segment-table length register (STLR): so segment cua chng trnh

trong bo nh
nh

Mo
M t ch
h so segmentt s la
l h
hp le
l neu
s < STLR

-9.47-

Mot v du ve c che phan oan


stack

1400

procedure

segment 3
segment
g
0
function
sqrt

symbol
table

segment 4
main program

segment 1

segment 2

limit

base

1000

1400

400

6300

400

4300

1100

3200

1000

4700

segment
table

2400
3200

segment 3
4300
4700

segment 2
segment 4

5700
6300

Logical address space

segment 0

6700

segment 1

physical memory space


-9.48-

Phan cng ho tr phan oan


segment
table

s
limit base

CPU

<

yes

physical
memory

no
t
trap;
addressing
dd
i error
-9.49-

Chuyen oi bo nh phan oan

-9.50-

Chia se cac phan oan


editor

segment 0

data 1

segment 1

limit

base

25286

43062

4425

68348

segment table
process P1

Logical address space


process P1
editor

segment 0

data 2

segment 1

Logical
L
i l address
dd
space
process P2

43062

editor
68348
72773

limit

base

25286

43062

8850

90003

segment table
process P2
p

data 1

90003

d t 2
data
98553

physical memory
-9.51-

You might also like