CPU scheduling
$10-20 USD
Pagado a la entrega
You are to read a file describing n processes (i.e., n triples of numbers) and then simulate the n processes until they all terminate. The way to do this is to keep track of the state of each process and advance time making any state transitions needed. At the end of the run you should first print an identification of the run including the scheduling algorithm used, any parameters , and the number of processes simulated. You should then print for each process
• (A,B,C,M)
• Finishing time.
• Turnaround time
• I/O time
• Waiting time
Then print the following summary data.
• Finishing time
• CPU Utilization
• I/O Utilization
• Throughput, expressed in processes completed per hundred time units.
• Average turnaround time.
• Average waiting time.
You should simulate each of the following scheduling algorithms, assuming, for simplicity, that a context switch takes zero time. You need only do calculations every time unit.
• FCFS.
• RR with quantum 2.
• Uniprogrammed. Just one process active. When it is blocked, the system waits.
• SJF (This is not preemptive, but is not run to completion, i.e. switch on I/O bursts).
Nº del proyecto: #8758135
Sobre el proyecto
Adjudicado a:
can complete this task within 1-2 hours.........................................................................
5 freelancers están ofertando un promedio de $91 por este trabajo
I am an expert in this field from long time. I can do it perfectly. I’ll be waiting for your positive reply thanks.
Hi Sir, I am experienced developer. I can do your project easily. Contact me so we can move forward. I am waiting for your quick response. Regards Qasim Saleem
I had the same project and i seem to have the codes with me So i can deliver you pretty fast........