Documente Academic
Documente Profesional
Documente Cultură
9. 1. active states
They are those that compete with the processor or are able to do so. They are divided into:
-Execution
-Prepared
-Blocked
102. inactive states
Those who can not compete for the processor, but may do so again through certain operations
11They are of two types:
-Locked suspended: The process that was suspended pending an event, without having disappeared the causes of their blockade.
-scheduled Suspended: The process that have been suspended but has no cause to be locked split
12TRANSITIONS
A process can be in running state, locked or ready (also called executable). Of these states of processes and states the following
transitions are derived:
13.. The transition from one state to another.
1. The process is blocked at the entrance.
2. The scheduler chooses another process.
3. The scheduler chooses the process.
4. The entry becomes available.
14.In conclusion the systems that manage processes must be able to perform certain processes and operations with them. Such
operations include:
15-Create a process.-Destroying a process.-Suspend a process.-Resuming a process.-Changing the priority of a process.
-Block a process.-Awakening process.
The processes are dispatched in FIFO, but are given a limited amount of CPU time called time
division (time - slice) or as (quantum).
7
Round robin scheme is effective in a timeshare environment in which the system needs to
guarantee a reasonable time for interactive users response.
8.
Determining the size of the quantum is critical to the effective operation of a computer system
The questions are: how small or big ?
9.
Multi-level Queves
The schemes discussed so far assume that all runnable processes are in main memory.
-If the main memory is insufficient, the following will occur
-There will remain runnable processes that disk.