I need a programmer for process scheduling algorithms in C++

Process scheduling algorithms

This assignment will give you experience with process scheduling algorithms. Write a C

or C++ program that performs runs of the following process scheduling algorithms:

Shortest remaining time (SRT) [preemptive]

Round robin (RR) [preemptive]

Run each scheduling algorithm for 100 quanta (time slices), labeled 0 through 99. Before

each run of an algorithm, create 20 simulated processes. Each simulated process is

simply a small data structure that stores information about the process that it represents.

For each simulated process, randomly generate:

• An arrival time: a float value from quanta 0 through 99.

• An expected total run time: a float value from 0.1 through 10 quanta.

• A priority: integer 1, 2, 3, or 4 (1 is highest)

• Include any other attributes that you may need.

Tip: While debugging your program, you may want the same pseudo-random numbers

each time. For this to happen, you should set the seed of the random number generator

to a value, such as 0. Read about the rand() and srand() functions for C and C++:

• [login to view URL]

• [login to view URL]

Assume only one CPU and one ready queue. Sort the simulated processes in the ready

queue by arrival time. Your process scheduler can do process switching only at the start

of each time quantum. For this assignment, only consider CPU time for each process

(no I/O wait times, no process switching overhead).

For RR, use a time slice of 1 quantum.

Each simulation run should last until the completion of the last process, even if it goes

beyond 100 quanta. No process should get the CPU for the first time after time quantum

99.

Run each algorithm 5 times to get averages for the statistics below. Before each run,

clear the process queue and create a new set of simulated processes.

Outputs for each algorithm run (total 30 runs)

Your output should include:

• The sorted contents of the ready queue before the start of the run.

-Each created process’s name (such as A, B, C, ...), arrival time,

expected run time, and priority.

• A timeline of the 100+ quanta that shows which process ran during each

quantum, such as ABCDABCD ...

-Show a process’s name in a quantum even if it completed execution

before the end of that quantum.

-The CPU can be idle during the last part of a quantum if a process

completes before the end of the quantum. (No need to show the idle time

within a quantum.)

-Show a hyphen - if a quantum is completely unused.

• Calculated statistics for each algorithm run:

-Average turnaround time for the processes that ran.

-Average waiting time for the processes that ran.

-How many processes in the ready queue that never ran.

-Throughput of the algorithm per 100 quanta:

?????? ?? ????????? ????????? × 100 ??????

????? ?????? ?? ???????? ?ℎ? ?????????

Programare C++ Ubuntu Algoritm

ID Proiect: #29386242

Detalii despre proiect