In this paper the approach to scheduling of tasks and resources in a heterogeneous distributed system based on minimal cover method. The main provisions of the approach, the mathematical model and the comparative analysis of the effectiveness of heuristic and exact algorithms for the covering problem to solve scheduling. The results of computer experiments and comparative analysis use the developed simulation scenarios, the advantages of the proposed algorithms provided changing the model parameters for a fixed amount of resources and intensity of the task stream.
algorithm, the minimal cover, heterogeneous distributed systems, scheduling, performance
"Modelyrovanye y analyz vlyianyia osnovannыkh na metode pokrыtyia alhorytmov planyrovanyia zadanyi y raspredelenyia resursov na proyzvodytelnost heterohennыkh raspredelennыkh system" ,
Information Processing Systems,