Scheduling in C UNIX enviornment

In this assignment you will write a program to compare the performance of four scheduling algorithms on a two-processor system. The scheduling algorithms to compare are: FCFS, SJN, Shortest Remaining Time Next, and Round Robin. The queuing discipline for the two processors will be as follows: (a) Each processor has its own queue of waiting jobs. A new job joins the shorter of the two queues. If the two queues are of the same length, then the new job can join either of the two queues. (b) There is a single queue. When the processor needs next job it picks up a job from the queue. ## 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 MUST Submit by 6:00 PM on 28th NOV 2001 Central time USA