Machine-translated by Google. Questions are authored in English.
Top

Discussion

What happens when a schedule proves infeasible for a given plan?

  • A.The problem is declared to have no solution at all
  • B.The planner is asked for a different plan
  • C.The schedule is accepted with the violations recorded
  • D.The resource limits are relaxed until it becomes feasible

Answer: B

Feedback from the scheduler to the planner, requesting a plan avoiding the bottleneck, is the standard arrangement, and the loop repeats until a feasible pair is found. Accepting violations and relaxing limits change the problem, and declaring insolubility is premature. An architecture in which two components negotiate, rather than one simply consuming the other's output, is what makes decomposition workable when the parts are not truly independent.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.