Abstract
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 storages) 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.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
P. M. Vdovin, I. A. Zotov, V. A. Kostenko, A. V. Plakunov, R. L. Smelyansky, “Data center resource allocation problem and approaches to its solution,” in VII Moscow Int. Conf. on Operations Research (ORM2013) (Vychisl. Tsentr Ross. Akad. Nauk, Moscow, 2013), Vol. 2, pp. 30–32.
P. M. Vdovin, I. A. Zotov, V. A. Kostenko, A. V. Plakunov, and R. l. Smelyanskiy, “Comparing various approaches to resource allocation in data centers,” J. Comput. Syst. Sci. Int. 53 (2014).
A. Amies, H. Sluiman, Q. G. Tong, et al., Developing and Hosting Applications on the Cloud (IBM Press, Boston, 2012).
E. Wustenhoff, “Service level agreement in the data center” (Sun BluePrints, Sun Microsystems Professional Series, 2002).
M. G. Furugyan, “Some algorithms for analysis and synthesis of real-time multiprocessor computing systems,” Program. Comput. Software 40, 21–27 (2014).
M. G. Furugyan “Some algorithms of solving minimax multiprocessor scheduling problem,” J. Comput. Syst. Sci. Int. 53, 195–200 (2014).
V. A. Kostenko and A. V. Plakunov, “An algorithm for constructing single machine schedules based on ant colony approach,” J. Comput. Syst. Sci. Int. 52, 928–937 (2013).
V. A. Kostenko, “Scheduling algorithms for real-time computing systems admitting simulation models,” Program. Comput. Software 39, No. 5, 255–273 (2013).
V. A. Kostenko, P. E. Shestov, “A greedy algorithm for combined scheduling of computations and data exchanges in real-time systems,” J. Comput. Syst. Sci. Int. 51, 648–662 (2012).
D. A. Zorin and V. A. Kostenko, “Algorithm for synthesis of real-time systems under reliability constraints,” J. Comput. Syst. Sci. Int. 51, 410–417.
E. G. Coffman, M. R. Garey, and D. S. Johnson, “Approximation Algorithms for Bin Packing: A Survey,” in Approximation Algorithms for NP-Hard Problems (PWS, Boston, 1996), pp. 46–93.
D. Eppstein, “Finding the k shortest paths,” SIAM J. Comput. 28, 652–673 (2006).
K. Pepple, Deploying OpenStack (O’Reilly, Sebastopol, 2011).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © P.M. Vdovin, V.A. Kostenko, 2014, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2014, No. 6, pp. 80–93.
Rights and permissions
About this article
Cite this article
Vdovin, P.M., Kostenko, V.A. Algorithm for resource allocation in data centers with independent schedulers for different types of resources. J. Comput. Syst. Sci. Int. 53, 854–866 (2014). https://doi.org/10.1134/S1064230714050141
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064230714050141