Operating Systems ECS 150
Popular in Course
Popular in Engineering Computer Science
This 1 page Study Guide was uploaded by Ashleigh Dare on Tuesday September 8, 2015. The Study Guide belongs to ECS 150 at University of California - Davis taught by Matthew Bishop in Fall. Since its upload, it has received 72 views. For similar materials see /class/187705/ecs-150-university-of-california-davis in Engineering Computer Science at University of California - Davis.
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/08/15
March 13 2000 ECS 150 7 Winter 2000 Page 1 Study Guide for Final This is simply a guide of topics thatI consider fair game for the nal I don t promise to ask you about them all or about any of these in particular but I may very well ask you about any of these 1 N E 4 V Anything from the midterm study guide Input and Output a device drivers and transparency b structure of a device driver c character code independence device independence uniform treatment of devices d hardware characteristics of disks magnetic tape communications lines e escape characters buit stuf ng f device interfaces g device drivers lower upper parts h disk scheduling algorithms FCFS pickup SSTF SCAN LOOK NStep SCAN CSCAN CLOOK i le system calls for IO j blocking vs nonblocking IO Memory management a bare machine resident monitor fence addresses and fence registers b relocation and address bin in c bounds registers base and limit registers d internal vs external fragmentation e compaction f paging and page tables g segmentation and segment tables h optimizations cache hit ratio effective memory access time i views of memory program vs operating system address translation j protection k segmented paging segment the page table 1 paged segmentation page the segments m virtual memory demand paging page faults pure demand paging n page replacement and victims and dirty bits FIFO OPT LRU stack algorithms 0 minimum number of pages per process p global vs local allocation q working set thrashing principle of locality working set model working set window size working set prin ciple r prepaging IO interlock choosing page size restructuring program File Systems virtual vs physical39 names directory structures access control rights ACLs UNIX abbreviations access via create open close read write rewind delete system calls or commands access methods sequential directmapped structure disk directory free list implementations allocation methods contiguous linked indexed Deadlock a resource manager request release b what is deadlock difference between it and starvation c resource types reusable consumable d how to deal with deadlock ignore detection and recovery prevention mutual exclusion no preemption cir cular wait hold and wait avoidance deadlock recovery breaking circular wait break no preemption ie allow preemption f Deadlock Prevention hierarchical ordering ordered resource policy acquire all resources before running deadlock avoidance banker39s algorit nae0579 12 1 Last modified at 1204 pm on Monday March 13 2000
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'