O.S OS Overview Process Management Storage Management I/O Systems Distributed Systems Protection and Security Case Studies Mainframe OS Batch Systems Job Scheduling Multiprogrammed Systems Interactive O.S/Systems Time Sharing O.S/Systems Logical Memory Physical Memory Multiprocessor Systems/Parallel Systems/Tightly Coupled Systems Asymmetric Multiprocessing Asymmetric Multiprocessing Clustered O.S/Systems Symmetric Clustering Asymmetric Clustering Distributed Lock Manager Real time O.S/Systems Hard Real Time O.S/System Soft Real Time O.S/System Computer System Operation Trap Definition Bootstrap Program Definition Interrupt Definition I/O Structure Synchronous I/O Interrupts I/O Interrupts Device Status Table DMA Structure I/O Port Interrupt Driven I/O Programmed I/O Distributed System I/O Bus Storage Hierarchy Cache Management Cache Coherency and Consistency Cache-Consistency Problem Network Virtual Memory Cache Consistency-Server-initiated Approach Cache consistency-Client-initiated Approach Hardware Protection Privelaged Instructions Privelaged Mode/System Mode I/O Protection CPU Protection Network Structure Networking Communication Processors Routers Modems Wide Area Networks Process Management Functions with pocess management Main Memory Management Memory Management Activities Secondary Storage Management Primary Storage Secondary Storage O.S Services Protection System Resource Allocation Program Execution Control Statements File System Manipulation I/O Operations Accounting System Calls Process Control System Calls Device Management System Calls File Management System Calls Information Maintainence System Calls Communication System Calls Process Name System Structure Simple Structure/MS-DOS layer Structure Layered Approach Microkernels Modularity Virtual Machines Implementaion of Virtual Machine Benefits of Virtual Machine System Development Time Java Bytecodes Java Virtual Machine Process Concept Process State Process Control Block New State Running State Process Scheduling Scheduling Queues Schedulers Context Switch Process Mix Long-term Scheduler/Job Scheduler Short-term Scheduler/CPU Scheduler CPU Bound Process Degree of Multiprogramming Operations on Processes Process Termination Process Creation Process Creation with Virtual Memory Copy on Write Memory Mapping Cascading Termination Cooperating Processes Unbounded-Buffer Producer Consumer Problem Computer Speedup Independent Processes Information Sharing Consumer Process Producer Process Interprocess Communication Message Passing Model Buffering Naming Synchronization Message Based O.S Example-Mach Modularity Based Example-Windows 200 Direct Communication Indirect Communication Blocking Send-Receive Non-Blocking Send-Receive LPC Communication in Client-Server Systems Sockets RPC Remote Method Invocation Stub Client Stub External Data Representation Passed By Reference Benefits of Multithreading Responsiveness Multithreading Models Many-to-One Model Many-to-Many Model One-to-One Model Threading Issues Thread Cancellation Exec System Call Fork System Call Cancellation Points Signal Handling Thread Pools Thread Specific Data Pthreads Pthread API Solaris 2 Threads Unbound Thread Bound Thread Java Threads CPU-I/O Burst Cycle CPU Bursts I/O Bursts CPU Scheduling Criteria CPU Utilization Throughput Response Time Turnaround Time Waiting Time CPU Scheduling Algorithms First-Come,First-Served Scheduling/FCFS Algorithm Shortest-Job-First Scheduling Algorithm/SJF Algorithm Priority Scheduling Algorithm Round-Robin Scheduling Multilevel Queue Scheduling Multilevel Feedback Queue Scheduling Burst Time Aging High Priority Process Process Priority Indefinite Blocking/Starvation Non-Preemptive Priority Scheduling Preemptive Priority Scheduling Time Quantum/Time Slice Multiple-Processor Scheduling Uniform Memory Access Heterogenous System Homogenous System Real-Time Scheduling Conflict Phase Soft Real Time System Hard Real Time System Priority Inheritance Protocol Resource Reservation Dispatch Latency Priority Inversion CPU Scheduling Algorithm Evaluation Deterministic Modeling Queuing Model Simulation Analytic Evaluation Queuing-Network Analysis Little's Formula Process Scheduling Models DEC TOPS-20 Example-Solaris 2 Example-Windows 2000 Example-Linux Critical Section Problem Exit Section Remainder section Entry Section Bounded Waiting Mutual Exclusion Progress Solutions to Critical Section Problem Release Message Reply Message Centralized Approach Fully Distributed Approach Request Queue Token Multiple Process Solutions Synchronization Hardware Mutual Exclusion with Test And Set Test And Set Instruction Mutual Exclusion with Swap Swap Instruction Bounded Waiting-Mutual Exclusion with Test And Set Semaphores Semaphore Usage Mutual Exclsion with Semaphores Spinlock Signal Semaphore Definition Wait Semaphore Definition Deadlocked Processes Binary Semaphores Counting Semaphores Classic Problems of Synchronization Bounded Buffer problem Readers-Writers Problem Dining Philosophers Problem Critical Regions Critical Region Construct Critical Region Construct Implementation Monitors Monitor-Syntax OS Synchronization Turnstile Adaptive Mutex Synchronization in Windows 2000 Atomic Transactions Transaction Abort Comitted State System Model Transaction Definition Conflicting Operations Log-Based Recovery Checkpoints Concurrent Atomic Transactions Volatile Storage Non-volatile Storage Stable Storage Serializability Definition Non-Serial Schedule Serial Schedule Conflict Serializable Locking Protocol Time Stamp Based Protocols Growing Phase Shrinking Phase Shared Mode Lock Nonreplicated Scheme Exclusive Locks Shared Locks Single-Coordinator Approach Biased Protocol Majority Protocol Deadlocks-System Model Release Resource Request Resource Use Resource Deadlock Characterization Conditions for Deadlock Resource Allocation Graph Assignment Edge Request Edge Handling Deadlocks Deadlock Prevention Deadlock Avoidance Algorithms Bankers Algorithm Data Structures for Bankers Algortihm Recovery from Deadlock Abort Processes Resource Preemption Rollback Preemption without Starvation Address Binding Compile Time Compiler Linker Load Time Loader Execution Time Dynamically Linked Libraries Shared Libraries Static Linking Swapping Ready Queue Swapping Constraints Contiguous Memory Allocation Memory Protection Memory Allocation Fragmentation Transient OS code Worst Fit Strategy Multiple Partition Method Best Fit Strategy First Fit Strategy Compaction Internal Fragmentation Paging Paging Method Paging Harware Support Valid/Invalid Bit Page Table-Structure Shared Pages Page Number Page Offset Frames Pages Frame Table Page Table Base Register TLB Miss Translation Look Aside Buffer Hit Ratio Segmentation Segment Base Segment Table Segmentation Hardware Segmentation Protection Segmentation Sharing Segmentation and Fragmentation Segmentation with Paging Global Descriptor Table Local Descriptor Table Demand Paging Lazy Swapper Pager Page Fault Trap Pure Demand Paging Effective Access Time Performance of Demand Paging Page Fault Rate Child Process Page Replacement FIFO Page Replacement Algorithm Optimal Page Replacement Algorithm Least Recently Used Page Replacement Algorithm LRU Approximation Page Replacement Counting Based Page Replacement Algorithm Page Buffering Algorithm Belady's Anomaly Counter Implementation of LRU Stack Implementation of LRU Allocation of Frames Minimum Number of Frames Allocation of Frames Algorithms Global Replacement Local Replacement Equal Allocation Algorithms Proportional Allocation Algorithm Thrashing Cause of Thrashing Local Replacement Algorithm/Priority Replacement Algorithm Working Set Model Page Fault Frequency O-S Examples Solaris 2 Windows NT File Concept File Attributes File Operations File Structure Directory List File Types multimedia file print file Text File Archives Batch Files Object file Source code file File Access Methods Direct Access/Relative Access Sequential Access Indexed Access Directory Structure Single Level Directory Device Directory/Volume table of Contents Two-Level Directory Tree-Structured Directories Acyclic Path Directories General Graph Directory File-System Mounting Mount Point File Sharing File Sharing with Multiple Users File Sharing with Remote File Systems Immutable-Shared-Files Semantics Consistency Semantics Session Semantics Unix Semantics Client-Server Systems Distributed Information Systems/Distributed Naming Services Failure Modes File System Protection Types of Access Access Control Access Control List File System Structure File Control Block File Organization Module File Systems Levels of File System Basic File System Logical Block Physical Block File-System Implementation inode Boot Control Block On-disk Structures Partition Control Block Partitions and Mounting Raw Disk Root Partition Mount Table Structure Virtual File Systems Directory Implementation Hash Table Linear List Contiguous Allocation Dynamic Storage Allocation Linked Allocation File Allocation Table Indexed Allocation Double Indirect Block Pointer Indirect Blocks Linked Scheme Combined Scheme Direct Blocks Multilevel Index Free Space Management Bit Vector/Bit Map Linked List Grouping Counting File Systems-Efficiency and Performance Efficient Disk Use Cache Double Caching Unified Buffer Cache Unified Virtual Memory Asynchronous Writes Synchronous Writes File System-Recovery Consistency Checking Backup and Restore NFS Design Goals of NFS Mount Protocol NFS Protocol NFS Architecture Path-Name Translation Remote Operations In NFS I/O Systems Overview Device Drivers I/O Registers I/O Hardware Polling Interrupts Direct Memory Access Raising an Interrupt Interrupt Handler Interrupt Request Line Interrupt Vector Table Interrupt Controller Hardware Maskable Interrupt Non-Maskable Interrupt Interrupt priority Levels Exceptions Software Interrupt/Trap Memory Mapped I/O Cycle Stealing Direct Virtual Memory Access Steps in DMA Transfer Application I/O Interface Kernel I/O Structure Characterizations of I/O Devices Block and Character Devices clocks and timers Network Devices Blocking I/O Non-Blocking I/O Programmable Interval Timer Block-Device Interface Raw I/O Network Socket Interface Kernel I/O Subsystem I/O Scheduling Double Buffering Error Handling Kernel Data Structures Streams Flow Control Stream Modules Stream Head Stream Structure Disk Structure Constant Angular Velocity Constant Linear Velocity Disk Scheduling FCFS Disk Scheduling Algorithm Shortest-seek-time-first Disk Scheduling algorithm SCAN Disk Scheduling Algorithm/Elevator Algorithm C-SCAN Scheduling LOOK Scheduling C-LOOK Scheduling Disk Scheduling Algorithm Selection Disk Management Disk Formatting Bad Blocks Boot Block Swap-Space Management Swap Maps Swap-Space Location Swap-Swap Use Swap-Space Management-Example RAID Levels RAID Level 3/Bit-interleaved Parity Organization RAID Level 0 RAID Level 1 RAID Level 2/Memory Style Error Correcting Code Organisation RAID Level 5/Block-interleaved Distributed Parity RAID Level 4/Block-interleaved Parity Organization RAID level 0+1 RAID Level 6/P+Q Redundancy Scheme Disk Attachment Storage area network Host Attached Storage Method of Disk Attachment Network Attached Storage OS Jobs Fila Naming Hierarchial Storage Management Robotic Jukebox Performance Issues of Tertiary Storage Speed Sustained Bandwidth/Bandwidth of a Drive Distributed O.S-Types Network O.S Distributed Operating System Data Migration Computation Migration Process Migration Distributed Systems-Network Types Local Area Network Distributed Systems-Communication Virtual Routing Communciation Cost Host Name Name Resolver Name Server Fixed Routing Routing Strategies Routing Table Gateway Packet Strategies Connection Strategies Token Passing Collision Detection Contention CSMA/CD Distributed Systems-Communication Protocols Presentation Layer Session Layer Message Slots Physical Layer Data Link Layer ISO Network Message Network Layer Transport Layer Application Layer ISO Protocol Stack Distributed Systems-Robustness Failure Detection Reconfiguration Time-out Scheme Recovery from Failure Distributed Systems-Design Issues Transparency Scalability Cluster Distributed Systems-Example:Networking Address Resolution Protocol Client Interface Server Medium Access Control Ethernet Packet Naming and Transparency Naming Structures Naming Schemes Administrative Complexity of Naming Structures Location Independent File Identifiers Remote File Access Cache Location Issues Cache Update Policy Caching Vs Remote Services Delayed-Write Policy Write-Through Policy Write-On-Close Policy Stateful Vs Stateless Servers Orphan Detection and Elimination Stateful File Service Stateless File Server Distributed File Systems-Example:Andrew File System Overview of AFS Shared Name Space Consistency Semantics in AFS File Operations in AFS Event Ordering Logical Clock Concurrent execution Happened-Before Relation Global Ordering Timestamp Atomicity Transaction Co-ordinator Two-Phase Commit Protocol Failure Handling in Two Phase Commit Protocol Failure of Participating Site Failure of Co-ordinator Failure of Network Concurrency Control Unique Timestamp Generation Timestamp Ordering Scheme Conservative Timestamp Ordering Scheme Deadlock Detection Deadlock Detection Algorithm for single Instance of each Resource Type Deadlock Detection Algorithm for several Instances of a Resource Type Detection Algorithm Usage Election Algorithms Bully Algorithm Ring Algorithm Reaching Agreement Byzantine Generals Problem Unreliable Communications Faulty Process Domain of Protection Software Objects Hardware Objects Domain Structure An Example:Unix An Example:Multics Protection-Access Matrix Access Matrix with Control-Rights Access Matrix with Copy-Rights Access-Matrix with Owner-Rights Confinement Problem Protection-Implementation of Access Matrix Access list for Objects Global Table Capability list for Domains Lock-Key Mechanism Locks-Definition Keys Protection-Revocation of Access Rights Permanent Revocation Temporary Revocation Partial Revocation General Revocation Selective Revocation Delayed Revocation Back Pointers Immediate Revocation Indirection Reaquisition Capability-Based Systems An Example:Hydra An Example-Cambridge CAP System Language Based Protection Compiler-Based Enforcement Protection in Java 2 The Security Problem Network level Security Measure Human level Security Measure Operating System level Security Measure Physical level Security Measure User Authentication Password Vulnerabilities Passwords Encrypted Passwords One-Time Passwords Paired Passwords Biometrics Seed Personal Identification Number(PIN) Program Threats Trap Door Trojan Horse Stack and Buffer Overflow System Threats Denial of Service Attacks Worms Virus Securing Systems and Facilities Spoofing Firewall Security Domains Demilitarized Zone Tunnel Intrusion Detection Anomaly Detection Signature Based Detection Auditing and Logging Tripwire File Systems System-Call Monitoring Cryptography Encryption Authentication An Example:SSL Use of Cryptography Private Key Certification Authority Public Key Computing Environments Traditional Computing Embedded Computing Web Based Computing Memory Management Information CPU Registers Program Counter Accounting Information I/O Status Information CPU Scheduling and Multi-Programming Job Queue Device Queue Connection Oriented Sockets/TCP Sockets Connectionless Sockets/UDP Sockets Green Threads Asynchronous Signal Synchronous Signal Signal Issues in Signal Delivery Gantt Chart Convoy Effect Exponential average Non-Preemptive SJF Preemptive SJF Safe State Deadlock State Unsafe State Resource Allocation Graph Algorithm Hierarchial Paging/Forward Mapped Page Table Hashed Page Tables Inverted Page Table Additional Reference Bits Algorithm Second Chance Algorithm Enhanced Second Chance Algorithm Most Frequently Used Page Replacement Algorithm Least Frequently Used Page Replacement Algorithm Logical records Relative Block Number Definition Group Universe File Owner Data-out Register Control Register Data-in Register Status Register Logical Formatting Error Correcting Code Low Level Formatting/Physical Formatting Ring Structure Centralized Approach-Deadlock Detection Deadlock Detection Co-ordinator False Cycles Protection Domain Access Rights Domain Switching Grappling Hook/Bootstrap Vector Program Spawn Mechanism Buffer-Overflow Attack Audit-trail Processing File Management File File Management Functions I/O System Management I/O Subsystem Shared Memory Model Preemptive Scheduling Non-Preemptive Scheme Preemptive Scheme Kernel Mailbox Notify Mailbox Mailbox Set Transaction Name Write-Ahead Logging Zero Capacity Bounded Capacity Unbounded Capacity Asynchronous Thread Cancellation Target Thread Immutable Shared Files Sector Slipping Sector Sparing/Forwarding Location Independence Location Transparency Advanced Encryption Standard Data Encryption Standard Symmetric and Asymmetric Encryption Algorithm Metropolitan Area Network Small Area Network Peer to Peer Systems Logical Address Space Logical Address File Name Master Key Physical Address Space Physical Address File Read File Write File Append File Rename File Size File Delete Repositioning within File File open count File Pointer File Create OS Introduction Computer System Structures Operating System Structures Desktop O.S/Systems Feature Migration Definition Handheld O.S/Systems Distributed Systems Structure Overview OS Definition Storage Structure System Design and Implementation System Generation System Programs System Components Processes Deadlocks Threads CPU Scheduling Process Synchronization Linux Threads Window 2000 Threads Thread Overview Basic Concepts-CPU Scheduling Process Synchronization-Overview Deadlock Avoidance Deadlock Prevention Memory Management Virtual Memory File-System Interface File System Implementation Memory Management-Overview Virtual Memory Other Considerations Virtual Memory-Overview Allocation Methods Log Structured File System I/O Systems Mass-Storage Structure I/O and System Performance I/O to Hardware Operations Stable-Storage Implementation RAID Structure Tertiary Storage Devices Distributed Systems Structure Distributed File Systems Distributed Coordination Distributed Systems-Topology File Replication Distributed File Systems-Overview Distributed File Systems-Deadlock Handling Protection Security Goals of Protoection Security-An Example-Windows NT Computer Security Classifications Linux System Windows 2000 Windows XP Historical Perspective Linux-Design Principles Linux-File Systems Linux System-History Linux-Input and Output Linux-Interprocess Communication Linux-Kernel Modules Linux-Memory Management Linux-Network Structure Linux-Process Management Linux-Scheduling Linux-Security Win2000-Design Principles Win2000-Environmental Subsystems Win2000-File System Win200-History Win2000-Networking Win2000-Programmer Interface Win2000-System Components Win XP-Design Principles Win XP-Environmental Subsystems Win XP-File System Win XP-History Win XP-Networking Win XP-Programmer Interface Win XP-System Components Atlas CTSS Early Systems Mach MULTICS OS/360 Other Systems RC4000 THE XDS-940 Magnetic Disks Main Memory Head Crash Magnetic Tape Random Access Time Transfer Rate Host Controller Command Interpretor System Heavyweight Process Lightweight Process Multithreaded Singlethreaded Process Kernel Threads User Threads Dispatcher Prepaging TLB Reach I/O Interlock Real Time Processing Mean Time of Failure Mirroring/Shadowing Redundancy Bit-Level Striping Block-Level Striping Data Striping Extensions to RAID Computation Speedup Resource Sharing Load Sharing Reliability Client Service Fully Distributed Approach-Deadlock Detection Cooperating Sequential Processes Process Coordination Process Synchronization Definition Race Condition Memory Address Register Context Switch Time Memory Management Unit Page Base Address Virtual Address Dynamic Loading Overlays Relocation Register Virtual Address Space Removable Disks Tapes Tertiary Storage Devices Break Circular Wait Break No Preemption Break Hold and Wait Break Mutual Exclusion Wait-Die Scheme Wound-Wait Scheme