Chapter 1: Introduction. Operating System Concepts 9 th Edit9on

Transcription

1 Chapter 1: Introduction Operating System Concepts 9 th Edit9on Silberschatz, Galvin and Gagne 2013

2 Objectives To describe the basic organization of computer systems To provide a grand tour of the major components of operating systems To give an overview of the many types of computing environments To explore several open-source operating systems 2 Silberschatz, Galvin and Gagne 2013

3 Chapter 1: Introduction 1. What Operating Systems Do 2. Computer-System Organization 3. Computer-System Architecture 4. Operating-System Structure 5. Operating-System Operations 6. Process Management 7. Memory Management 8. Storage Management 9. Protection and Security 10. Kernel Data Structures 11. Computing Environments 12. Open-Source Operating Systems 3 Silberschatz, Galvin and Gagne 2013

4 What is an Operating System? a program manages a computer s hardware provides a basis for application programs acts as an intermediary between a user of a computer and the computer hardware Operating Systems Mainframe : to optimize utilization of hardware PC : support complex games, business applications, and everything mobile computer Operating system goals: Execute user programs and make solving user problems easier Make the computer system convenient to use Use the computer hardware in an efficient manner 4 Silberschatz, Galvin and Gagne 2013

5 1.1 WHAT OPERATING SYSTEMS DO 5 Silberschatz, Galvin and Gagne 2013

6 Components of a computer system (1) 6 Silberschatz, Galvin and Gagne 2013

7 Components of a computer system (2) Computer system can be divided into four components: Hardware provides basic computing resources CPU, memory, I/O devices Operating system Controls and coordinates use of hardware among various applications and users Application programs define the ways in which the system resources are used to solve the computing problems of the users Word processors, compilers, web browsers, database systems, video games Users People, machines, other computers 7 Silberschatz, Galvin and Gagne 2013

8 1.1.1 user view Depends on the point of view PC designed for one user to monopolize its resources to maximize the work (or play) Users want convenience, ease of use and good performance Don t care about resource utilization But shared computer such as mainframe or minicomputer must keep all users happy Users of dedicate systems such as workstations have dedicated resources but frequently use shared resources from servers Handheld computers are resource poor, optimized for usability and battery life touch screen Some computers have little or no user interface, such as embedded computers in devices and automobiles 8 Silberschatz, Galvin and Gagne 2013

9 1.1.2 System View OS is a resource allocator Manages all resources Decides between conflicting requests for efficient and fair resource use OS is a control program Controls execution of programs to prevent errors and improper use of the computer 9 Silberschatz, Galvin and Gagne 2013

10 1.1.3 Defining Operating System Computers are present within toasters, cars, ships, spacecraft, homes, and businesses. They are the basis for game machines, music players, cable TV tuners, and industrial control systems. No universally accepted definition The common functions of controlling and allocating resources are then brought together into one piece of software: the operating system Everything a vendor ships when you order an operating system is a good approximation But varies wildly 10 Silberschatz, Galvin and Gagne 2013

11 1.1.3 Defining Operating System (cont.) The one program running at all times on the computer is the kernel. Everything else is either a system program (ships with the operating system), or an application program In 1998, the United States Department of Justice filed suit against Microsoft, in essence claiming that Microsoft included too much functionality in its operating systems and thus prevented application vendors from competing. Mobile operating systems the number of features constituting the operating system is increasing often include not only a core kernel but also middleware (supports database, multimedia, and graphics) 11 Silberschatz, Galvin and Gagne 2013

12 1.2 COMPUTER-SYSTEM ORGANIZATION 12 Silberschatz, Galvin and Gagne 2013

13 1.2.1 Computer-System Operation (1) A modern general-purpose computer system One or more CPUs, device controllers connect through common bus providing access to shared memory Concurrent execution of CPUs and devices competing for memory cycles 13 Silberschatz, Galvin and Gagne 2013

14 1.2.1 Computer-System Operation (2) bootstrap program is loaded at power-up or reboot Typically stored in ROM or EPROM, generally known as firmware Initializes all aspects of system Loads operating system kernel and starts execution Once the kernel is loaded and executing, it can start providing services to the system and its users. Some services are provided outside of the kernel, by system programs that are loaded into memory at boot time to become system processes, or system daemons that run the entire time the kernel is running. 14 Silberschatz, Galvin and Gagne 2013

15 1.2.1 Computer-System Operation (3) The occurrence of an event is usually signaled by an interrupt I/O devices and the CPU can execute concurrently Each device controller is in charge of a particular device type Each device controller has a local buffer CPU moves data from/to main memory to/from local buffers I/O is from the device to local buffer of controller Device controller informs CPU that it has finished its operation by causing an interrupt 15 Silberschatz, Galvin and Gagne 2013

