Scheduling in Multiprocessor Systems with Additional Restrictionsстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 10 августа 2018 г.
Аннотация:An admissible multiprocessor preemptive scheduling problem is solved for the given execution
intervals. In addition, a number of generalizations are considered — interprocessor communications are arbitrary and may vary in time; costs for processing interruptions and switches from one processor to another are taken into account; and besides the processors, additional resources are used. Algorithms based on reducing the original problem to finding paths of a specific length in a graph, a flow problem, and an integer system of linear restrictions are developed.