Sunday, May 22, 2011

kHaZe StUdY fOwR

A computer program that is subsequently executed is called process.  Process management is an operating system's way of dealing with running multiple processes on a single CPU. In a multitasking computer system, processes may occupy a variety of states.  On the diagram above, we can see that there is no transition from the ready to waiting same with waiting to running. In the ready state to waiting state, there is no transition between them because you can only send the job in the waiting state if it came from the running state. Also, it will proceed to the waiting state if there are some interrupts and if it needs input/output request. In the waiting state to running state, there is also no transition because the process scheduler selects processes from the ready state for the CPU. Also, all jobs in the waiting list was arranged and prepared to proceed in the ready state.  In addition, only the ready jobs or only the jobs in the ready state will proceed to the running state to be run and to bypass the ready state would make process management impossible.

 There is no transition from the ready to waiting state is because in the ready state is ready in all aspects to make effective use of the CPU while in the waiting  state is waiting for peripheral device response which must be received before the CPU can effectively be used again. If a job in the ready state cannot proceed because a required device fails, it should be sent back to the HOLD state, not the waiting state.

kHaZe StUdY tHwRi




kHaZe StUdY tOo

In the early days of computing, CPU time was expensive, and peripherals were very slow. When the computer ran a program that needed access to a peripheral, the CPU would have to stop executing program instructions while the peripheral processed the data. This was deemed very inefficient. The first computer using a multitasking system was the British Leo III owned by J. Lyons and Co.. Several different programs in batch were loaded in the computer memory, and the first one began to run. When the first program reached an instruction waiting for a peripheral, the context of this program was stored away, and the second program in memory was given a chance to run. The process continued until all programs finished running.
Multiprogramming doesn't give any guarantee that a program will run in a timely manner. Indeed, the very first program may very well run for hours without needing access to a peripheral. As there were no users waiting at an interactive terminal, this was no problem: users handed on a deck of punched cards to an operator, and came back a few hours later for printed results. Multiprogramming greatly reduced wait times when multiple batches were being processed.

- Wikipedia -