45 Pages

Lecture03

Course: CS 372, Fall 2008
School: Oregon State
Rating:
 
 
 
 
 

Word Count: 2263

Document Preview

April Tuesday, 8 Lab #1 Grading is in progress Homework #1 Hardcopy due Thursday, January 17 (beginning of class) Helpful link for P7: http://hyperphysics.phy-astr.gsu.edu/Hbase/math/disfcn.html#c2 Lab #2 First session starts today at 2:00 Quiz #1 Thursday in class Apply to MECOP Deadline is April 10 Anybody interested in an REU in AI? See me after class or send me an email Change in Paulson's...

Register Now

Unformatted Document Excerpt

Coursehero >> Oregon >> Oregon State >> CS 372

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
April Tuesday, 8 Lab #1 Grading is in progress Homework #1 Hardcopy due Thursday, January 17 (beginning of class) Helpful link for P7: http://hyperphysics.phy-astr.gsu.edu/Hbase/math/disfcn.html#c2 Lab #2 First session starts today at 2:00 Quiz #1 Thursday in class Apply to MECOP Deadline is April 10 Anybody interested in an REU in AI? See me after class or send me an email Change in Paulson's office hours M: 12:00 2:00 pm W: 10:00 - 11:50 am, 1:00 - 2:50 pm R: 2:00 - 3:50 pm F: 10:00 - 11:50 am other times by appointment Might change (again) Today's topics Physical media Structure of the Internet Network layering models Networks attacks Security Homework/problems Physical Media Why is it needed? to propagate bits between sender/receiver pairs What is it? a physical link that lies between sender & receiver Two types of media: guided media: signals propagate in solid media unguided media: signals propagate freely, e.g., wireless radio Guided Media: twisted-pair copper wire two insulated copper wires Category 3: 10 Mbps Ethernet Category 5: 100Mbps Ethernet still used for high-speed LAN; e.g., ADSL rate depends on thickness and distance make up 99% of wired connections may pick up interference ("noise") RJ-45 twisted pair connector: both ends same; used with hubs, switches crossover: one end each; direct connection Pins 1, 2: transmit Pins 3, 6: receive Pins 4, 5, 7, 8: not used for network data Guided Media: coaxial cable two concentric copper conductors baseband: single channel on cable legacy Ethernet broadband: multiple channels on cable hybrid fiber-coax cable (HFC) Cable TV rate depends on thickness and distance less interference than twisted pair Baseband and broadband Baseband uses a small part of wave spectrum and sends only one signal at a time Broadband uses a larger part of the wave spectrum and uses frequency division multiplexing to send multiple signals at the same time Frequency division multiplexing (FDM) Achieves multiplexing by using different carrier frequencies Frequencies must be separated to avoid interference Receiver can "tune" to specific frequency and extract modulation for that one channel Useful only in media that can carry multiple signals with different frequencies high-bandwidth required Guided Media: fiber optic cable glass fiber carrying light pulses, each pulse represents one bit high-speed operation: high-speed point-to-point transmission (e.g., 10's100's Gbps) low error rate: immune to electromagnetic noise and other interference Wave length division Frequency division multiplexing can be applied to optical transmission known as wave-length division multiplexing (WDM) When many wavelengths are used, the term becomes Dense Wave Division Multiplexing (DWDM) Informally, color division multiplexing Receiver separates frequencies using a prism red, orange, etc Unguided media: wireless radio signal carried in electromagnetic spectrum in the air no physical "wire" effects of propagation environment : reflection obstruction by objects interference Radio link types terrestrial microwave e.g. up to 45 Mbps channels LAN (e.g., Wifi) 11Mbps, 54 Mbps wide-area (e.g., cellular) e.g. 3G: hundreds of Kbps satellite Kbps to 45Mbps channel (or multiple smaller channels) 270 msec end-end delay geostationary vs. low altitude The internet Many (possibly incompatible) network technologies No single technology is appropriate for every situation Internetworking uses routers to enable communication among networks of dissimilar technologies Result is virtual network* whose details are invisible *Acts like a network What's the Internet: "physical" view millions of connected computing devices: called hosts or end systems e.g., Laptops, workstations running network apps route r se r rve local I S P workstation m obile communication links e.g., fiber, copper, radio, satellite re gional I S P routers & switches: forward packets (chunks of data) com pany ne twork What's the Internet: "logical" view network protocols control sending/receiving of msgs e.g., TCP, IP, HTTP, FTP, PPP route r se r rve local I S P workstation m obile Internet: "network of networks" loosely hierarchical public Internet versus private intranet re gional I S P Internet standards IETF: Internet Engineering Task Force for protocols/standards RFC: Request for comments IEEE: for links, e.g., Ethernet com pany ne twork What's the Internet: a "service" view communication infrastructure enables distributed applications: Web, email, games, ecommerce, file sharing communication services provided to applications: Connectionless (unreliable) connection-oriented (reliable) Internet structure: network of networks "Hierarchy": tier 1, tier 2, and tier 3 at center: "tier-1" ISPs e.g., MCI, Sprint, AT&T, Cable and Wireless, national/international coverage Tie provide also r-1 rs inte rconne at public ct ne twork acce points ss (NAPs) Tie provide r-1 rs inte rconne ct (pe r) private e ly Tie 1 I S r P NAP Tie 1 I S r P Tie 1 I S r P Internet structure: network of networks "Tier-2" ISPs: smaller (often regional) ISPs Connect to one or more tier-1 ISPs, possibly other tier2 ISPs Tie I S also r-2 Ps pe r private with e ly e othe ach r, inte rconne at ct NAP Tie I S r-2 P Tie I S is custom r r-2 P e of tie provide r-1 r Tie I S r-2 P Tie 1 I S r P NAP Tie 1 I S r P Tie I S r-2 P Tie 1 I S r P Tie I S r-2 P Tie IS r-2 P Internet structure: network of networks "Tier-3" ISPs and local ISPs "access" networks (closest to end systems) local IS P Local and tie 3 rI S arecustom rs Ps e of highe tie IS r r Ps conne cting the to m re of I nte t st rne Tie 3 r IS P Tie I S r-2 P local IS P local IS P Tie I S r-2 P local IS P Tie 1 I S r P NAP Tie 1 I S r P local IS P Tie I S r-2 P local IS P Tie 1 I S r P Tie I S r-2 P local IS P Tie IS r-2 P local IS P Internet structure: network of networks a packet passes through many networks local IS P Tie 3 r IS P Tie I S r-2 P local IS P local IS P Tie I S r-2 P local IS P Tie 1 I S r P NAP Tie 1 I S r P local IS P Tie I S r-2 P local IS P Tie 1 I S r P Tie I S r-2 P local IS P Tie IS r-2 P local IS P Protocol "Layers" Networks are complex! many "pieces": hosts routers links of various media applications protocols hardware, software Question: Is there any hope of organizing structure of network? Or at least organizing our discussion of networks? Layering of airline functionality ticket (purchase) baggage (check) gates (load) runway (takeoff) airplane routing departure airport ticket (complain) baggage (claim gates (unload) runway (land) airplane routing airplane routing airplane routing arrival airport ticket baggage gate takeoff/landing airplane routing intermediate air-traffic control centers Layers: each layer implements a service via its own internal-layer actions relying on services provided by layer below Internet protocol stack application: supporting network applications FTP, SMTP, HTTP application transport ne twork link physical transport: process-process data transfer UDP TCP, network: routing of datagrams from source to destination IP, routing protocols link: data transfer between neighboring network elements PPP, Ethernet physical: bits "on the wire" ISO/OSI reference model presentation: allow applications to interpret meaning of data, e.g., encryption, compression, machinespecific conventions session: synchronization, checkpointing, recovery of data exchange Internet stack "missing" these layers! these services, if needed, must be implemented in application application pre ntation se se ssion transport ne twork link physical Why layering? Dealing with complex systems: explicit structure allows identification, relationship of complex system's pieces layered reference model for discussion modularization eases maintenance, updating of system change of implementation of layer's service transparent to rest of system e.g., change in gate procedure doesn't affect rest of system Layered software: stacks Software implemented from layered design has layered organization Software modules can be viewed as "stacks" (not the stack data structure) on both computers Stacks Constraints 1. The software for each layer depends only on the services of the software provided by neighboring layers (well-defined interfaces) 2. The software at layer n at the destination receives exactly the same protocol message sent by layer n at the sender (consistency) These constraints mean that protocols within a protocol stack can be tested independently modified/replaced independently source message se e gm nt Ht datagram Hn Ht fram Hl Hn Ht e M M M M application transport ne twork link physical Encapsulation link physical switch de stination M Ht Hn Ht Hl Hn Ht M M M Hn Ht Hl Hn Ht M M application transport ne twork link physical ne twork link physical Hn Ht M router Problems More about packet loss and delay Calculations How do loss and delay occur? packe be transm d (de t ing itte lay) A B packe que ing (de ts ue lay) packe ge droppe (loss) ts t d if no fre buffe e rs Packet loss queue (buffer) preceding link in buffer has finite capacity packet arriving at a full queue is dropped (lost) lost packet may be retransmitted by previous node, by source, or not at all A B buffe r (waiting are a) packe be transm d t ing itte packe arriving to t full buffe is lost r Nodal delay d nodal = d proc + d queue + d trans + d prop dproc = processing delay typically a few s or less dqueue = queuing delay depends on congestion dtrans = transmission delay = L/R, significant for low-speed links dprop = propagation delay a few s to hundreds of ms Queueing delay (revisited) Packet arrival rate = a packets/sec Packet length = L bits queue Link bandwidth = R bits/sec Every second: aL bits arrive to queue Every second: R bits leave the router Question: what happens if aL > R ? Answer: queue will fill up, and packets will get dropped!! aL/R is called traffic intensity Queueing delay (revisited) Packet arrival rate = a packets/sec Packet length = L bits queue Link bandwidth = R bits/sec aL/R ~ 0: average queueing delay is small aL/R 1: delays become large aL/R > 1: more "work" than can be serviced, average delay infinite! Homework Problem #6 (P13) N packets arrive simultaneously Packet length = L bits Link bandwidth = R bits/sec Question: what is the average queuing delay for the N packets? Answer: 1st packet delay =0; 2nd packet delay=L/R; 3rd packet delay = 2L/R; etc So, average delay = (L/R + 2L/R + ... + (N-1)L/R)/N = L(N-1)/(2R) sec. "Real" Internet delays and routes What do "real" Internet delay & loss look like? Traceroute program: provides delay measurement from source to router along end-end Internet path towards destination. For all i: sends three packets that will reach router i on path towards destination router i will return packets to sender sender determines interval between transmission and reply. 3 probe s 3 probe s 3 probe s "Real" Internet delays and routes trace route gaia.cs.um du to www.e com : ass.e ure .fr Thre de m asure e from e lay e m nts gaia.cs.um du to cs-gw.cs.um du ass.e ass.e 1 cs-gw (128.119.240.254) 1 ms 1 ms 2 ms 2 border1-rt-fa5-1-0.gw.umass.edu (128.119.3.145) 1 ms 1 ms 2 ms 3 cht-vbns.gw.umass.edu (128.119.3.130) 6 ms 5 ms 5 ms 4 jn1-at1-0-0-19.wor.vbns.net (204.147.132.129) 16 ms 11 ms 13 ms 5 jn1-so7-0-0-0.wae.vbns.net (204.147.136.136) 21 ms 18 ms 18 ms 6 abilene-vbns.abilene.ucaid.edu (198.32.11.9) 22 ms 18 ms 22 ms 7 nycm-wash.abilene.ucaid.edu (198.32.8.46) 22 ms 22 ms 22 ms trans-oce anic 8 62.40.103.253 (62.40.103.253) 104 ms 109 ms 106 ms link 9 de2-1.de1.de.geant.net (62.40.96.129) 109 ms 102 ms 104 ms 10 de.fr1.fr.geant.net (62.40.96.50) 113 ms 121 ms 114 ms 11 renater-gw.fr1.fr.geant.net (62.40.103.54) 112 ms 114 ms 112 ms 12 nio-n2.cssi.renater.fr (193.51.206.13) 111 ms 114 ms 116 ms 13 nice.cssi.renater.fr (195.220.98.102) 123 ms 125 ms 124 ms 14 r3t2-nice.cssi.renater.fr (195.220.98.110) 126 ms 126 ms 124 ms 15 eurecom-valbonne.r3t2.ft.net (193.48.50.54) 135 ms 128 ms 133 ms 16 194.214.211.25 (194.214.211.25) 126 ms 128 ms 126 ms 17 * * * * m ans no re e sponse(probelost, route not re r plying) 18 * * * 19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms Chapter 1: Summary Covered a "ton" of material! Internet overview what's a protocol? network edge, core, access network packet-switching versus circuit-switching Internet structure performance: loss, delay, throughput layering, service models security history You now have: context, overview, "feel" of networking more depth, detail to follow! Chapter 1: review problems Problem 1 L=100Byte s trans. rateR = ? Host B 8 Host A Question: At what rate (bandwidth) R would the propagation delay equal the transmission delay? distance= 2 km spe d = 2x10 m , e /s Answer: Propagation delay = 2x103 (m)/2x108 (m/s) = 10-5 sec Transmission delay = 100x8 (bits)/R Prop. Delay = trans. Delay => R=105x100x8 = 80 Mbps Chapter 1: review problems Problem 2: Voice over IP L=48 Byte s a=64Kbps trans. rateR = 1Mbps Host B de prop = 2m c lay se Host A Host A converts analog to digital at a=64Kbps groups bits into L=48Byte packets sends packet to Host B as soon it gathers a packet Host B As soon as it receives the whole packet, it converts it to analog Question: How much time elapses from when the 1st bit is created until that bit is decoded? Chapter 1: review problems Problem 2: Voice over IP L=48 Byte s a=64Kbps trans. rateR = 1Mbps Host B de lay_prop = 2m c se Host A Answer: Time to process 1st pkt: 48x8 (bits)/64x1000 (b/s) = 6 msec Time to push 1st pkt to link: 48x8 (bits)/1x106 (b/s) = 0.384 msec Time to propagate: 2 msec Total delay = 6 + 0.384 + 2 = 8.384 msec Quiz #1 Thursday, April 10, in class Covers Chapter 1 (except 1.6 "Networks Under Attack") Lectures 1 3 Homework #1 Labs #1 15 questions, 30 minutes Short-answer, calculation, multiple-choice There are no "trick questions" Calculator and one 4x6 notecard (both sides) permitted No sharing Questions? Read K&R Chapter 2, Sections 1 6 Sign up for Lab #2 Homework #1 due Thursday (boc) Quiz #1 Thursday in class
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Oregon State - CS - 372
Tuesday, April 15 Lab #2 Sessions run through Wednesday TA Office hours Thursday and Friday Due Friday by midnight Program #1 Definition is posted Due by midnight Friday, May 2Accepted until midnight Sunday, May 4, with a 10% penaltyToday'
Oregon State - CS - 372
Thursday, April 17 Quiz #1 Scores are posted Pick up Questions? Lab #2 Due Friday before midnight Midterm #1 Tuesday, April 22, in class Program #1 Due Friday, May 2 accepted through Sunday, May 4, with 10% late penaltyToday's topics
Oregon State - CS - 372
Thursday, April 24 Midte #1 rm S core will beposte soon s d Lab #3 Re port is dueFriday, May 2 S elab sche e dule/ signup Hom work #2 e Poste d Hardcopy dueThursday, May 1 (BOC) Program#1 De finition is poste d Only onepartne rship? DueFr
Oregon State - CS - 372
Tuesday, April 29It's not just a right, it's a responsibility Last chance to register to vote in the Oregon Primary Election: 5:00 pm today! Must register party affiliation to vote for presidential candidate Download form Deliver (before
Oregon State - CS - 372
Thursday, May 1 Lab#2 Scores are posted Pick up Homework #2 Due now Questions?Hope you made a copy for yourself Lab #3 Report is due tomorrow before midnight TAs have office hours today/tomorrow Program #1 Due Friday, May 9 Evaluation
Oregon State - CS - 372
Tue sday, May 6 Hom work #3 is poste e d Lab #4 is poste dS up ign Program#1DueFriday, May 9 Evaluation crite areposte ria dNote on im m ntation s ple et t P/IP protocols do the jobs! ir Le thesocke API and TC1Today's topics I nt
Oregon State - CS - 372
Thursday, May 8 Quiz #2 Homework #3Scores are posted Pick up Partial discussion in class on Tuesday Solutions will be posted Due date is changed to Thursday (5/15) Lab #4Sign up1Thursday, May 8 Program #1Due before midnight tom
Oregon State - CS - 372
Tuesday, May 13 Lab #3 Scores are posted Pick up Homework #3 (problems 1 6 only) Solutions are posted Due date is Thursday (5/15) before exam Lab #4 Due Friday Program #1 Grading is in progress Program #2 Will be posted soon Midterm #2
Oregon State - CS - 372
Tue sday, May 20 Midte #2 rm S core areposte s d C eto m officeif you want to go ove thee om y r xam Program#1 Grading is in progre ss Lab #5 is poste d DueFriday, May 30 Lab sche duleis change d! Hom work #4 is poste e d Re -assigne proble
Oregon State - CS - 372
Thursday, May 22 Homework #4 is due Lab #5 is postedQuestions? Solutions will be posted today Due Friday, May 30 Lab schedule is changed! Due Thursday, June 5 (2 weeks from today!) Partnership registration due Tuesday (5/27) Program #2 i
Oregon State - CS - 372
Tue sday, May 27 C ck your scoreposting, pick up* he Re nt score ce s:e Hom work #4 *Program#1 *Lab #4 Hom work #5 is poste e d Hardcopy dueThursday (BOC ) S olutions will beposte We sday e ning d dne ve Lab #5 re port is dueFriday Last s
Oregon State - CS - 372
Thursday, May 29 Homework #5 is due Lab #5 report is due Friday before midnightQuestions? Program #2 is due Thursday, June 5TAs have office hours in the lab today & Friday Questions? No office hours todayExtra hours tomorrow1Tod
Oregon State - CS - 372
Tue sday, June3 Quiz #3, Hom work #5 eS s areposte core dst d Lowe quiz is droppePick up Quiz #3 Que stions? Program#2 is dueThursday, June5Que stions? I f you areworking with a partne besureto che thee r, ck xtra re quire e m nts1
Oregon State - CS - 372
Thursday, June 5Lab #5Grading is in progressCheck your scores1Program #2Due tonight before midnight Questions? Let's make a deal . The submit site will remain open until midnight Saturday, June 7. 50 points will be "redistributed
Oregon State - CS - 372
CS/ECE 372 Introduction to Computer Networks Homework Assignment #1 10 points Hardcopy due Thursday, 10 April 2008, beginning of class Chapter 1, pp. 70 - 75 1. p.70 #P3 2. p.70-71 #P5 3. p.71 #P7 a,b,c 4. p.71-72 #P9 5. p.72 #P11 6. p.72 #P13 7. p.7
Oregon State - CS - 372
CS372 Introduction to Computer Networks Spring 2008 Homework Assignment #2 10 points Hardcopy due Thursday, 1 May 2008, beginning of class Make a copy for yourself for class discussion. Chapter 2, pp. 180 - 184 1. P3 2. P15 (a e only) Chapter 3, pp.
Oregon State - CS - 411
Operating Systems II Spring 2009 MWF 9:009:50 am KEC 1003paulson@eecs.oregonstate.edu http:/web.engr.oregonstate.edu/~paulsonCS 411Instructor: Paulson Office: KEC 2061Stay tuned . office hours might changeMWF 10:00 am 12:00 noon ot
Oregon State - CS - 411
Wednesday, April 1TeamsPosted on course wiki "Projects", "Teams"Project #1 Posted on course wiki "Projects", "Project 1" Due Sunday, April 5, before midnightToday's topicsProject #1Intro to OStoolsCourse Mailing List cs4
Oregon State - CS - 411
Friday, April 3Project #1 Due before midnight Sunday. Good discussions on the mailing list Contribute to the student wiki Evaluation criteria list is posted Questions/comments?See the archives Good questions are as valuable as goo
Oregon State - CS - 411
Monday, April 6Project #1Credit Distribution Agreement (hardcopy) Individual review documentsdue by endofclass todayBarCamp Credit due today before 5:00 pm Submit at http:/engr.oregonstate.edu/teach before midnight tonightHard
Oregon State - CS - 411
Wednesday, April 8Project #1Project #2 is postedGrading is in progress Due Sunday, April 19Homework #1 is postedDiscussion in class FridayToday's topicsMore CPU scheduling FCFS (FirstCome, FirstServed) SJF (Shortest Job F
Oregon State - CS - 411
Friday, April 10Project #1 Project #2 Grading is nearly complete Scores will be posted soon Progress reports? Questions? Monday seminar in classBe prepared (questions for Ian)Today's topics Homework #1 More CPU scheduling Hybr
Oregon State - CS - 411
Monday, April 13Project #2 Homework #1Progress reports? Ian's Seminar Wednesday in class Solutions are posted Friday in classQuiz #1Today's topic Multiprocessor scheduling Process Control Blocks Linux ConstantTime SchedulerExp
Oregon State - CS - 411
Wednesday, April 15Have you finished your taxes?Project #2The IRS expects to hear from you today Due date changed to Sunday, April 26Quiz #1Friday in classToday's topic Ian's Project #2 Seminar Review for Quiz #2Quiz #1 Frida
Oregon State - CS - 411
Friday, April 17Note some changes in the course calendar Project #2 Questions? Due Sunday, April 26Today's topics RSDL Scheduler Linux CFS scheduler Quiz #1Linux CPU Schedulers "Constant Time Scheduler" (CTS) "Rotating Stairway
Oregon State - CS - 411
Monday, April 20Quiz #1Comments on Program #1 reviews: Still not finished .I actually read these Confidential, not returned Often used for recommendation letters Use professional language, spellcheck Be specific:Describe how your t
Oregon State - CS - 411
Wednesday, April 22Quiz #1 Project #2Scores are posted Pick up Updates?Homework #2 is postedDiscussion in class FridayTake the COE Computing Services Survey:http:/engr.oregonstate.edu/computing/itsurvey.phpToday's Topics
Oregon State - CS - 411
Friday, April 24Project #2Project #3 is postedDue Sunday before midnight Get started as soon as you finish Project #2 Solutions are postedHomework #2Homework #3 is posted Do Problem #1 Discussion in class MondayTake the COE
Oregon State - CS - 411
Project #2 Monday, April 27Project #3 Credit Distribution Agreement is due (end of class today) Project Review is due (before midnight tonight) Rob's seminar Friday Plan of attack due SundayDo Homework #3, problems 2 5Discussion
Oregon State - CS - 411
Wednesday, April 29Project #3 Get moving Be prepared for Rob's seminar in class FridayMore changes in the calendarToday's topicsLinux Kernel Coding StyleBeing anal for a good reason.The Linux Kernel Coding StyleGreg KroahHartman
Oregon State - CS - 411
Monday, May 4Project #3 We will contact you if your Plan of Attack has run off the road Be sure to follow kernel coding guidelines Comments on Rob's seminar? Other?Midterm Exam in class WednesdayToday's topics Wrap up virtual memor
Oregon State - CS - 411
Midterm Exam Friday, May 8Project #2 Scores are posted Median = 86% Scores are posted Project Reviews:Project #3 evaluation criteria are posted Most are really very good Some show additional insight Some tell me practically not
Oregon State - CS - 411
Monday, May 11Project #3 Project #4 Grading is in progress Credit Distribution Agreements are due Project Reviews are due before midnight tonight Plan of Attack due by midnight Wednesday, May 20 Rob's SeminarHomework #4 is postedF
Oregon State - CS - 411
Wednesday, May 13No lecture on Friday, May 15Project #4 Engineering ExpoPlan of Attack due by midnight Wednesday, May 20 Rob's SeminarFriday, May 22, in classToday's topics More I/O Scheduling File SystemsLinus Elevator Mod
Oregon State - CS - 411
Note changes in the CalendarMonday, May 18Project #3 Guest Speaker: Greg KroahHartman Scores are posted delayed Comments?Project #4 Friday in class Very important . do not missPlan of Attack due by midnight Friday, May 22 Rob's
Oregon State - CS - 411
Wednesday, May 20 Check your scores Check calendar Guest Speaker: Greg KroahHartman Friday in class Very important . do not miss!Calendar UpdatesFriday, May 22:Monday, May 25:Project #4 Plan of Attack is due before midnight Memori
Oregon State - CS - 411
Friday, May 29Project #4 Due Wednesday, June 3 before midnight Evaluation criteria are posted Questions / Comments?Do the Projects Survey Contribution credit Responses will be posted on the course wikiToday's topics Linux Virtual F
Oregon State - CS - 411
Quiz #2 is due now Project #4 Monday, June 1Do the Projects Survey Due Wednesday, June 3 before midnight Evaluation criteria are posted Questions / Comments? Contribution credit Responses (only 3 so far) are posted on the course wiki
Oregon State - CS - 411
Quiz #2 is gradedWednesday, June 3Project #4 Check scoresHomework #5 is posted Due tonight before midnight Evaluation criteria are posted Credit Distribution Agreement (hardcopy) is due by end of class Friday Review document is
Oregon State - CS - 411
Project #4 Friday, June 5Homework #5 Credit Distribution Agreement (hardcopy) is due by end of class Review document is due by midnight Solutions are postedDo the Projects Survey Paulson: Responses are posted on the wiki Contribu
Oregon State - CS - 411
CS411 Spring 2009 Project #1 Due 5 April 2009 Possible 3 5 6 6 6Team:Graded byPointsCommentsgzipped file correctly submitted Repository set up proj01 I/O scheduler Source code file shows changes Add a header block containing your team namea
Oregon State - CS - 411
CS411 Operating Systems IIProject #1Due on Sunday, April 5, before midnightSpring 2009Introduction: The projects for this course will involve modifications and additions to the linux kernel. For most students, this is unfamiliar and intimidatin
Oregon State - CS - 411
Spring 2009 CS411 Project #2 Due 11:59 pm, Sunday, April 26 PossibleTeam:Graded byPointsCommentsPreliminaries (9 pts) gzipped file submission, with all required files Submitted schedule.c Submitted schedule.h Submitted Makefile Compiles Doc
Oregon State - CS - 411
CS411 Operating Systems IIProject #2Spring 2009Due on Sunday, April 19 April 26, before midnightObjectives: 1. understand the basics of the Linux Scheduler 2. understand how a scheduler operates 3. be able to user the Linux kernel's Linked Lis
Oregon State - CS - 411
CS411 Project #3 Due before midnight Sunday, May 10Team:Graded byPoints PossiblePoints EarnedCommentsPreliminaries (20 pts) Plan of Attack (due Sunday, May 3) gzipped file submission Submitted slob.c, patch file, vmlinuz.proj3.teamXX, cha
Oregon State - CS - 411
CS411 Operating Systems IIProject #3Due before midnight Sunday, May 10Spring 2009(Plan of Attack due on Sunday, May 3)Introduction: The memory management layer is the part of the kernel that services all memory allocation requests. To handle
Oregon State - CS - 411
CS411 Operating Systems IISpring2009 NAME Michael Burns Project #4 Follow-up (Individual) (5% of Project #4 grade) Submit this evaluation at http:/engr.oregonstate.edu/teach before midnight Friday, June 5 TEAM # 12Part 1: Self-evaluation 1. Explai
Oregon State - CS - 411
CS411 Project #4 Due before midnight, Wednesday, June 3Team:Graded byPoints PossiblePoints EarnedCommentsPreliminaries (15 pts) Plan of Attack gzipped file submission Submitted source code file, compiled image, compiled module, patch file
Oregon State - CS - 411
CS444 3/04/05 Linux Virtual File SystemVFS Intro The Linux Virtual File System (VFS) is not a file system at all. It is a generic interface that can be used to create file systems for the Linux kernel. All file systems that are supported within
Oregon State - CS - 411
CS411 Operating Systems II Quiz # 2 Take-home, open-book, open-notes. Calculator permitted.Spring 2009Answers should be word-processed, printed, and attached to this page. This quiz is NOT a group project. You may NOT discuss this quiz with anyon
Oregon State - CS - 411
CS411 Operating Systems II Quiz # 2 1. (2 pts) 2. (3 pts)Spring 2009Solutions for selected problemsGiven a record file structure in a file system that provides only sequential access methods (i.e., create_file, reset, read_next_record, write_rec
Oregon State - CS - 411
CS 411 Operating Systems IIHomework Assignment #1 To be discussed in class FridayProblems adapted from Silberschatz, Galvin & GagneSpring 20091. (Easy, but long) Given the following set of processes with arrival times, etc. Smaller priority num
Oregon State - CS - 411
CS 411 Operating Systems IIHomework Assignment #1 To be discussed in classSpring 2009SolutionsProblems adapted from Silberschatz, Galvin & Gagne1. Given the following set of processes with arrival times, etc. Smaller priority numbers indicat
Oregon State - CS - 411
CS 411 Operating Systems II Homework Assignment #2Spring 2009 To be discussed in class1. Given the following memory partitions and processes 0 - 3 to be loaded (in numerical order) using contiguous allocation. Specify any processes that can not b
Oregon State - CS - 411
CS 411 Operating Systems II Homework Assignment #2Spring 2009 Solutions1. Given the following memory partitions and processes 0 - 3 to be loaded (in numerical order) using contiguous allocation. Specify any processes that can not be loaded, and c
Oregon State - CS - 411
CS 411 Operating Systems II Homework Assignment #3Spring 2009 To be discussed in classA system that uses demand paging has 5 frames, all initially empty. Given the page-reference string: 1,1,3,5,2,2,6,8,7,6,2,1,5,5,5,1,4,9,7,7 1. FIFO page-replac
Oregon State - CS - 411
CS 411 Operating Systems II Homework Assignment #3Spring 2009 SolutionsA system that uses demand paging has 5 frames, all initially empty. Given the page-reference string: 1,1,3,5,2,2,6,8,7,6,2,1,5,5,5,1,4,9,7,7 (Use FIFO to resolve ties.) 1. FIF
Oregon State - CS - 411
CS 411 Operating Systems IIHomework Assignment #4Spring 2009To be discussed in classGiven a disk drive with 5000 cylinders, numbered 0 to 4999. Assume that the disk head is positioned at cylinder 1023, and the previous request was at cylinder 1
Oregon State - CS - 411
CS 411 Operating Systems IIHomework Assignment #4Spring 2009SolutionsGiven a disk drive with 5000 cylinders, numbered 0 to 4999. Assume that the disk head is positioned at cylinder 1023, and the previous request was at cylinder 1088. (Note: thi
Oregon State - CS - 411
CS 411 Operating Systems IIHomework Assignment #5 To be discussed in classSpring 20091. Following is an algorithm for solving the critical section problem. Does this solve the problem of mutual exclusion? If so, prove it. If not, give an example
Oregon State - CS - 411
CS 411 Operating Systems IIHomework Assignment #5Spring 2009Solutions1. Following is an algorithm for solving the critical section problem. Does this solve the problem of mutual exclusion? If so, prove it. If not, give an example that disproves