Myopic Offline Scheduling Algorithm

Myopic Offline Scheduling is a multiprocessor Scheduling Algorithm
  • This algorithm is meant for non preemptive tasks
  • Since it is an offline scheduling algorithm, release time, deadline and execution time are known apriori.
  • It proceeds like building up a schedule tree
  • Every level should be checked for feasibility. If not strongly feasible, then backtrack. If strongly feasible, then proceeds the next level until all the tasks are scheduled.
Heuristics are based on
  1. Deadline (Di)
  2. Earliest Start Time
  3. Laxity (Di-ei)
  4. weighted sum of any of the above
For example if the heuristics H(i) = Di, then the schedule is carried out based on the tasks with earlier deadline

Comments

  1. kanwarjit singh30 May 2010 at 21:49

    plz.....explain it with an exp....there is not support for the answer...n the given answer ....that to is given in tata-mcgrawhill's edition of rts

    ReplyDelete
  2. plz explain with the example.. so that it will very easy to understand

    ReplyDelete

Post a Comment

Popular Posts