Optimal and heuristic policies for dynamic server allocation
From MaRDI portal
Publication:2566965
DOI10.1016/j.jpdc.2005.04.010zbMath1077.68526MaRDI QIDQ2566965
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
dynamic programming; quality of service; grid computing; heuristic policies; optimal server allocation
68M10: Network design and communication in computer systems
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
A mean field approach for optimization in discrete time, Static and dynamic server allocation in systems with on/off sources, Grid Brokering for Batch Allocation Using Indexes