Optimal and heuristic policies for dynamic server allocation

DOI10.1016/J.JPDC.2005.04.010zbMath1077.68526OpenAlexW2095313593MaRDI QIDQ2566965

Yanyan Li

Publication date: 29 September 2005

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.04.010

zbMATH Keywords

dynamic programmingquality of servicegrid computingheuristic policiesoptimal server allocation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Static and dynamic server allocation in systems with on/off sources ⋮ A mean field approach for optimization in discrete time ⋮ Grid Brokering for Batch Allocation Using Indexes

This page was built for publication: Optimal and heuristic policies for dynamic server allocation