16 1.2.1 Computer-System Operation (4) Software may trigger an interrupt by executing a special operation called a system call (also called a monitor call) Interrupt transfers control to the interrupt service routine generally, through the interrupt vector, which contains the addresses of all the service routines Interrupt architecture must save the address of the interrupted instruction A trap or exception is a software-generated interrupt caused either by an error or a user request 16 Silberschatz, Galvin and Gagne 2013

17 1.2.1 Computer-System Operation (5) An operating system is interrupt driven The operating system preserves the state of the CPU by storing registers and the program counter Determines which type of interrupt has occurred: polling vectored interrupt system Separate segments of code determine what action should be taken for each type of interrupt 17 Silberschatz, Galvin and Gagne 2013

18 1.2.1 Computer-System Operation (6) After I/O starts, control returns to user program only upon I/O completion Wait instruction idles the CPU until the next interrupt Wait loop (contention for memory access) At most one I/O request is outstanding at a time, no simultaneous I/O processing After I/O starts, control returns to user program without waiting for I/O completion System call request to the OS to allow user to wait for I/O completion Device-status table contains entry for each I/O device indicating its type, address, and state OS indexes into I/O device table to determine device status and to modify table entry to include interrupt 18 Silberschatz, Galvin and Gagne 2013

19 Storage Definitions and Notation Review The basic unit of computer storage is the bit. A bit can contain one of two values, 0 and 1. All other storage in a computer is based on collections of bits. Given enough bits, it is amazing how many things a computer can represent: numbers, letters, images, movies, sounds, documents, and programs, to name a few. A byte is 8 bits, and on most computers it is the smallest convenient chunk of storage. For example, most computers don t have an instruction to move a bit but do have one to move a byte. A less common term is word, which is a given computer architecture s native unit of data. A word is made up of one or more bytes. For example, a computer that has 64-bit registers and 64-bit memory addressing typically has 64-bit (8-byte) words. A computer executes many operations in its native word size rather than a byte at a time. Computer storage, along with most computer throughput, is generally measured and manipulated in bytes and collections of bytes. A kilobyte, or KB, is 1,024 bytes a megabyte, or MB, is 1,024 2 bytes a gigabyte, or GB, is 1,024 3 bytes a terabyte, or TB, is 1,024 4 bytes a petabyte, or PB, is 1,024 5 bytes Computer manufacturers often round off these numbers and say that a megabyte is 1 million bytes and a gigabyte is 1 billion bytes. Networking measurements are an exception to this general rule; they are given in bits (because networks move data a bit at a time). 19 Silberschatz, Galvin and Gagne 2013

20 1.2.2 Storage Structure (1) The CPU can load instructions only from memory, so any programs to run must be stored there. Main memory only large storage media that the CPU can access directly Random access Typically volatile All forms of memory provide an array of bytes. Each byte has its own address. Interaction is achieved through a sequence of load or store instructions to specific memory addresses. 20 Silberschatz, Galvin and Gagne 2013

21 1.2.2 Storage Structure (2) Von Neumann architecture first fetches an instruction from memory and stores that instruction in the instruction register The instruction is then decoded and may cause operands to be fetched from memory and stored in some internal register. After the instruction on the operands has been executed, the result may be stored back in memory 21 Silberschatz, Galvin and Gagne 2013

22 1.2.2 Storage Structure (3) Ideally, we want the programs and data to reside in main memory permanently. This arrangement usually is not possible for the following two reasons: 1. Main memory is usually too small to store all needed programs and data permanently. 2. Main memory is a volatile storage device that loses its contents when power is turned off or otherwise lost. Secondary storage extension of main memory that provides large nonvolatile storage capacity 22 Silberschatz, Galvin and Gagne 2013

23 1.2.2 Storage Structure (4) Hard disks(magnetic disk) rigid metal or glass platters covered with magnetic recording material Disk surface is logically divided into tracks, which are subdivided into sectors The disk controller determines the logical interaction between the device and the computer Solid-state disks faster than hard disks, nonvolatile Various technologies Becoming more popular 23 Silberschatz, Galvin and Gagne 2013

24 1.2.2 Storage Structure (5) Storage systems organized in hierarchy Speed Cost Volatility Caching copying information into faster storage system; main memory can be viewed as a cache for secondary storage 24 Silberschatz, Galvin and Gagne 2013

25 1.2.2 Storage Structure (6) Caching Important principle, performed at many levels in a computer (in hardware, operating system, software) Information in use copied from slower to faster storage temporarily Faster storage (cache) checked first to determine if information is there If it is, information used directly from the cache (fast) If not, data copied to cache and used there Cache smaller than storage being cached Cache management important design problem Cache size and replacement policy 25 Silberschatz, Galvin and Gagne 2013

