Stochastic Resource Allocation for Energy-Constrained Systems

Sachs, Daniel Grobe

doi:10.1155/2009/246439

2009-07-14

Sachs, Daniel Grobe *

Douglas L. Jones

DOI：10.1155/2009/246439

原文链接

查看原文

摘要

En 中文

Battery-powered wireless systems running media applications have tight constraints on energy, CPU, and network capacity, and therefore require the careful allocation of these limited resources to maximize the system's performance while avoiding resource overruns. Usually, resource-allocation problems are solved using standard knapsack-solving techniques. However, when allocating conservable resources like energy (which unlike CPU and network remain available for later use if they are not used immediately) knapsack solutions suffer from excessive computational complexity, leading to the use of suboptimal heuristics. We show that use of Lagrangian optimization provides a fast, elegant, and, for convex problems, optimal solution to the allocation of energy across applications as they enter and leave the system, even if the exact sequence and timing of their entrances and exits is not known. This permits significant increases in achieved utility compared to heuristics in common use. As our framework requires only a stochastic description of future workloads, and not a full schedule, we also significantly expand the scope of systems that can be optimized. Copyright (c) 2009 D. G. Sachs and D. L. Jones.

Keyword:

ALGORITHM