Scribd
Upload
13 views2 pages

Tutorial 1

The document outlines a tutorial for second-year Computer Engineering students at USTHB, focusing on process execution mechanisms. It includes two exercises that require students to analyze the execution timelines and calculate response and waiting times for processes under different scheduling models. The exercises involve scenarios with multiple processes, CPU and I/O time units, and control tasks, emphasizing the application of FCFS scheduling and time-sharing principles.

Uploaded by

chaukemartin1301
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views2 pages

Tutorial 1

The document outlines a tutorial for second-year Computer Engineering students at USTHB, focusing on process execution mechanisms. It includes two exercises that require students to analyze the execution timelines and calculate response and waiting times for processes under different scheduling models. The exercises involve scenarios with multiple processes, CPU and I/O time units, and control tasks, emphasizing the application of FCFS scheduling and time-sharing principles.

Uploaded by

chaukemartin1301
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

USTHB 2025-2026

Computer Science Faculty ISE2


SIQ Departement 2nd Year of Computer Ingineering

Turotial N° 1 Process execution mechanisms

Exercise 1
We consider 3 processes in a single processor configuration :
A B C
3CPU TU 1 CPU TU 3 CPU TU
3 I/O TU 4 I/O TU 1 I/O TU
1 CPU TU 4 CPU TU

Assumptions:
• All processes arrive at time 0 TU in the order A, B, C
• Only one queue for I/O operations
• CPU scheduling policy is FCFS (First Come First Served)
• Quantum=2 TU for time-sharing model
• Control tasks are not considered

1. Provide the execution timeline of these processes in the following models :


monoprograming, multiprograming, and time-sharing
2. Calculate the response RT time and the waiting time WT for each process.
3. Redo question 1 and 2 assuming that system control tasks are considered and knowing
that :
• Control task handling time= 1 TU
• 5 control tasks are handled and ordered by proiority: program arrival (Ar), End of
quantum (Q), End of I/O (E i/o), I/O request (R i/o), End of program (T).
o For monoprogramming : program arrival (Ar), I/O request (R i/o), End of
program (T).
o For multiprogramming : program arrival (Ar), End of I/O (E i/o), I/O request
(R i/o), End of program (T).
o For Time-sharing : program arrival (Ar), End of quantum (Q), End of I/O (E
i/o), I/O request (R i/o), End of program (T).

Exercise 2
We consider 3 processes in a single processor configuration :
A B C
5 CPU time units 2 I/O time unit 7 CPU time units
3 I/O time units 7 CPU time units 5 I/O time unit
4 CPU time units 1 CPU time units

Assumptions:
• A and B arrive at time 0 ms in the order A,B while C arrives at time 4 ms
• Only one queue for I/O operations
• CPU scheduling policy is FCFS (First Come First Served)
• Quantum=3 TU for time-sharing model

1/2
• 5 control tasks are handled and ordered by proiority: program arrival (Ar), End of
quantum (Q), End of I/O (E i/o), I/O request (R i/o), End of program (T).
1. Provide the execution timeline of these processes in the following models :
monoprograming, multiprograming, and time-sharing
2. Calculate the response RT time and the waiting time WT for each process.

2/2

You might also like