Energy Efficiency by Minimizing Total Busy Time of Offline Parallel Scheduling in Cloud Computing
This chapter considers the following fundamental scheduling problem. There are n deterministic jobs to be scheduled offline on multiple identical machines, which have bounded capacities. Each job is associated with a start-time, an end-time, a process time, and demand for machine capacity. The goal is to schedule all of the jobs nonpreemptively in their start-time–end-time windows, subject to machine capacity constraints such that the total busy time of the machines is minimized. We refer to this problem as minimizing the total busy time for the scheduling of multiple identical machines (MinTBT). This problem has important applications in power-aware ...
Get Optimized Cloud Resource Management and Scheduling now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
