For example,Бобцов

SCHEDULING SETS OF COMPOSITE APPLICATIONS WITH SOFT DEADLINES IN TIME WINDOWS OF HETEROGENEOUS COMPUTING ENVIRONMENTS

Annotation

The loading performance of heterogeneous computing resources under user deadline requirements to results of calculation necessitates the use of specialized planning algorithms of the tasks execution. Such algorithms should consider both the specifics of the distributed environment (the level of utilization, types of resources) and possible data relationship between parts of the design scenario. The proposed algorithms implement per-task, phasic and clusterization approaches to planning sets of composite applications with a soft deadline requirements in conditions of partial availability of computing resources. Comparative efficiency of the developed algorithms for scheduling sets of the composite applications on heterogeneous resources is investigated. Presented experimental results demonstrate that: a) the use of information about the availability of resources and the tasks completion timing can significantly improve the scheduling quality; b) clusterization approach is superior to stage and per-task according to integral criterion of scheduling efficiency.

Keywords

Articles in current issue