Energy Minimization without Preemptions

For more info about our services contact : help@bestpfe.com

Table of contents

1 Introduction 
1.1 Energy and Thermal Models
1.2 Problem Definitions
1.3 Notation for Scheduling Problems
1.4 Algorithm Analysis
1.5 Related Work
1.6 Contributions
2 Single Processor 
2.1 Energy Minimization with Preemptions
2.2 Energy Minimization without Preemptions
2.2.1 From Single-Processor Preemptive Schedules
2.2.2 From Multiprocessor Non-Migratory Preemptive Schedules
2.3 Maximum Lateness Minimization
2.3.1 Offline
2.3.2 Online
3 Homogeneous Parallel Processors 
3.1 Energy Minimization with Migrations and Preemptions
3.1.1 Optimal Algorithm based on Maximum Flow
3.1.2 Optimal Algorithm based on Convex Cost Flow
3.2 Energy Minimization without Migrations or Preemptions
4 Heterogeneous Environments 
4.1 Energy Minimization with Migrations and Preemptions
4.2 Energy Minimization without Migrations with Preemptions
4.3 Average Completion Time Plus Energy Minimization
5 Shop Environments 
5.1 Energy Minimization in an Open Shop
5.1.1 Optimal Primal-Dual Algorithm
5.1.2 Experimental Evaluation of the Primal-Dual Algorithm
5.1.3 Optimal Algorithm based on Minimum Convex Cost Flow
5.2 Energy Minimization in a Job Shop
6 Temperature-Aware Scheduling 
6.1 Makespan Minimization
6.1.1 Inapproximability
6.1.2 Approximation Algorithm based on a transformation to P||Cmax .
6.1.3 LPT oriented Approximation Algorithm
6.2 Maximum and Average Temperature Minimization
7 Conclusion