Optimal CPU Scheduling in Data Centers via a Finite-Time Distributed Quantized Coordination Mechanism

04/07/2021
by   Apostolos I. Rikos, et al.
0

In this paper we analyze the problem of optimal task scheduling for data centers. Given the available resources and tasks, we propose a fast distributed iterative algorithm which operates over a large scale network of nodes and allows each of the interconnected nodes to reach agreement to an optimal solution in a finite number of time steps. More specifically, the algorithm (i) is guaranteed to converge to the exact optimal scheduling plan in a finite number of time steps and, (ii) once the goal of task scheduling is achieved, it exhibits distributed stopping capabilities (i.e., it allows the nodes to distributely determine whether they can terminate the operation of the algorithm). Furthermore, the proposed algorithm operates exclusively with quantized values (i.e., the information stored, processed and exchanged between neighboring agents is subject to deterministic uniform quantization) and relies on event-driven updates (e.g., to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage). We also provide examples to illustrate the operation, performance, and potential advantages of the proposed algorithm. Finally, by using extensive empirical evaluations through simulations we show that the proposed algorithm exhibits state-of-the-art performance.

READ FULL TEXT
research
01/15/2021

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

We propose an asynchronous iterative scheme which allows a set of interc...
research
09/28/2020

Distributed Maximization of Submodular and Approximately Submodular Functions

We study the problem of maximizing a submodular function, subject to a c...
research
07/13/2023

Online Distributed Learning with Quantized Finite-Time Coordination

In this paper we consider online distributed learning problems. Online d...
research
06/26/2011

Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources

The performance of anytime algorithms can be improved by simultaneously ...
research
02/05/2018

On Distributed Algorithms for Cost-Efficient Data Center Placement in Cloud Computing

The increasing popularity of cloud computing has resulted in a prolifera...
research
05/29/2021

Learning to Harness Bandwidth with Multipath Congestion Control and Scheduling

Multipath TCP (MPTCP) has emerged as a facilitator for harnessing and po...
research
04/27/2021

Pronto: Federated Task Scheduling

We present a federated, asynchronous, memory-limited algorithm for onlin...

Please sign up or login with your details

Forgot password? Click here to reset