1 / 50

Chapter 11 Operating Systems

Chapter 11 Operating Systems. Chapter Goals. Describe the functions and layers of an operating system List the resources allocated by the operating system and describe the complexities of the application process Explain how an operating system manages processes and threads.

len
Télécharger la présentation

Chapter 11 Operating Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 11Operating Systems

  2. Chapter Goals • Describe the functions and layers of an operating system • List the resources allocated by the operating system and describe the complexities of the application process • Explain how an operating system manages processes and threads INFO 225: Chapter 11

  3. Chapter Goals (continued) • Compare and contrast alternative CPU scheduling methods • Explain how the operating system manages memory INFO 225: Chapter 11

  4. INFO 225: Chapter 11

  5. Operating System Overview • Most important component of system software • Primary purpose: Manage hardware resources and provide support services to users and application programs • Manages CPU, memory, processes, secondary storage (files), I/O devices, and users • Consists of kernel, service layer, and command layer INFO 225: Chapter 11

  6. Operating System Management Functions • Loosely divided between: • Those oriented to hardware resources • Those oriented to users and their programs • Make OS more maintainable; functions within one layer can be modified without affecting other layers INFO 225: Chapter 11

  7. INFO 225: Chapter 11

  8. INFO 225: Chapter 11

  9. INFO 225: Chapter 11

  10. Resource Allocation • Single-tasking and multitasking • Goals and tasks • Real and virtual resources INFO 225: Chapter 11

  11. Single-Tasking Resource Allocation • Involves only two executing programs • Application • OS (grants the application all unused hardware resources) • MS-DOS • Most common single-tasking OS • Widely used until early 1990s INFO 225: Chapter 11

  12. Multitasking Resource Allocation • Norm for modern general-purpose computers • Allows flexibility of application and system software INFO 225: Chapter 11

  13. Resource Allocation Goals • Meet resource needs of each program • Prevent programs from interfering with one another • Efficiently use hardware and other resources INFO 225: Chapter 11

  14. Resource Allocation Tasks • Keep detailed records of available resources; know which resources can satisfy which requests • Schedule resources based on specific allocation policies • Update records to reflect resource commitment and release by programs and users INFO 225: Chapter 11

  15. Real and Virtual Resources • Real resources • Physical devices and associated system software • Virtual resources • Resources that are apparent to a process or user • Meet or exceed real resources by: • Rapidly shifting resources unused by one program to other programs that need them • Substituting one type of resource for another INFO 225: Chapter 11

  16. Process Management • Process • Unit of executing software managed independently by OS • Can request and receive hardware resources and OS services • Can be stand-alone or part of a group that cooperates to achieve a common purpose • Can communicate with other processes executing on the same computer or on other computers INFO 225: Chapter 11

  17. Process Control Data Structures • Process control block (PCB) • Created, updated, and deleted by OS • Used by OS to perform many functions (e.g., resource allocation, secure resource access, protecting active processes from interference with other active processes) • Normally organized into a larger data structure (called a linked list, process queue, or process list) INFO 225: Chapter 11

  18. Process Control Data Structures • Processes can spawn other processes and communicate with them • Parent process • Child process • Sibling process • Process family INFO 225: Chapter 11

  19. Threads • Portion of a process that can be scheduled and executed independently • Can execute concurrently on a single processor or simultaneously on multiple processors • Share all resources allocated to parent process • Advantage: Reduce OS overhead for resource allocation and process management • Thread control block (TCB) and run queues INFO 225: Chapter 11

  20. CPU Allocation • OS makes rapid decisions about which threads receive CPU control and for how long that control is retained • Threads usually share CPUs (concurrent or interleaved execution) INFO 225: Chapter 11

  21. INFO 225: Chapter 11

  22. Thread States • Ready • Waiting for access to the CPU • Running • Retains control of CPU until the thread or its parent process terminates normally or an interrupt occurs • Blocked • Waiting for some event to occur (completion of service request or correction of an error condition) INFO 225: Chapter 11

  23. INFO 225: Chapter 11

  24. Interrupt Processing • CPU automatically suspends currently executing thread, pushes current register values onto the stack, and transfers control to OS master interrupt handler • Suspended thread remains on the stack until interrupt processing is completed (blocked state) • Once interrupt has been processed, OS can leave suspended thread in blocked state, move it to ready state, or return it to running state INFO 225: Chapter 11

  25. Scheduling • Decision-making process used by OS to determine which ready thread moves to the running state • Typical methods • Preemptive scheduling • Priority-based scheduling • Real-time scheduling INFO 225: Chapter 11

  26. Preemptive Scheduling • A thread can be removed involuntarily from the running state • Functions of the supervisor (portion of OS that receives control) • Calls appropriate interrupt handler • Transfers control to the scheduler INFO 225: Chapter 11

  27. Preemptive Scheduling (continued) • Functions of the scheduler • Updates status of any process or thread affected by last interrupt • Decides which thread to dispatch to the CPU • Updates thread control information and the stack to reflect the scheduling decision • Dispatches selected thread INFO 225: Chapter 11

  28. Processing steps on left occur after Thread 1 makes an I/O service call. Processing steps on right occur after I/O device completes I/O operation. INFO 225: Chapter 11

  29. Timer Interrupts • Generated at regular intervals by CPU to give scheduler an opportunity to suspend currently executing thread • Not a “real” interrupt; no interrupt handler to call; supervisor passes control to the scheduler • Important CPU hardware feature for multitasking OSs INFO 225: Chapter 11

  30. Priority-Based Scheduling • Determines which ready thread should be dispatched to the CPU according to: • First come first served (FCFS) • Explicit priority • Shortest time remaining (STR) INFO 225: Chapter 11

  31. Real-Time Scheduling • Guarantees minimum amount of CPU time to a thread if the thread makes an explicit real-time scheduling request when it is created • Guarantees a thread enough resources to complete its function within a specified time • Often used in transaction processing, data acquisition, and automated process control INFO 225: Chapter 11

  32. Memory Allocation • OS allocates memory: • When threads are created; responds to requests for additional memory during a thread’s lifetime • To itself and for other needs (buffers and caches) • Memory references are mapped to physical addresses through table lookups and address calculations INFO 225: Chapter 11

  33. Single-Tasking Memory Allocation • Bulk of OS normally occupies lower memory addresses; application program is loaded immediately above it • Contiguous and noncontiguous (fragmented) memory allocation • Address resolution • Process of determining physical memory address that corresponds to memory reference INFO 225: Chapter 11

  34. INFO 225: Chapter 11

  35. INFO 225: Chapter 11

  36. Multitasking Memory Allocation • The operating system: • Finds free memory regions in which to load new processes and threads • Reclaims memory when processes or threads terminate INFO 225: Chapter 11

  37. Goals of Multitasking Memory Allocation • Allow as many active processes as possible • Respond quickly to changing memory demands of processes • Prevent unauthorized changes to a process’s memory region(s) • Implement memory allocation and addressing as efficiently as possible INFO 225: Chapter 11

  38. Memory is divided into fixed-sized partitions; processes are allocated memory partitions to store instructions and data. INFO 225: Chapter 11

  39. INFO 225: Chapter 11

  40. OS maintains tables to track partition allocations and free space. INFO 225: Chapter 11

  41. Memory Fragmentation • As memory becomes more fragmented, larger processes have increasing difficulty finding enough contiguous partitions • To address the problem: • Compaction (large overhead) • Noncontiguous memory allocation INFO 225: Chapter 11

  42. Memory partition allocation and deallocation leads to an increasing number of small free partitions separated by allocated partitions. INFO 225: Chapter 11

  43. Contiguous memory allocation: A new process requiring4 MB of memory cannot be loaded unless memory is first compacted. INFO 225: Chapter 11

  44. Noncontiguous Memory Allocation • Portions of a process can be allocated to free partitions anywhere in memory • Uses small fixed-sized partitions • More flexible than contiguous memory allocation, but requires more complex partition tables and address calculations INFO 225: Chapter 11

  45. Noncontiguous memory allocation: A new process requiring 4 MB of memory can be divided and loaded into the four free partitions. INFO 225: Chapter 11

  46. Virtual Memory Management • Allocates portions of processes (pages) to small memory partitions (page frames) • Swaps pages between memory and secondary storage as needed • Page hits, page faults, page tables • Page files and victims INFO 225: Chapter 11

  47. INFO 225: Chapter 11

  48. Memory Protection • Prevents errors in one program from generating errors in another • Adds overhead to each write operation INFO 225: Chapter 11

  49. Memory Management Hardware • Complex memory management procedures incur substantial overhead • Modern CPUs incorporate advanced memory allocation and address resolution functions in hardware (e.g., Intel Pentium) INFO 225: Chapter 11

  50. Summary • Operating system overview • Resource allocation • Process management • CPU allocation • Memory allocation INFO 225: Chapter 11

More Related