Resource allocation with stochastic demands

Fangfei Chen, Thomas La Porta, Mani B. Srivastava

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

Resources in modern computer systems include not only CPU, but also memory, hard disk, bandwidth, etc. To serve multiple users simultaneously, we need to satisfy their requirements in all resource dimensions. Meanwhile, their demands follow a certain distribution and may change over time. Our goal is then to admit as many users as possible to the system without violating the resource capacity more often than a predefined overflow probability. In this paper, we study the problem of allocating multiple resources among a group of users/tasks with stochastic demands. We model it as a stochastic multi-dimensional knapsack problem. We extend and apply the concept of effective bandwidth in order to solve this problem efficiently. Via numerical experiments, we show that our algorithms achieve near-optimal performance with specified overflow probability.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012
Pages257-264
Number of pages8
DOIs
StatePublished - Jul 30 2012
Event8th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012 - Hangzhou, China
Duration: May 16 2012May 18 2012

Publication series

NameProceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012

Other

Other8th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012
CountryChina
CityHangzhou
Period5/16/125/18/12

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Resource allocation with stochastic demands'. Together they form a unique fingerprint.

Cite this