DeepAI AI Chat
Log In Sign Up

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

by   Andreas Grammenos, et al.

We propose an asynchronous iterative scheme which allows a set of interconnected nodes to distributively reach an agreement to 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, being asynchronous, the proposed scheme is able to take in 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.


page 1

page 2

page 3

page 4


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

In this paper we analyze the problem of optimal task scheduling for data...

Pronto: Federated Task Scheduling

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

Asynchronous Policy Evaluation in Distributed Reinforcement Learning over Networks

This paper proposes a fully asynchronous scheme for policy evaluation of...

A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks

Introduced by Emek and Wattenhofer (PODC 2013), the stone age (SA) model...

Gradient Scheduling with Global Momentum for Non-IID Data Distributed Asynchronous Training

Distributed asynchronous offline training has received widespread attent...

Geo-Based Scheduling for C-V2X Networks

Cellular Vehicle-to-Everything (C-V2X) networks can operate without cell...

Federated Distributionally Robust Optimization with Non-Convex Objectives: Algorithm and Analysis

Distributionally Robust Optimization (DRO), which aims to find an optima...