Download now Free registration required
Dynamic resource allocation has the potential to provide significant increases in total revenue in enterprise systems through the reallocation of available resources as the demands on hosted applications change over time. This paper investigates the combination of workload prediction algorithms and switching policies: the former aim to forecast the workload associated with Internet services, the latter switch resources between applications according to certain system criteria. An evaluation of two well known switching policies - the Proportional Switching Policy (PSP) and the Bottleneck aware Switching Policy (BSP) - is conducted in the context of seven workload prediction algorithms.
- Format: PDF
- Size: 544.9 KB