7
Task Dependence in Scheduling and Load Balancing Prof. Adam Meyerson UCLA

Task Dependence in Scheduling and Load Balancing Prof. Adam Meyerson UCLA

Embed Size (px)

Citation preview

Page 1: Task Dependence in Scheduling and Load Balancing Prof. Adam Meyerson UCLA

Task Dependence in Scheduling and Load

BalancingProf. Adam Meyerson

UCLA

Page 2: Task Dependence in Scheduling and Load Balancing Prof. Adam Meyerson UCLA

Relating Energy to Speed

• Typical relationship E = s2.– Derived from physics.– Assumed in many papers…

• Two “meanings” for speed.– CPU operations per time unit– Rate at which tasks complete

Page 3: Task Dependence in Scheduling and Load Balancing Prof. Adam Meyerson UCLA

Task Completion Rates

• In a simple experiment, we ran two different programs which fill a large array.1.83

GHz[1.87]

0.98 GHz[1.00]

LinearOrder

2.6287 sec[1.81]

4.7595 sec[1.00]

RandomOrder

4.1386 sec[1.58]

6.5146 sec[1.00]

Page 4: Task Dependence in Scheduling and Load Balancing Prof. Adam Meyerson UCLA

Task-Dependent Scheduling

• Given a set of tasks and completion rates at various CPU speeds…

• Schedule tasks to optimize QoS (i.e. minimize weighted flow time, observe deadlines, maximize value) while minimizing energy.

Page 5: Task Dependence in Scheduling and Load Balancing Prof. Adam Meyerson UCLA

Energy Effect of Parallel Tasks

• Some observations based on LEAP…

– Running two cores costs less than twice the energy of running one core.

– Energy savings from running parallel tasks varies.• Depends on use of shared resources (memory etc)• Some pairs take more energy in parallel (basically one core will be idle, waiting for shared resource).

Thanos Stathopoulos, Dustin McIntire, William J. Kaiser.

The Energy Endoscope: Real-Time Detailed Energy Accounting for Wireless Sensor Nodes.Proceedings of the 7th International Conference on Information Processing in Sensor Networks (IPSN 2008)

Page 6: Task Dependence in Scheduling and Load Balancing Prof. Adam Meyerson UCLA

Task-Dependent Load Balancing

Core 1 Core 2

Task 1

Task 2

Task 3

In prior work, energydetermined by total time of activity, plusactivation costs.

Perhaps better to consider instantaneousenergy consumption which depends on the set of active tasks in a non-trivial way.

Page 7: Task Dependence in Scheduling and Load Balancing Prof. Adam Meyerson UCLA

Task-Dependent Load Balancing

• Given:– A set of tasks T, each with a duration– A number of cores c.– Energy/time E(S) for each ST with |S|≤c.

• We must allocate tasks to (core, timestep) such that each task is allocated to a single core and to a number of timesteps equal to its duration.

• Minimize ∑tE(St) where St are active tasks at t.