multi-level scheduling queue

Assignment 2 OS Fall 2001 Multi-level scheduling queue. Write in C You are to simulate scheduling jobs in a multi-level queue system. There are 5 queues corresponding to the different priorities of the jobs. (A priority of 1 is the highest priority, 5 is the lowest.) There are 15 jobs, with the following running times and priorities. job number 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 times 6 4 8 3 8 2 4 8 7 6 3 7 3 4 7 priorities 1 3 1 2 4 3 5 4 1 4 1 3 2 4 1 There are 6 processors and a job can be scheduled in any one of the processors. There is an internal clock. A scheduled job (process) is given 3 time quantums, at which time the job is given a lower priority and moved to the end of the queue for the new priority. The information that you will probably want to keep will be: int process_number int total_time_required int time_to_finish int slice_remaining int priority Suggested logic of the program Get the data and build the priority queues start the first group running display the queues; display the running processes repeat increment 1 time slice while a process is done or the time quantum has expired remove the process from the running state decrease the priority of the process insert the process into the new wait queue (on the end) Remove a process form the highest queue with a process waiting start running the process end while display the running processes display the queues until all_queues_empty; while someone is processing do_one_time_slice; kill any processes whose time has expired display the running processes; end while I do have the corrected output, I will send it to you once i accept yr bid

## Deliverables

Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.

## Deadline information

Sun 11/25/01

Pengaturcaraan C Kejuruteraan MySQL PHP Kejuruteraan Perisian Ujian Perisian

ID Projek: #2832261

Tentang projek