scheduling

This is a simulation/analysis for process scheduling. The purpose is to measure the effects of various scheduling algorithms on different "mixes" of jobs. **Scope:** The mixes of jobs to be considered are as follows: 1. many jobs of shorter duration (100 jobs) 2. fewer jobs of longer duration (30 jobs) The scheduling algorithms to be used are a) FCFS, b) SJF, c) RR (q= 4) Assume that 6 jobs may reside in the ready queue at one time Six separate sets of analysis need to be taken into account during the simulation, namely, 1a) 1b) 1c) 2a) 2b) 2c) For each set, note the following: i) average waiting time ii) average turnaround time iii) average throughput iiii)cpu utilization Jobs (job number and their associated burst times) may be generated using a random number generator ex output for short job(30 jobs) avg waitime avg turnaround throughtput cpu utilization 15 20 12 Low ex output for longer job(100 jobs) avg waitime avg turnaround throughtput cpu utilization 15 20 12 Low Note: the program should be written in c ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site). ## Platform window xp