1. Final Review Mark Stanovich Operating Systems COP 4610

2. Coverage Total: 70 points; just under 2 min / point 50 points based on lectures, project 3 20 points for everything 13 bonus points

3. Coverage Many points based on your ability to apply various principles learned in class  Especially in cumulative section Remember, to receive a passing grade for the overall course, you must at least earn a passing grade on the final exam and a passing grade on the projects

4. Device Management Definitions – Polling/interrupts/DMA/double buffering – Device controller/device driver – Memory-mapped I/O – Disk-related terms – Disk measurement metrics

5. Device Management Short answers – Categories of I/O devices – Ways to access a device – Disk arm scheduling policies – Latency and bandwidth computations

6. File Systems and Disk Management Definitions  File  File header

7. File Systems and Disk Management Short answers  File system components Disk management, naming, protection, reliability  Ways to access a file Sequential, random, content-based  File usage patterns

8. File Systems and Disk Management Short answers  Disk allocation policies Contiguous, link-list, segment-based, indexed, multilevel indexed, hashed

9. Naming and Directories Definitions  i_node  Directory  Name collisions  Absolute path name  Path resolution

10. Naming and Directories Short answers  Different ways to organize a name space Flat name space Hierarchical name space Relational name space Contextual naming Content-based naming

11. Transactions and Reliability Definitions  Metadata  Log  Raid levels Striping Mirroring ECC Parity

12. Transactions and Reliability Short answers  Characteristics of a transaction  Steps to a transaction  RAID levels

13. Protection and Security Definitions  Security  Protection  Access matrix  Access control list  Capability list

14. Protection and Security Short answers  Three goals of security confidentiality, data integrity, system availability  Three security components authentication, authorization, enforcement  Kerberos protocol  Public key encryption

15. Protection and Security Short answers  Classes of security problems Eavesdropping, abuse of privilege, imposter, Trojan horse, salami attack, logic bomb, denial-of-service attacks

16. Network Protocols Definitions  Protocols  Port  Byzantine uncertainty  Two-phase commit

17. Network Protocols Short answers  Internet protocol  Unreliable data protocol  Transmission control protocol

18. Networks and Distributed Systems Definitions  Distributed systems  Protocol  Network  Packet  Arbitration  Routing

19. Networks and Distributed Systems Short answers  Ethernet arbitration techniques carrier sensing, collision detection, adaptive randomized waiting  Point-to-point vs. broadcast network  Aloha network

20. RPC and Distributed FS Definitions  Location transparency  Procedure stubs  Stateless protocol  Idempotent functions

21. RPC and Distributed FS Short answers  Differences of RPC vs. procedure calls  Advantages of using RPC for IPC  Design principles of NFS  NFS vs. AFS  xFS design principles  Consistency for NFS, AFS, and xFS

22. Real-Time Systems Perioidic task workload model Execution time – Causes for variations – Worst-case execution time Common Scheduling Algorithms Schedulability Analysis

23. Real-Time Systems Preemptive vs non-preemptive Priority Inversion – Examples

24. Project 3 Short answers  Steps to obtain the content of a FAT entry

25. Everything CPU-IO scheduling schemes Deadlock resolution techniques Demand paging algorithms Booting sequence Ways to access storage device Address translation schemes

26. Some Exam-taking Techniques Use bullets instead of complete sentences State what you do know and why existing methods do not work