Scheduling algorithms for real-time computing systems admitting simulation models

Костенко, В. А.

doi:10.1134/s0361768813050034

Cited by 13 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The constraints on the time of schedule execution and the reliability requirements on the computer system must be observed at that [8]. The reader is referred to [8][9][10] for detailed description and substantiation of building the annealing simulation algorithms to solve the problems of building the multiprocessor schedules.…”

Section: Annealing Simulation Algorithm To Build the Multiprocessor Smentioning

confidence: 99%

Simulated annealing algorithm in problems of multiprocessor scheduling

Zorin

Костенко

2014

Autom Remote Control

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Annealing Simulation Algorithm To Build the Multiprocessor Smentioning

confidence: 99%

Simulated annealing algorithm in problems of multiprocessor scheduling

Zorin

Костенко

2014

Autom Remote Control

Self Cite

View full text Add to dashboard Cite

show abstract

“…Problems of scheduling in real time systems [5][6][7][8][9][10] are viewed as the closest problems in terms of the assured compliance with the SLA. In these problems, the constraints placed on the feasible time of exe cuting applied programs or program processes are used as the SLA criteria that cannot be violated.…”

Section: Introductionmentioning

confidence: 99%

Algorithm for resource allocation in data centers with independent schedulers for different types of resources

Vdovin

Костенко

2014

J. Comput. Syst. Sci. Int.

Self Cite

View full text Add to dashboard Cite

An algorithm for assigning requests to physical recourses for data centers with independent schedulers for different types of resources (computational resources, network resources, and data stor ages) is considered. This algorithm is based on the combination of greedy and limited search strategies. The algorithm provides a required balance between the computational complexity and quality of assignments by limiting the maximum allowed search depth. Theoretical and experimental results of investigating its features are presented.

show abstract

“…Задачи, связанные с календарным планированием [1][2][3][4][5], могут быть эффективно решены с исполь-зованием методов исследования операций, что позволяет сократить сроки выполнения заказов, повысить плотность загрузки оборудования, а также оперативность составления и корректирования планов. Вслед-ствие больших объемов раскраиваемого сырья на предприятии сокращение непроизводственных просто-ев даже на 3-4% является актуальной и востребованной задачей.…”

Section: Introductionunclassified

Genetic algorithm application for multi-criteria scheduling problem

Архипов¹

2015

Naučno-teh. vestn. inf. tehnol. meh. opt.

View full text Add to dashboard Cite

Scheduling algorithms for real-time computing systems admitting simulation models

Cited by 13 publications

References 10 publications

Simulated annealing algorithm in problems of multiprocessor scheduling

Simulated annealing algorithm in problems of multiprocessor scheduling

Algorithm for resource allocation in data centers with independent schedulers for different types of resources

Genetic algorithm application for multi-criteria scheduling problem

Contact Info

Product

Resources

About