Consider a system with 32 MB of physical memory, with the resident portion of the operating...

Transcribed Image Text:

Consider a system with 32 MB of physical memory, with the resident portion of the operating system of 6 MB. Assumptions: • The execution of each process is composed of a CPU time followed by a request for I/O. • • • • The processes are not waiting for their I/O. A loaded process will stay until in the memory the end of its execution. Fixed partitions with sizes 8 MB, 4 MB, 8 MB, 6 MB and 6 MB (for the Operating system). The allocation mode uses the algorithm (Best Fit) The high-level queue (HLQ) which corresponds to the queue for loading into memory operates on FCF (First Come First Serve) • The Low-level queue (LLQ) which corresponds to the queue to the ready state operates on LIFO (Last In First Out) The following table gives an example of task sequences for the system: Instant t Process CPU Time 0 2 3 4 6 7 8 MB (Partition 1) 4 MB (Partition 2) 8 MB (Partition 3) 6 MB (Partition 4) 6(05) HLQ LLQ 8 MB (Partition 1) 4 MB (Partition 2) 8 MB (Partition 3) 6 MB (Partition 4) 6(OS) HLQ LLQ 8 MB (Partition 1) 4 MB (Partition 2) 8 MB (Partition 3) 6 MB (Partition 4) 6(OS) HLQ LLQ Process A B C 8 MB D 7 MB 3 two E F (OS) t=0 Give the states of memory occupation at different stages of the processing of these processes. You have to present the status of HLQ and LLQ (05) t=0 5 6 (OS) Size MB MB 5 MB MB (OS) (OS) (OS) 4 5 2 3 Releases CPU at t 4 6 1/0 duration 3 Ms Ms 4 Ms 3 Ms Ms Ms (OS) (Os) 2 3 4 (OS) Releases memory at t (OS) Subject: OS-I (OS) ms ms ms ms (OS) ms ms (OS) (OS) (OS) Consider a system with 32 MB of physical memory, with the resident portion of the operating system of 6 MB. Assumptions: • The execution of each process is composed of a CPU time followed by a request for I/O. • • • • The processes are not waiting for their I/O. A loaded process will stay until in the memory the end of its execution. Fixed partitions with sizes 8 MB, 4 MB, 8 MB, 6 MB and 6 MB (for the Operating system). The allocation mode uses the algorithm (Best Fit) The high-level queue (HLQ) which corresponds to the queue for loading into memory operates on FCF (First Come First Serve) • The Low-level queue (LLQ) which corresponds to the queue to the ready state operates on LIFO (Last In First Out) The following table gives an example of task sequences for the system: Instant t Process CPU Time 0 2 3 4 6 7 8 MB (Partition 1) 4 MB (Partition 2) 8 MB (Partition 3) 6 MB (Partition 4) 6(05) HLQ LLQ 8 MB (Partition 1) 4 MB (Partition 2) 8 MB (Partition 3) 6 MB (Partition 4) 6(OS) HLQ LLQ 8 MB (Partition 1) 4 MB (Partition 2) 8 MB (Partition 3) 6 MB (Partition 4) 6(OS) HLQ LLQ Process A B C 8 MB D 7 MB 3 two E F (OS) t=0 Give the states of memory occupation at different stages of the processing of these processes. You have to present the status of HLQ and LLQ (05) t=0 5 6 (OS) Size MB MB 5 MB MB (OS) (OS) (OS) 4 5 2 3 Releases CPU at t 4 6 1/0 duration 3 Ms Ms 4 Ms 3 Ms Ms Ms (OS) (Os) 2 3 4 (OS) Releases memory at t (OS) Subject: OS-I (OS) ms ms ms ms (OS) ms ms (OS) (OS) (OS)