ࡱ > | ~ { } bjbj55 4f _ _ D D 4 S L R R R R R R R T YW X R R R K K K F R K R K K L Q 0Y5p =
N 6 R R 0 S N W G W l Q Q W Q v ` T K D R R F S W D M : CS 4345-A: Operating Systems
Fall 2008 Syllabus
Class Time and LocationTBDInstructorDr. Chunlei LiuOffice HoursTBDOffice Location2130 Nevins HallOffice Telephone229-333-5781Email HYPERLINK "mailto:cliu@valdosta.edu" cliu@valdosta.edu please use subject CS4345Website HYPERLINK "http://www.valdosta.edu/~cliu" http://www.valdosta.edu/~cliu Course PrerequisitesCS 3101 and CS 3410Course DescriptionThis course aims at building for students a firm foundation of operating systems, with emphasis on process management, memory management, and file system management. Students will be exposed to not only the basic concepts such as processes, threads, paging, segmentation, and file systems; but also the advanced topics like CPU scheduling, process synchronization, deadlock control, and virtual memory, etc.Learning OutcomesAfter successful completion of this course, a student will be able to
Describe and explain fundamental concepts, principles and methods in operating systems, including
Functions and services of operating systems.
Processes and threads.
CPU scheduling.
Concurrency, mutual exclusion and synchronization issues in a multiprogramming environment.
Deadlocks, conditions for their occurrence, detection and avoidance using resource allocation graph and bankers algorithm.
Cache and virtual memory.
File interfaces, protection mechanisms and space management methods.
Compute, analyze and compare performance of various methods used in operating systems, including
Efficiency and fairness of various CPU scheduling algorithms.
Efficiency of memory allocation methods and page replacement policies.
Performance improvement of caches and virtual memory.
Write simple programs to implement or simulate methods in operating systems, including
Process scheduling.
Thread creation and management.
Process and thread synchronization.
Memory and file space allocation. Text(s)Avi Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System Concepts. 8th edition, John Wiley & Sons, 2008, ISBN: 978-0-470-12872-5.Grading ScaleAttendance 5%Pop-up Quizzes5%Programming Projects and a term paper30%Four Exams60%Letter GradeCreditA90-100%B80-89%C70-79%D60-69%F0-59%Course PoliciesRead textbook before lecture.
Attendance is mandatory. You are expected to attend all scheduled classes and exams on time and stay for the full class period.
Cell phones and pages must be turned off during class time.
On both written and programming assignments, please clearly indicate your name, your student ID, the name of the assignment and the due date.
Although you can discuss with other students or ask tutors in the Student Success Center, all assignments should be completed individually. Plagiarism will not be allowed.
Programming assignments must compile properly. Programs that do not compile will receive zero credit.
Late assignment will not be accepted. You must turn in assignments by the due time on the due date.
Absolutely no cheating. It can result in an F in this course and suspense or dismissal from ɫ.
There are no makeup quizzes and exams. If you missed an exam, you must provide the written documentation for your absence. If your absence is due to one of the following types, then upon review of the written documentation and instructors approval, your final exam grade will be your grade on the missed exam. Otherwise, your grade on the missed exam will be zero.
Participation in a documented official university function that does not permit the students class attendance (e.g., participation in athletic events, field trips, etc.)
Severe illness (this does not include scheduled medical appointments nor driving someone else to doctor), a hospital stay, or a doctor's excuse saying that it is impossible for student to attend class(es)
Death of immediate family member (grandparent, parent, sibling, or child)
Appearance in court
Personal situations that are approved by the instructor in advance of the time the student is to be absent.Course CoverageOverview
Introduction
Operating System Structure
Process Management
Processes
Threads
CPU Scheduling
Process Synchronization
Deadlocks
Memory Management
Main Memory
Virtual Memory
Storage Management
File System Interface
File System Implementation
Mass Storage Structure
Protection and Security
Protection
SecurityAcademic CalendarTBDHelp Outside ClassroomFree tutoring and advising are provided at the Student Success Center in Langdale Hall. Time schedule of the tutors will be posted at HYPERLINK "http://www.valdosta.edu/ssc" http://www.valdosta.edu/ssc. Request for AccommodationsStudents requesting classroom accommodations or modifications because of a documented disability must contact the Access Office for Students with Disabilities located in Room 1115 Nevins Hall. The phone numbers are 229-245-2498 (voice) and 229-219-1348 (tty). For additional information concerning the services provided by the Access Office, please visit the Access Office for Students with Disabilities web site at HYPERLINK "http://www.valdosta.edu/access/" http://www.valdosta.edu/access/.
! " % & 0 2 7 I J M N O P Q R ] m n o p q ~ ݻݻݻӯÜӐݻӊݻӐݻӊݻӐݻ
h CJ h; h#[ CJ aJ hj h#[ CJ h#[ B*CJ ph h; CJ OJ QJ aJ h; CJ aJ
hCn` CJ h B*CJ ph h; B*CJ ph
h; CJ h; \ h#[ \ h22 \ hCn` \h; 5CJ \2 0 2 J N O P Q P kd $$If l 0 <' 6 4 4
l a $If $
Ha$ Q R ] m n o p W K
$1$If P kd $$If l 0 <' 6 4 4
l a $If P kdY $$If l 0 <' 6 4 4
l a p q ~ N P kdd $$If l 0 <' 6 4 4
l a $If gd $If P kd $$If l 0 <' 6 4 4
l a W P kd $$If l 0 <' 6 4 4
l a $If P kd $$If l 0 <' 6 4 4
l a W P kd $$If l 0 <' 6 4 4
l a $If P kdo $$If l 0 <' 6 4 4
l a 0 1 3 5 W P kdE $$If l 0 <' 6 4 4
l a $If P kd! $$If l 0 <' 6 4 4
l a + / 0 1 2 3 4 5 6 = > ? j k l j k l m ľ網͘uo
hiS CJ hiS B*CJ ph h; CJ OJ QJ aJ j h; CJ Uj h; CJ U
h; CJ h; B*CJ ph h; h; CJ aJ
h CJ h\i h CJ h; 0J CJ "jz h; B*CJ Uph h; B*CJ ph j h; B*CJ Uph )5 6 > W P kd $$If l 0 <' 6 4 4
l a $If P kd $$If l 0 <' 6 4 4
l a W K
$1$If P kd $$If l 0 <' 6 4 4
l a $If P kd= $$If l 0 <' 6 4 4
l a j k l m W P kdH $$If l 0 <' 6 4 4
l a $If P kd $$If l 0 <' 6 4 4
l a m n * W n ~ W
q
U x
& F $If gdR
& F $If gdR
& F $If gdR $If gdiS $If P kd $$If l 0 <' 6 4 4
l a
m n * W n s | }
V
q
! / U > ? A _ پ߾͵ͯ
h; CJ h; B*CJ ph h; h22 h, CJ
ho CJ h h CJ h22 h? CJ
hU CJ
h CJ
h x} CJ
hv CJ
h? CJ hiS hiS CJ hiS B*CJ ph hiS CJ aJ 6U , A b n
"0 p $If $If P kd $$If l 0 <' 6 4 4
l a
& F $If gdR
& F $If gdR
& F $If gdR
C D F H B P kd $$If l 0 <' 6 4 4
l a
` $If ^ `gdn $If P kdS $$If l 0 <' 6 4 4
l a ( 0 A C D E F G H I V W c d f g h z { | }
h_ CJ h#[ h CJ aJ h B*CJ ph h#[ CJ aJ
h CJ
h#[ CJ h#[ B*CJ ph h! B*CJ ph
h; >*CJ h; hn hn CJ
hn CJ h; 6CJ ]
h; CJ h; B*CJ ph h; CJ aJ 2H I W c f g h ; c kd^ $$If l F <' 6 W 6 4 4
l a $If gd! $If P kd $$If l 0 <' 6 4 4
l a h w z { | $If gd_ $If c kd $$If l F <' 6 W 6 4 4
l a $If gd! $If gd! $If c kd<
$$If l F <' 6 W 6 4 4
l a $If gd! $If c kd
$$If l F <' 6 W 6 4 4
l a $If gd! $If c kd $$If l F <' 6 W 6 4 4
l a $If gd! $If c kd $$If l F <' 6 W 6 4 4
l a $If gd! $If c kd $$If l F <' 6 W 6 4 4
l a
> 6 8 - < h i j k l m n ʺ h B*CJ ph h#[ CJ OJ QJ aJ h#[ OJ QJ aJ hJ 5CJ \
hJ CJ h$m hJ CJ
hJ CJ \h$m hJ CJ \
hsq CJ h#[ 5CJ \ h#[ h#[ CJ aJ
h#[ CJ h#[ B*CJ ph 5 $If gd! $If c kdg $$If l F <' 6 W 6 4 4
l a $If gd! $If c kd $$If l F <' 6 W 6 4 4
l a
$If gd! $If c kdE
$$If l F <' 6 W 6 4 4
l a
> 8 ~ ~ ~ ~ ~ d ~
& F
"0 hp $If gdJ
& F
"0 hp $If $If c kd
$$If l F <' 6 W 6 4 4
l a f M b \ $If P kd# $$If l 0 <' 6 4 4
l a
& F
`"0 h%p %C$If ^%`C
& F
"0 hp $If
& F
"0 p $If - 6 C ^ q { o o V V
& F
"0 %Ap $If
& F
"0 Ap $If
& F
"0 %p $If $If P kd| $$If l 0 <' 6 4 4
l a $$If a$
% < T _ h
& F
"0 %Ap $If gdsq
& F
"0 %p $If gdsq
& F
"0 %p $If
& F
"0 %Ap $If
h i k m n ? P kd. $$If l 0 <' 6 4 4
l a
!"0 hp $1$G$If $If P kd $$If l 0 <' 6 4 4
l a % & O P Q l m r s t u v 3 4 a b c ⠰ڈxt h; j hJE hj# CJ Uh_B hj# B*CJ ph hJE hj# 0J CJ j9 hJE hj# CJ Uj hj# CJ Uh_B hj# CJ h9u hj# B*CJ ph hj# B*CJ ph hj# CJ aJ
hj# CJ hj# h CJ aJ
h CJ
h22 CJ " @ 7 $If gd P kd $$If l 0 <' 6 4 4
l a
$If $If P kd $$If l 0 <' 6 4 4
l a
$If gd r s t u v @ 7 $If gd! P kdw $$If l 0 <' 6 4 4
l a
$If $If P kd $$If l 0 <' 6 4 4
l a
$If gd!
"0 p P kd $$If l 0 <' 6 4 4
l a
$If gd! 2 1h:pR / =!"#$% W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 D y K c l i u @ v a l d o s t a . e d u y K 2 m a i l t o : c l i u @ v a l d o s t a . e d u W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 D y K h t t p : / / w w w . v a l d o s t a . e d u / ~ c l i u y K < h t t p : / / w w w . v a l d o s t a . e d u / ~ c l i u W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 m $$If !v h5 565W#v #v6#vW:V l 6 5 565Wm $$If !v h5 565W#v #v6#vW:V l 6 5 565Wm $$If !v h5 565W#v #v6#vW:V l 6 5 565Wm $$If !v h5 565W#v #v6#vW:V l 6 5 565Wm $$If !v h5 565W#v #v6#vW:V l 6 5 565Wm $$If !v h5 565W#v #v6#vW:V l 6 5 565Wm $$If !v h5 565W#v #v6#vW:V l 6 5 565Wm $$If !v h5 565W#v #v6#vW:V l 6 5 565Wm $$If !v h5 565W#v #v6#vW:V l 6 5 565Wm $$If !v h5 565W#v #v6#vW:V l 6 5 565Wm $$If !v h5 565W#v #v6#vW:V l 6 5 565WW $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 D y K h t t p : / / w w w . v a l d o s t a . e d u / s s c y K 8 h t t p : / / w w w . v a l d o s t a . e d u / s s c W $$If !v h5 5 #v #v :V l 6 5 5 W $$If !v h5 5 #v #v :V l 6 5 5 D y K h t t p : / / w w w . v a l d o s t a . e d u / a c c e s s / y K @ h t t p : / / w w w . v a l d o s t a . e d u / a c c e s s / W $$If !v h5 5 #v #v :V l 6 5 5 ^ 2 0 @ P ` p 2 ( 0 @ P ` p 0 @ P ` p 0 @ P ` p 0 @ P ` p 0 @ P ` p 0 @ P ` p 8 X V ~ _HmH nHsH tH @ ` @ N o r m a l CJ _HaJ mH sH tH J @ J H e a d i n g 1 $$
H@& a$ 5CJ N N H e a d i n g 2 $$@&a$ 6B*CJ ]ph D A` D D e f a u l t P a r a g r a p h F o n t V i@ V T a b l e N o r m a l :V 4 4
l a ( k ( N o L i s t 4 U@ 4 H y p e r l i n k >*ph F @ F H e a d e r
!1$ G$ OJ QJ aJ d R d B o d y T e x t I n d e n t 2 !
"0p ` CJ F V !F F o l l o w e d H y p e r l i n k >*B* ph PK ! [Content_Types].xmlj0Eжr(Iw},-j4 wP-t#bΙ{UTU^hd}㨫)*1P' ^W0)T9<l#$yi} ;~@(Hu* Dנz/0ǰ $ X3aZ,D0j~3߶b~i>3\`?/[G\!-Rk.sԻ..a濭? PK ! ֧ 6 _rels/.relsj0 }Q%v/C/} (h"O
= C?hv=Ʌ%[xp{۵_Pѣ<1H0ORBdJE4b$q_ 6LR7`0̞O,En7Lib/Se е PK ! ky theme/theme/themeManager.xml M
@}w7c(Ebˮ CAǠҟ7՛K
Y,
e.|,H ,lxɴIsQ}#Ր ֵ+!,^$j=GW)E+&
8 PK ! P theme/theme/theme1.xmlYOo6w toc'vuر-Mn iP@I}úama[إ4:l ЯGRX^6؊>$ !)O^rC$y@ /yH*)UDb`}"qۋJחX^)I`nEp)liV[]1M<OP6r=zgbIguSe bORD۫qu gZo~ٺlAplxpT0+[}`j zA V2Fi@qv֬5\|ʜ̭NleXd sjcs7f
W+Ն7` g ȘJj|h(KD-
dXiJ؇(x$( :;˹! I_TS 1?E ??ZBΪmU/ ?~xY'y5g&/ɋ>GMGeD3Vq%'#q$8K )fw 9:ĵ
x}rxwr:\TZaG*y8IjbRc|XŻǿI
u3KGnD 1NIBs
RuK>V.E L+M2#'fi ~V vl{u8z H
* :( W ☕
~JTe\O*tHGHY }KNP*ݾ˦ TѼ9/#A7qZ $*c?qUnwN%Oi4 =3ڗP
1Pm \\9Mؓ2aD];Yt\[x]}Wr|]g-
eW
)6-rC Sj
id DЇAΜIqbJ#x꺃 6k#ASh&ʌt(Q% p%m&]caS l=X\P1Mh9MVdDAaVB[݈fJíP|8 քAV^f
Hn- "d>znNJ ة>b&2vKyϼD:,AGm\nziÙ .uχYC6OMf3or$5N HT[XF64T,ќM0E)`#5XY`פ ;%1U٥m;R>QD DcpU'&LE/pm%]8firS4d 7y\`JnίI R 3U~7+#m qBiDi*L69mY&iHE=(K&N!V.KeLDĕ{D vEꦚdeNƟe(MN9ߜR6&3(a/DUz<{ˊYȳV)9Z[4^n5!J?Q3eBoCM m<.vp IYfZY_p[=al-Y}Nc͙ŋ4vfavl'SA8|*u{-ߟ0%M07% < ҍ PK !
ѐ ' theme/theme/_rels/themeManager.xml.relsM
0wooӺ&݈Э5
6?$Q
,.aic21h:qm@RN;d`o7gK(M&$R(.1r'JЊT8V"AȻHu}|$b{ P8g/ ]QAsم(#L[ PK- ! [Content_Types].xmlPK- ! ֧ 6 + _rels/.relsPK- ! ky theme/theme/themeManager.xmlPK- ! P theme/theme/theme1.xmlPK- !
ѐ ' theme/theme/_rels/themeManager.xml.relsPK ]
f m & / Q p 5 m U H h
h ! " # $ % ' ( ) * + , - . 0 1 2 > k % P l 3 b XXXX 8 @ 0 (
B
S ? 25 35 45 55 4 65 t 75 85 95 4
= *urn:schemas-microsoft-com:office:smarttags PlaceType = *urn:schemas-microsoft-com:office:smarttags PlaceName 9 *urn:schemas-microsoft-com:office:smarttagsplace ^ I K 6 > n W ~ W p W c | > ; < v > ' ( 0 A .[} h 6 }Y
l -+T `ƛ Ma)$+T * )ʂB }E-- q\-} h < < =b9P L}Cb} LE QʂB @{V E"]vu 'PaڦF lbPLt #IcʂB S q\- HS E"] Q .[ * ) v=#Ic $x - h < E5j ` Ma)$ v='Pa lb h gbn L}C P P P P T # O0 50 P & |N |N & NZ |N|N & |N {<@ ! _ v j# 7) , 4[1 22 ; _F O0K #[ t\ Cn` Xwj sq x} o { iS R R J e n $@ ? U ! @ p @ U n k n o w n G * T i m e s N e w R o m a n 5 S y m b o l 3. * A r i a l 71 C o u r i e r ?= * C o u r i e r N e w ; W i n g d i n g s A B C a m b r i a M a t h " q h 3Ff:fE y
% y
% ! r4 d
2q HP ? Xwj 2 ! x x S y l l a b u s C h u n l e i L i u c l i u l
Oh +'0
< H T
` l t | Syllabus Chunlei Liu Normal.dotm cliu 69 Microsoft Office Word @ `1i @ l1@ 1@ o y ՜. +,D ՜. +,L h p
ɫ %
Syllabus Title 8 @ _PID_HLINKS A & : h t t p : / / w w w . v a l d o s t a . e d u / a c c e s s / $ < h t t p : / / w w w . v a l d o s t a . e d u / s s c E E h t t p : / / w w w . v a l d o s t a . e d u / ~ c l i u / m a i l t o : c l i u @ v a l d o s t a . e d u
! " # $ % & ' ( ) * + , - . / 0 1 2 3 5 6 7 8 9 : ; < = ? @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j l m n o p q r t u v w x y z } R o o t E n t r y F 9`p D a t a
4 1 T a b l e > X W o r d D o c u m e n t 4f S u m m a r y I n f o r m a t i o n ( k D o c u m e n t S u m m a r y I n f o r m a t i o n 8 s C o m p O b j y
F' Microsoft Office Word 97-2003 Document
MSWordDoc Word.Document.8 9q