Relative Content

Tag Archive for scheduling

Multilevel Queue Scheduling (MQS) with Round Robin

I’m trying to use MQS to create a Gantt chart of 5 processes (P1-P5) as well as their waiting, response, and turnaround times (and averages of those metrics) within a CPU task schedule. Here’s the basic table of arrival times and bursts:

Could we set priorities only relative to each other instead of fixed numbers?

AFAIK the lowest priority has the highest number in scheduling and in my system all priorities must be different. But isn’t other policies thinkable? For instance, how about a policy where priorities are not numbers but say that a task’s priority would be defined only in term of another task’s priority, and that other task would be the closest in priority to the task whose priority we are setting. Then we would never use actual numbers for priorities, but we would keep a data structure sorting the tasks in priorities and when a task comes as new or is getting a different priority assigned, then this structure is rebalanced. Would this priority mechanism be feasible or do you not agree that it’s a working idea?

Could we set priorities only relative to each other instead of fixed numbers?

AFAIK the lowest priority has the highest number in scheduling and in my system all priorities must be different. But isn’t other policies thinkable? For instance, how about a policy where priorities are not numbers but say that a task’s priority would be defined only in term of another task’s priority, and that other task would be the closest in priority to the task whose priority we are setting. Then we would never use actual numbers for priorities, but we would keep a data structure sorting the tasks in priorities and when a task comes as new or is getting a different priority assigned, then this structure is rebalanced. Would this priority mechanism be feasible or do you not agree that it’s a working idea?

Could we set priorities only relative to each other instead of fixed numbers?

AFAIK the lowest priority has the highest number in scheduling and in my system all priorities must be different. But isn’t other policies thinkable? For instance, how about a policy where priorities are not numbers but say that a task’s priority would be defined only in term of another task’s priority, and that other task would be the closest in priority to the task whose priority we are setting. Then we would never use actual numbers for priorities, but we would keep a data structure sorting the tasks in priorities and when a task comes as new or is getting a different priority assigned, then this structure is rebalanced. Would this priority mechanism be feasible or do you not agree that it’s a working idea?

Algorithm to find times when resources are available

I’m writing a semi-automatic scheduling application. Given some existing bookings and some resource requirements, it needs to find the times at which a new event can be scheduled. A human user will then evaluate the results and choose one of the options. It does not need to optimise a timetable for multiple events and hence it is not the usual NP-Hard timetabling problem.