$($Uniprogramming$,$ Job queue, Multiprogramming$)$

Part $1$

Introduction

The problems of servicing the processes with or not priority for uniprocessor system is examined

Problem status

$-$ The processes are arrived in a list $($or a queue$)$ and serviced in FCES and PS $($priority service$)$ from a CPU.

$-$ Four processes are inserted in a list $($or queue$)$ and compose the set of processes that wait in the ready queue. Each process will have $($as input$)$: pid, arrival time, service time.

$-$ Two services disciplines are considered : the FCFS and the priority service. For the last one each process has a priority and their service order depends on their priority.

Input

Four processes are considered.

Each process will have $($as input$)$: pid, arrival time, service time:

$-$pids:$10,20,30,40($for FCFS$)$ for PS the order of service must be taken from table priority.

$-$the arrival times: $\backslash ([\backslash$mathrm$\{$AR$\}1,\backslash$mathrm$\{$AR$\}2,\backslash$mathrm$\{$AR$\}3,\backslash$mathrm$\{$AR$\}4]=[1\mathrm{.}0,2\mathrm{.}0,4\mathrm{.}0,6\mathrm{.}0]\backslash )$

$-$the service times: $[$ST$1,$ ST$2,$ST$3,$ST$4=[1\mathrm{.}3,0\mathrm{.}4,1\mathrm{.}5,0\mathrm{.}8]$

The priority is given by: $\backslash (1,2,3,4\backslash )$ and the table of priorities for each process is:

Output

$-$ Please find the waiting time for each process $($or job$)$ in the queue, and the total time to finish the service of the processes for the FCFS and Priority service $($PS$)$

$-$ a list or queue of the processes.

$-$ insert the values of the pids.

$-$ use of a timer $($fi$.$ increase by $1)$ and start the service of the processes.

$-$ find the total time that the four processes will be serviced for the uniprocessor case

Hint:

$-$ you have to create two $\backslash (\backslash$mathrm$\{$C$\}/\backslash$mathrm$\{$C$\}++\backslash )$ program$($s$)$ using liked lists or queues one for FCES, and the other for PS

$-$ The PS program must create the process queue according to the priority for every input order of the processes.

$-$ compare and add the time in order.to find the wait or idle time

$-$ a new process starts the service after the end of the previous one

$-$ the table with the results can be displayed or be saved in an output file.

$-$ you can delete the nodes $($process$)$ after servicing $1$ by $1$ or all together.