Some algorithms of solving minimax multiprocessor scheduling problem

Furugyan, M. G.

doi:10.1134/s1064230714020087

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

2020

Publication Types

Select...

Other2

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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.

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