Dynamic scheduling

from Wikipedia, the free encyclopedia

Dynamic scheduling referred to in the production technology , the order formation (flowchart Schedule ) of pending jobs with a newly customized mapping of individual resources ( dispatching ). Such continuous adaptation focuses primarily on feedback from the process ( feedback ) and the actual management of production resources so that certain criteria are met, such as

In computer science, dynamic scheduling refers to hardware-supported processes or algorithms of the computer architecture in order to optimally utilize the existing functional units of a processor and allow them to work in parallel.

Above all, this means that pending instructions are triggered as early as possible, since the various functional units require a different number of process cycles. In doing so, these algorithms must take into account the need for operating resources , data dependencies and the effective control flow.

Since the methods presented are single-issue problems, one can not speak of superscalar techniques.

Dynamic scheduling procedures

  1. Scoreboarding
  2. Tomasulo algorithm