Simulated annealing algorithm in problems of multiprocessor scheduling

An algorithm was proposed to simulate annealing for determination of the minimal necessary number of processors and construction of the static schedule for execution of the applied programs with allowance for the constraints on the time of schedule execution and reliability requirements. The developed algorithm was substantiated both theoretically and experimentally by comparing different laws of temperature decrease in the annealing simulation algorithm.

Presented by the member of Editorial Board: A. A. Lazarev