(BQ) Part 2 book "Optimized cloud resource management and scheduling" has content: Energy efficiency by minimizing total busy time of offline parallel scheduling in cloud computing; comparative study of energy efficient scheduling in cloud data centers; energy efficiency scheduling in hadoop,. and other contents. | Energy Efficiency by Minimizing Total Busy Time of Offline Parallel Scheduling in Cloud Computing 7 Main Contents of this Chapter: G G G Approximation algorithm and its approximation ratio bound Application to energy efficiency in Cloud computing Performance evaluation Introduction We follow a three-field notation scheme for the job scheduling problem in machines. This notation is proposed in Ref. [1] as αjβjγ, which specifies the processor environment, task characteristics, and objective function, respectively. For example, Pjrj ; ej jCmax refers to the multiprocessor problem of minimizing the completion time (makespan), when each task has a release date and deadline speciP fied. Pm jrj ; ej j Cj denotes the multiprocessor problem of minimizing the total completion time, when each task has a release date and deadline specified, and m number of processors is specified as part of the problem type. P In this chapter, the notation is Pg jsj ; ej j i bi , where multiple machines (each with capacity g) are considered. Each job has a start-time and end-time specified during which interval it should be processed, and the objective is to minimize the total busy time of all used machines. Formally, the input is a set of n jobs J 5 J1 ; . . .; Jn . Each job Jj is associated with an interval ½sj ; ej in which it should be processed; pj 5 ej 2 sj 1 1 is the process time of job Jj . Also given is the capacity parameter g $ 1, which is the maximal capacity a single machine provides. The busy time of a machine i is denoted by its working time interval length bi . The goal is to P assign jobs to machines such that the total busy time of all machines, given by B 5 i bi is minimized. Note that the number of machines ðm . 1Þ to be used is part of the output of the algorithm and takes an integral value. To the best of our knowledge, Khandekar et al. [2] are among the first to discuss this issue, while Brucker [3] reviews the problem and related references therein. Unless
