Lesson 6 Processor Management
Download as DOC, PDF•1 like•609 views
The document discusses processor management in operating systems. It explains that operating systems must ensure each process receives enough processor time while using processor cycles efficiently. A process is a unit of software that can be controlled by the user, other applications, or the operating system. In single-tasking systems, the operating system allows one application to run at a time, suspending it for interrupts. In multi-tasking systems, the operating system rapidly switches between processes to give the appearance they are running simultaneously. It does this by allocating CPU time to each process and saving/loading their register, stack, and queue states.
Lesson 6 Processor Management
- 1. MODULE IN ITE229 - OPERATING SYSTEMS 12 Prepared by: For-Ian V. Sandoval LESSON 6 PROCESSOR MANAGEMENT The heart of managing the processor comes down to two related issues: • Ensuring that each process and application receives enough of the processor's time to function properly • Using as many processor cycles as possible for real work The basic unit of software that the operating system deals with in scheduling the work done by the processor is either a process or a thread, depending on the operating system. It's tempting to think of a process as an application, but that gives an incomplete picture of how processes relate to the operating system and hardware. The application you see (word processor, spreadsheet or game) is, indeed, a process, but that application may cause several other processes to begin, for tasks like communications with other devices or other computers. There are also numerous processes that run without giving you direct evidence that they ever exist. For example, Windows XP and UNIX can have dozens of background processes running to handle the network, memory management, disk management, virus checks and so on. A process, then, is software that performs some action and can be controlled -- by a user, by other applications or by the operating system. It is processes, rather than applications, that the operating system controls and schedules for execution by the CPU. In a single-tasking system, the schedule is straightforward. The operating system allows the application to begin running, suspending the execution only long enough to deal with interrupts and user input. Interrupts are special signals sent by hardware or software to the CPU. It's as if some part of the computer suddenly raised its hand to ask for the CPU's attention in a lively meeting. Sometimes the operating system will schedule the priority of processes so that interrupts are masked -- that is, the operating system will ignore the interrupts from some sources so that a particular job can be finished as quickly as possible. There are some interrupts (such as those from error conditions or problems with memory)
- 2. MODULE IN ITE229 - OPERATING SYSTEMS 13 Prepared by: For-Ian V. Sandoval that are so important that they can't be ignored. These non-maskable interrupts (NMIs) must be dealt with immediately, regardless of the other tasks at hand. While interrupts add some complication to the execution of processes in a single-tasking system, the job of the operating system becomes much more complicated in a multi-tasking system. Now, the operating system must arrange the execution of applications so that you believe that there are several things happening at once. This is complicated because the CPU can only do one thing at a time. Today's multi-core processors and multi-processor machines can handle more work, but each processor core is still capable of managing one task at a time. In order to give the appearance of lots of things happening at the same time, the operating system has to switch between different processes thousands of times a second. Here's how it happens: • A process occupies a certain amount of RAM. It also makes use of registers, stacks and queues within the CPU and operating-system memory space. • When two processes are multi-tasking, the operating system allots a certain number of CPU execution cycles to one program. • After that number of cycles, the operating system makes copies of all the registers, stacks and queues used by the processes, and notes the point at which the process paused in its execution. • It then loads all the registers, stacks and queues used by the second process and allows it a certain number of CPU cycles. • When those are complete, it makes copies of all the registers, stacks and queues used by the second program, and loads the first program