C++ Priority Queue Scheduler

[operatingsystem]

I need to generate such scheduler in operating system subject which satisfy below conditions...ma y i request u if anybody knows abt this plz help me out in this..topics..


Scheduler specifications:
1. Three queues, highest priority to lowest:
RR
SJF
FIFO
2. All jobs enter RR
3. Job at lower queue cannot execute until higher priority queue is empty
4. After doing I/O, the job returns to the same queue where it was suspended


Input file (parameters):
1. RR timeslot
2. bump down criteria (time spent running since entering queue),
separately for for RR and SJF
3. aging criteria (time spent waiting since entering queue), SJF and FIFO
4. preemptive/nonpreemptive SJF
5. initial estimate for SJF
6. I/O queue - FIFO
7. Jobs:
- arrival time
- number of CPU burst, I/O burst cycles
- avg CPU burst, avg I/O burst value
- %how much fluctuates up and down (one cycle up, the next down)

Find:
- avg CPU utilization
- avg turnaround time
- max response time
- max waiting time
- full report at each time event - process entering/exited, process state,
time ran&waited in the queue, time ran&waited total,
bumpups and bumpdowns

[RRick]

If you need to know what RR, SJF, and FIFOs are, then try googling on them. You'll get some answers quickly for these topics. If you need some information on a particular topic (i.e. What's the difference between preemptive and non-preemptive SJF) then ask the question.

As for generating a scheduler, you're going to have to limit the topic a bit. Is this a program you have to write? If so, do you have to create/supply some type of simulation for adding tasks to the scheduler, watching the system time, etc.?

What have you done so far?