CPU Scheduling in Data Centers Using Asynchronous Finite-Time Distributed Coordination Mechanisms

Loading...
Thumbnail Image
Access rights
openAccess
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
Date
2023-07-01
Major/Subject
Mcode
Degree programme
Language
en
Pages
15
1880-1894
Series
IEEE Transactions on Network Science and Engineering, Volume 10, issue 4
Abstract
We propose an asynchronous iterative scheme that allows a set of interconnected nodes to distributively reach an agreement within a pre-specified bound in a finite number of steps. While this scheme could be adopted in a wide variety of applications, we discuss it within the context of task scheduling for data centers. In this context, the algorithm is guaranteed to approximately converge to the optimal scheduling plan, given the available resources, in a finite number of steps. Furthermore, by being asynchronous, the proposed scheme is able to take into account the uncertainty that can be introduced from straggler nodes or communication issues in the form of latency variability while still converging to the target objective. In addition, by using extensive empirical evaluation through simulations we show that the proposed method exhibits state-of-the-art performance.
Description
Publisher Copyright: © 2013 IEEE.
Keywords
CPU, distributed coordination, finite-time termination, optimization, ratio consensus, scheduling
Other note
Citation
Grammenos, A, Charalambous, T & Kalyvianaki, E 2023, ' CPU Scheduling in Data Centers Using Asynchronous Finite-Time Distributed Coordination Mechanisms ', IEEE Transactions on Network Science and Engineering, vol. 10, no. 4, pp. 1880-1894 . https://doi.org/10.1109/TNSE.2023.3236214