I am doing a project about job scheduling and i need to see an example on it so i can move on cause i am stuck.
So what i need is a program where new jobs arrive based on the poisson distribution ( i already have made a code that generates values given an L. I can provide this though it is simple)
Then they are inserted in a queue (which is updated with bublesort if its the SJF case everytime a new asignment arrives) and all of them also have a specified execution time(assigned with normal distribution)
Then the simulation begins with a fixed number of jobs to arrive and finishing giving as output the total execution time for each algorithm(FiFo and SJF),average execution time of the jobs (in loops , not in system time)
Important: This has to be as simple as possible , without using any too fancy commands/headers like std::tr1::poisson_distribution poisson(7.0);
I want this so i can understand how the program structure will be , so i can later create one on my own. Help explaining part of the code may be needed at the end. No deadline but the sooner it is ready the better