Measurement-based efficient resource allocation with demand-side adjustments

DOI10.1016/J.AUTOMATICA.2019.05.003MaRDI QIDQ2280775zbMATH OpenOpenAlexWikidataFDO

Authors Georgios C. Chasparis

Publication date 19 December 2019

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1712.06299

zbMATH Keywords

resource managementlearning dynamicsmeasurement-based optimization

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Adaptive control/observation systems (93C40) Control/observation systems involving computers (process control, etc.) (93C83)

Abstract: The problem of efficient resource allocation has drawn significant attention in many scientific disciplines due to its direct societal benefits, such as energy savings. Traditional approaches in addressing online resource allocation problems neglect the potential benefit of feedback information available from the running tasks/loads as well as the potential flexibility of a task to adjust its operation/service-level in order to increase efficiency. The present paper builds upon recent developments in the area of bandwidth allocation in computing systems and proposes a generalized design approach for resource allocation when only performance measurements of the running tasks are available, possibly corrupted by noise. We demonstrate through analysis and simulations the potential of the proposed scheme in providing fair and efficient allocation of resources in a large class of resource allocation problems.

Recommendations

• Efficient resource allocation under multi-unit demand
• The resource allocation problem for demand forecasting and performance measurement
• Optimal allocation of demand response considering transmission system congestion
• Resource allocation problems in decentralized energy management
• scientific article; zbMATH DE number 2043505
• A robust optimal resource allocation model for uncertain demands

Cites work

• scientific article; zbMATH DE number 1972910 (Why is no real title available?)
• A Cooperative Game Framework for QoS Guided Job Allocation Schemes in Grids
• A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
• Achieving Pareto Optimality Through Distributed Learning
• An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization
• Aspiration learning in coordination games
• Design and implementation of distributed resource management for time-sensitive applications
• Distributed Subgradient Methods for Multi-Agent Optimization
• Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria
• ForestGOMP: An efficient openMP environment for NUMA architectures
• Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
• Learning Generalized Nash Equilibria in a Class of Convex Games
• Non-Convex Distributed Optimization
• Selfish Bin Packing
• Selfish load balancing
• Stochastic Stability of Perturbed Learning Automata in Positive-Utility Games

Cited in

(2)

• scientific article; zbMATH DE number 2043505 (Why is no real title available?)
• Primitives for resource management in a demand-driven reduction model

This page was built for publication: Measurement-based efficient resource allocation with demand-side adjustments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280775)