Midterm Review Sheet for Operating Systems | CSE 430, Study notes of Operating Systems

Material Type: Notes; Class: Operating Systems; Subject: Computer Science and Engineering; University: Arizona State University - Tempe; Term: Spring 2005;

Typology: Study notes

Pre 2010

Uploaded on 09/02/2009

koofers-user-98t-1
koofers-user-98t-1 🇺🇸

5

(1)

9 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSE 430 MIDTERM 1 REVIEW SHEET
Preliminary Version 18 February 2005
SPRING 2005
Exams are Thursday 24 February 2005 3:15-4:30 pm BYAC 210
Thursday 24 February 2005 6:40-7:55 pm BYAC 220
Closed book except one 8 x 5" canary colored card of handwritten notes
Exam topics In general, MT1 covers the first four syllabus topics Overview, Processes,
Threads and CPU Scheduling and Silberschatz, Galvin and Gagne 6th ed. Chapters
1-6.
Exam covers Class Notes
Homework
Text
All reasonable extensions
TOPICS
Overview (S G & G Chapters 1-3 and HW #1 and HW #2 and Computer System Structures
Handouts #1, #2, #3, #4 and #5 and Virtual Machines Handout #2 (VMware))
* introduction to operating systems
* operating system as a resource allocator and a control program
* goals of an operating system
* convenience – simple program development environment
* efficiency – good performance
* types of operating systems and historical overview
* mainframe systems
* time-sharing systems
* desktop systems
* multiprocessor systems
* distributed systems
* real-time systems
* handheld systems
* feature migration
* computer system structures
* traps, interrupts and exceptions
* I/O structure
* program controlled and interrupt serviced I/O
* DMA
* storage structure
* main memory
* secondary storage
* storage hierarchy
* caching and cache consistency
pf3
pf4

Partial preview of the text

Download Midterm Review Sheet for Operating Systems | CSE 430 and more Study notes Operating Systems in PDF only on Docsity!

CSE 430 MIDTERM 1 REVIEW SHEET

Preliminary Version 18 February 2005

SPRING 2005

Exams are Thursday 24 February 2005 3:15-4:30 pm BYAC 210 Thursday 24 February 2005 6:40-7:55 pm BYAC 220 Closed book except one 8 x 5" canary colored card of handwritten notes Exam topics In general, MT1 covers the first four syllabus topics Overview, Processes, Threads and CPU Scheduling and Silberschatz, Galvin and Gagne 6th^ ed. Chapters 1-6. Exam covers Class Notes Homework Text All reasonable extensions TOPICS Overview (S G & G Chapters 1-3 and HW #1 and HW #2 and Computer System Structures Handouts #1, #2, #3, #4 and #5 and Virtual Machines Handout #2 (VMware))

  • introduction to operating systems
  • operating system as a resource allocator and a control program
  • goals of an operating system
  • convenience – simple program development environment
  • efficiency – good performance
  • types of operating systems and historical overview
  • mainframe systems
  • time-sharing systems
  • desktop systems
  • multiprocessor systems
  • distributed systems
  • real-time systems
  • handheld systems
  • feature migration
  • computer system structures
  • traps, interrupts and exceptions
  • I/O structure
  • program controlled and interrupt serviced I/O
  • DMA
  • storage structure
  • main memory
  • secondary storage
  • storage hierarchy
  • caching and cache consistency

CSE 430 MIDTERM 1 REVIEW SHEET SPRING 2005

TOPICS (continued) Overview (continued)

  • Hardware protection
  • hardware support - what's needed/why/how it works
  • dual mode
  • privileged instructions
  • I/O protection
  • memory protection
  • CPU protection
  • the role of system calls
  • Network Structure
  • LANs and WANs
  • Operating System Structure
  • system components
  • operating system services
  • system calls
  • MS DOS and UNIX process execution
  • system programs
  • message passing and shared memory communication models
  • relationship between commands, system programs and system calls
  • System structure
  • simple - MS-DOS and UNIX
  • layered approach - OS/
  • micro-kernel and client-server system structure – Mach and L
  • layered, modular and client-server – Windows 2000
  • virtual machine concept and virtual machines
  • IBM VM
  • Java
  • Intel 80x86 and Motorola 680x0 virtual machines
  • VMware
  • policy and mechanism
  • system implementation – high level language vs. assembler language
  • system generation/booting/initialization Processes (S G & G Chapter 4 and HW #3 (first part) and Processes Handouts #1, #2 and #3)
  • process concept
  • processes and programs
  • process states - ready/running/waiting
  • process control block
  • context switch
  • process scheduling
  • scheduling queues
  • schedulers - short/medium/long term
  • dispatcher

CSE 430 MIDTERM 1 REVIEW SHEET SPRING 2005

TOPICS (continued) CPU Scheduling (S, G & G Ch. 6 and HW #4 and Scheduling Handouts #1, #2 and #3)

  • Basic Concepts
  • CPU-I/O burst cycle
  • CPU scheduler
  • Preemptive scheduling
  • Dispatcher
  • scheduling queues
  • schedulers - short/medium/long term
  • Performance Criteria
  • waiting time/CPU utilization/response time/throughput/turnaround time
  • Scheduling Algorithms
  • FCFS/SJF/Priority/RR
  • preemptive and non-preemptive algorithms
  • time quantum and context switch time
  • starvation and aging
  • multilevel queues
  • multiple-processor scheduling
  • Real-time scheduling
  • hard and soft real-time
  • real-time priorities
  • dispatch latency
  • evaluation of algorithms
  • analytical modeling
  • deterministic
  • queueing model
  • Little’s Law
  • simulation
  • implementation
  • advantages and disadvantages of the three evaluation techniques
  • Solaris 2 Scheduling
  • Windows 2000 Scheduling
  • Linux Scheduling