ECS 251, Operating Systems

Introduction

This contains the index to all handouts and notes for ECS 251, Winter Quarter 2000.

Class Information

• General Information [FM] [PDF] [PS] [TXT]
• Syllabus
• Project
• All About Homework
• All About UCDisk

Exam

• Final Exam [FM] [PDF] [PS] [TXT], due March 23, 2000

Homework

• Homework #1 [FM] [PDF] [PS] [TXT], due February 8, 2000
• Homework #2 [FM] [PDF] [PS] [TXT], due February 29, 2000
• Homework #3 [FM] [PDF] [PS] [TXT], due March 15, 2000

Handouts

• Interprocess Synchronization and Communication [FM] [PDF] [PS] [TXT]
  • Outline
  • Improper Nesting Example
  • Maximally Parallel Systems
  • Bakery Algorithm
  • Bogus Bakery Algorithm
  • Test and Set Solution
  • Classical Synchronization Problems
  • Producer/Consumer Problem (Semaphores)
  • First Readers Writers Problem (Semaphores)
  • First Readers-Writers Problem (SP, SV)
  • General Priority Problem (SP, SV)
  • send/receive Chart
  • Producer Consumer Problem (Send/Receive)
  • Producer Consumer Problem (Monitors)
  • First Readers Writers Problem (Monitors)
  • Monitors and Semaphores
  • Monitors and Priority Waits
  • First Readers Writers Problem (Crowd Monitors)
  • Producer Consumer Problem (Invariant Expressions)
  • First Readers Writers Problem (Invariant Expressions)
  • Producer Consumer Problem (Open Path Expressions)
  • Producer Consumer Process (CSP)
  • Producer Consumer Problem (ADA)
• Deadlock [FM] [PDF] [PS] [TXT]
• Distributed Systems Fundamentals [FM] [PDF] [PS] [TXT]