26 1.2.3 I/O Structure Device Driver for each device controller to manage I/O Provides uniform interface between controller and kernel Direct Memory Access Structure Used for high-speed I/O devices able to transmit information at close to memory speeds Device controller transfers blocks of data from buffer storage directly to main memory without CPU intervention Only one interrupt is generated per block, rather than the one interrupt per byte 26 Silberschatz, Galvin and Gagne 2013

27 1.3 COMPUTER-SYSTEM ARCHITECTURE 27 Silberschatz, Galvin and Gagne 2013

28 How a Modern Computer Works A von Neumann architecture 28 Silberschatz, Galvin and Gagne 2013

29 1.3.1 Single-Processor Systems Most systems use a single general-purpose processor there is one main CPU capable of executing a general-purpose instruction set, including instructions from user processes. Most systems have special-purpose processors as well form of device-specific processors, such as disk, keyboard, and graphics controllers form of more general-purpose processors, such as I/O processors that move data rapidly among the components of the system All of these special-purpose processors run a limited instruction set and do not run user processes they are managed by the operating system or special-purpose processors are low-level components built into the hardware. 29 Silberschatz, Galvin and Gagne 2013

30 1.3.2 Multiprocessor Systems (1) Multiprocessors systems growing in use and importance Also known as parallel systems, tightly-coupled systems Advantages include: 1. Increased throughput 2. Economy of scale 3. Increased reliability graceful degradation or fault tolerance Two types: 1. Asymmetric Multiprocessing each processor is assigned a specie task. 2. Symmetric Multiprocessing each processor performs all tasks 30 Silberschatz, Galvin and Gagne 2013

31 1.3.2 Multiprocessor Systems (2) uniform memory access (UMA) to non-uniform memory access (NUMA) UMA : the situation in which access to any RAM from any CPU takes the same amount of time 31 Silberschatz, Galvin and Gagne 2013

32 1.3.2 Multiprocessor Systems (3) Multi-chip and multicore more efficient than multiple chips with single cores on-chip communication is faster than between-chip communication. one chip with multiple cores uses significantly less power than multiple single-core chips 32 Silberschatz, Galvin and Gagne 2013

33 1.3.2 Multiprocessor Systems (4) Blade server Multiple processor boards, I/O boards, and networking boards are placed in the same chassis each blade-processor board boots independently and runs its own operating system Some blade-server boards are multiprocessor as well 33 Silberschatz, Galvin and Gagne 2013

34 1.3.3 Clustered Systems (1) Like multiprocessor systems, but multiple systems working together Usually sharing storage via a storage-area network (SAN) Provides a high-availability service which survives failures Asymmetric clustering has one machine in hot-standby mode Symmetric clustering has multiple nodes running applications, monitoring each other 34 Silberschatz, Galvin and Gagne 2013

35 1.3.3 Clustered Systems (2) Some clusters are for high-performance computing (HPC) Applications must be written to use parallelization which divides a program into separate components that run in parallel on individual computers in the cluster. Typically, these applications are designed so that once each computing node in the cluster has solved its portion of the problem, the results from all the nodes are combined into a final solution. parallel clusters and clustering over a wide-area network (WAN) Parallel clusters allow multiple hosts to access the same data on shared storage. Because most operating systems lack support for simultaneous data access by multiple hosts, parallel clusters usually require the use of special versions of software and special releases of applications. Some have distributed lock manager (DLM) to avoid conflicting operations 35 Silberschatz, Galvin and Gagne 2013

36 1.4 OPERATING-SYSTEM STRUCTURE 36 Silberschatz, Galvin and Gagne 2013

37 Memory Layout for Multiprogrammed System 37 Silberschatz, Galvin and Gagne 2013

38 Operating System Structure (1) Multiprogramming (Batch system) needed for efficiency Single user cannot keep CPU and I/O devices busy at all times Multiprogramming organizes jobs (code and data) so CPU always has one to execute A subset of total jobs in system is kept in memory One job selected and run via job scheduling When it has to wait (for I/O for example), OS switches to another job 38 Silberschatz, Galvin and Gagne 2013

39 Operating System Structure (2) Timesharing (multitasking) is logical extension in which CPU switches jobs so frequently that users can interact with each job while it is running, creating interactive computing Response time should be < 1 second Each user has at least one program executing in memory process If several jobs ready to run at the same time CPU scheduling If processes don t fit in memory, swapping moves them in and out to run Virtual memory allows execution of processes not completely in memory 39 Silberschatz, Galvin and Gagne 2013