Distributed CPU Scheduling Subject to Nonlinear Constraints

Mohammadreza Doostmohammadian, Alireza Aghasi, Apostolos I. Rikos, Andreas Grammenos, Evangelia Kalyvianaki, Christoforos N. Hadjicostis, Karl H. Johansson, Themistoklis Charalambous

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review


This paper considers a network of collaborating agents for local resource allocation subject to nonlinear model constraints. In many applications, it is required (or desirable) that the solution be anytime feasible in terms of satisfying the sum-preserving global constraint. Motivated by this, sufficient conditions on the nonlinear mapping for anytime feasibility (or non-asymptotic feasibility) are addressed in this paper. For the two proposed distributed solutions, one converges over directed weight-balanced networks and the other one over undirected networks. In particular, we elaborate on uniform quantization and discuss the notion of ϵ-accurate solution, which gives an estimate of how close we can get to the exact optimizer subject to different quantization levels. This work, further, handles general (possibly non-quadratic) strictly convex objective functions with application to CPU allocation among a cloud of data centers via distributed solutions. The results can be used as a coordination mechanism to optimally balance the tasks and CPU resources among a group of networked servers while addressing quantization or limited server capacity.

Original languageEnglish
Title of host publication2022 IEEE Conference on Control Technology and Applications, CCTA 2022
Number of pages6
ISBN (Electronic)978-1-6654-7338-5
Publication statusPublished - 2022
MoE publication typeA4 Article in a conference publication
EventIEEE Conference on Control Technology and Applications - Trieste, Italy
Duration: 23 Aug 202225 Aug 2022

Publication series

NameControl Technology and Applications
ISSN (Print)2768-0762
ISSN (Electronic)2768-0770


ConferenceIEEE Conference on Control Technology and Applications
Abbreviated titleCCTA


  • anytime feasibility
  • distributed optimization
  • multi-agent systems
  • sum-preserving resource allocation


Dive into the research topics of 'Distributed CPU Scheduling Subject to Nonlinear Constraints'. Together they form a unique fingerprint.

Cite this