Distributed CPU Scheduling Subject to Nonlinear Constraints
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 {\epsilon}-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. Index Terms: multi-agent systems, sum-preserving resource allocation, distributed optimization, anytime feasibility
Code (0)
등록된 구현이 없습니다.
Tasks
CPUDistributed OptimizationQuantizationSchedulingSimilar Papers 제목 키워드 기반
Distributed Finite-Sum Constrained Optimization subject to Nonlinearity on the Node Dynamics
Motivated by recent development in networking and parallel data-processing, we consider a distributed and localized finite-sum (or fixed-sum) allocation technique to solve resource-constrained convex optimization problem…
Decision MakingMomentum-based Distributed Resource Scheduling Optimization Subject to Sector-Bound Nonlinearity and Latency
This paper proposes an accelerated consensus-based distributed iterative algorithm for resource allocation and scheduling. The proposed gradient-tracking algorithm introduces an auxiliary variable to add momentum towards…
SchedulingDecentralized Equitable Energy Access in Energy Communities
We address the issue of equitable energy access within an energy community consisting of members with diverse socioeconomic backgrounds, including varying income levels and differing capacities to access distributed ener…
SchedulingDynamic Scheduling for Federated Edge Learning with Streaming Data
In this work, we consider a Federated Edge Learning (FEEL) system where training data are randomly generated over time at a set of distributed edge devices with long-term energy constraints. Due to limited communication …
SchedulingAdaptive Scheduling for Machine Learning Tasks over Networks
A key functionality of emerging connected autonomous systems such as smart transportation systems, smart cities, and the industrial Internet-of-Things, is the ability to process and learn from data collected at different…
BIG-bench Machine LearningFederated LearningInformativenessregression+1