OPERATING SYSTEMS CS 450
Popular in Course
Popular in ComputerScienence
This 2 page Class Notes was uploaded by Mable Windler on Saturday September 26, 2015. The Class Notes belongs to CS 450 at James Madison University taught by Staff in Fall. Since its upload, it has received 5 views. For similar materials see /class/214137/cs-450-james-madison-university in ComputerScienence at James Madison University.
Reviews for OPERATING SYSTEMS
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 09/26/15
Equot W 5 U 9 gt1 00 gt0 Review for Final Examination CS450 and CS550 Operating Systems 2007 Charles Abzug Functions of the Operating System OS Different Environments Within which the computer and its OS must function Design Goals OSRelated Terminology Major OS Concepts and their evolution from the rst primitive systems SingleJobataTime Batch Mode MultiProgramming TimeSharing Standalone PCs Networked PCs GUI MultiProcessors i Symmetric ii Asymmetric Slave Processors Distributed Systems HandHeld Process Control amp RealTime i Hard RealTime ii Soft RealTime rteH2999 we WI Simultaneity vs Concurrency Hardware Features that Support the OS a Processor States and Privileged Instructions b Examples of Privileged Instructions Sequence of Events when a System Call is invoked The Concept of the Process a The Process Image b The Role of the OS in Managing the Processes on the Machine Page 1 of 3 06 Dec 2007 CS 450 amp CS 550 Operating Systems Review for Final Exam O N W 4 U 6 D N O N N N P nIII39 Multiple Virtual Environments VM370 Multiprocessing and the Context Switch Process States and PermissibleImpermissible State Transitions The Process Descriptor Handling of Interrupts Processes and Threads similarities and differences a UserLevel Threads vs KernelLevel Threads b Creation amp Termination of a Process c Creation amp Termination of a Thread Semaphores and Mutual Exclusion Three Kinds of Process Schedulers a LongTerm b MediumTerm c ShortTerm orTl u ad 39 39 quot a FCFS b SJF c SRT d RoundRobin e Priority Scheduling f ShortestProcess NeXt g FairShare Scheduling Deadlock amp Starvation a De nitions of the terms b How does deadlock occur c Four Conditions necessary for deadlock to occur d Kinds of Resources that can get deadlocked The ResourceAllocation Graph Detection of the Occurrence of Deadlock a Graphical Detection b VectorampMat1iX Detection Four Major Approaches for Dealing with Deadlock a Deadlock Prevention b Deadlock Avoidance c Deadlock Detection amp Manual Resolution d The Ostrich Technique Page 2 of 3 06 Dec 2007
Are you sure you want to buy this material for
You're already Subscribed!
Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'