Труды Института системного программирования РАН (Oct 2018)

Min_c: heterogeneous concentration policy for power aware scheduling

  • F. Armenta-Cano,
  • A. Tchernykh,
  • J. M. Cortés-Mendoza,
  • R. Yahyapour,
  • A. Yu. Drozdov,
  • P. Bouvry,
  • D. Kliazovich,
  • A. I. Avetisyan,
  • S. Nesmachnow

DOI
https://doi.org/10.15514/ISPRAS-2015-27(6)-23
Journal volume & issue
Vol. 27, no. 6
pp. 355 – 380

Abstract

Read online

In this paper, we address power aware online scheduling of jobs with resource contention. We propose an optimization model and present new approach to resource allocation with job concentration taking into account types of applications. Heterogeneous workloads include CPU intensive, disk I/O intensive, memory intensive, network I/O intensive and other applications. When jobs of one type are allocated to the same resource, they may create a bottleneck and resource contention either in CPU, memory, disk or network. It may result in degradation of the system performance and increasing energy consumption. We focus on energy characteristics of applications, and show that an intelligent allocation strategy can further improve energy consumption compared with traditional approaches. We propose heterogeneous job consolidation algorithms and validate them by conducting a performance evaluation study using the CloudSim toolkit under different scenarios and real data. We analyze several scheduling algorithms depending on the type and amount of information they require.

Keywords