Energy-efficient scheduling

Size: px
Start display at page:

Download "Energy-efficient scheduling"

Transcription

1 Energy-efficient scheduling Guillaume Aupy 1, Anne Benoit 1,2, Paul Renaud-Goud 1 and Yves Robert 1,2,3 1. Ecole Normale Supérieure de Lyon, France 2. Institut Universitaire de France 3. University of Tennessee Knoxville, USA Anne.Benoit@ens-lyon.fr 9th Workshop of the INRIA-Illinois-ANL Joint Lab on Petascale Computing Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 1/ 50

2 Energy: a crucial issue Data centers 330, 000, 000, 000 Watts hour in 2007: more than France 533, 000, 000 tons of CO 2 : in the top ten countries Exascale computers (10 18 floating operations per second) Need effort for feasibility 1% of power saved 1 million dollar per year Lambda user 1 billion personal computers 500, 000, 000, 000, 000 Watts hour per year crucial for both environmental and economical reasons Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 2/ 50

3 Energy: a crucial issue Data centers 330, 000, 000, 000 Watts hour in 2007: more than France 533, 000, 000 tons of CO 2 : in the top ten countries Exascale computers (10 18 floating operations per second) Need effort for feasibility 1% of power saved 1 million dollar per year Lambda user 1 billion personal computers 500, 000, 000, 000, 000 Watts hour per year crucial for both environmental and economical reasons Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 2/ 50

4 Power dissipation of a processor P = P leak + P dyn P leak : constant P dyn = B V 2 f constant supply voltage frequency Standard approximation: P = P leak + f α (2 α 3) Energy E = P time Dynamic Voltage and Frequency Scaling Real life: discrete speeds Continuous speeds can be emulated Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 3/ 50

5 Outline 1 Revisiting the greedy algorithm for independent jobs 2 Reclaiming the slack of a schedule 3 Tri-criteria problem: execution time, reliability, energy 4 Checkpointing and energy consumption 5 Conclusion Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 4/ 50

6 Framework Scheduling independent jobs Greedy algorithm: assign next job to least-loaded processor Two variants: OnLine-Greedy: assign jobs on the fly OffLine-Greedy: sort jobs before execution JLPC Workshop 2013 Energy-efficient scheduling 5/ 50

7 Classical problem n independent jobs {J i } 1 i n, a i = size of J i p processors {P q } 1 q p allocation function alloc : {J i } {P q } load of P q = load(q) = {i alloc(j i )=P q} a i a 1 a 2 load(1) a 3 a 4 P 1 a 1 a 10 a 3 a 13 P 2 a 7 a 6 a 5 a 6 P 3 a 9 a 12 a 8 P 4 a 4 P 5 a 2 a 11 a 5 Execution time: max 1 q p load(q) a 8 a 9 a 10 a 7 a 11 a 12 a 13 Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 6/ 50

8 OnLine-Greedy Theorem OnLine-Greedy is a 2 1 p approximation (tight bound) OnLine-Greedy Optimal solution Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 7/ 50

9 OffLine-Greedy Theorem OffLine-Greedy is a p approximation (tight bound) OffLine-Greedy Optimal solution Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 8/ 50

10 Bi-criteria problem Minimizing (dynamic) power consumption: use slowest possible speed P dyn = f α = f 3 Bi-criteria problem: Given bound M = 1 on execution time, minimize power consumption while meeting the bound Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 9/ 50

11 Bi-criteria problem statement n independent jobs {J i } 1 i n, a i = size of J i p processors {P q } 1 q p allocation function alloc : {J i } {P q } load of P q = load(q) = {i alloc(j i )=P q} a i (load(q)) 3 power dissipated by P q p q=1 (load(q))3 Power max 1 q p load(q) Execution time Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 10/ 50

12 Same Greedy algorithm... Strategy: assign next job to least-loaded processor Natural for execution-time smallest increment of maximum load minimize objective value for currently processed jobs Natural for power too smallest increment of total power (convexity) minimize objective value for currently processed jobs JLPC Workshop 2013 Energy-efficient scheduling 11/ 50

13 ... but different optimal solution! Makespan 10, power Makespan 10.1, power JLPC Workshop 2013 Energy-efficient scheduling 12/ 50

14 Greedy and L r norms p N r = (load(q)) r q=1 1 r Execution time N = lim r N r = max 1 q p load(q) Power (N 3 ) 3 Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 13/ 50

15 Known results N 2, OffLine-Greedy Chandra and Wong 1975: upper and lower bounds Leung and Wei 1995: tight approximation factor N 3, OffLine-Greedy Chandra and Wong 1975: upper and lower bounds N r Alon et al. 1997: PTAS for offline problem Avidor et al. 1998: upper bound 2 Θ( ln r r ) for OnLine-Greedy Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 14/ 50

16 Contribution N 3 Tight approximation factor for OnLine-Greedy Tight approximation factor for OffLine-Greedy Greedy for power fully solved! Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 15/ 50

17 Approximation for OnLine-Greedy P online P opt ( 1 (1 + (p 1)β) 3 + (p 1) (1 β) 3) p 3 β 3 + (1 β)3 (p 1) 2 }{{} f p (on) (β) Theorem f (on) p has a single maximum in β (on) p [ 1 p, 1] OnLine-Greedy is a f p (on) p This approximation factor is tight (β (on) ) approximation Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 16/ 50

18 Approximation for OffLine-Greedy P offline P opt ( ( ) 3 ( ) ) (p 1)β p (p 1) 1 β 3 β 3 + (1 β)3 (p 1) 2 }{{} f p (off) (β) Theorem f (off) p has a single maximum in β (off) p [ 1 p, 1] OffLine-Greedy is a f p (off) p This approximation factor is tight (β (off) ) approximation Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 17/ 50

19 Numerical values of approximation ratios p OnLine-Greedy OffLine-Greedy Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 18/ 50

20 Large values of p Asymptotic approximation factor OnLine-Greedy OffLine-Greedy 2 1 optimal Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 19/ 50

21 Outline 1 Revisiting the greedy algorithm for independent jobs 2 Reclaiming the slack of a schedule 3 Tri-criteria problem: execution time, reliability, energy 4 Checkpointing and energy consumption 5 Conclusion Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 20/ 50

22 Motivation Mapping of tasks is given (ordered list for each processor and dependencies between tasks) If deadline not tight, why not take our time? Slack: unused time slots Goal: efficiently use speed scaling (DVFS) D D Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 21/ 50

23 Speed models Type of speeds Change speed Anytime Beginning of tasks [s min, s max] Continuous - {s 1,..., s m} Vdd-Hopping Discrete, Incremental Continuous: great for theory Other discrete models more realistic Vdd-Hopping simulates Continuous Incremental is a special case of Discrete with equally-spaced speeds: for all 1 q < m, s q+1 s q = δ Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 22/ 50

24 Tasks DAG: G = (V, E) n = V tasks T i of weight w i = t i t i d i s i (t)dt d i : task duration; t i : time of end of execution of T i d i p j s i (t) t i time Parameters for T i scheduled on processor p j Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 23/ 50

25 Makespan Assume T i is executed at constant speed s i d i = Exe(w i, s i ) = w i s i t j + d i t i for each (T j, T i ) E Constraint on makespan: t i D for each T i V Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 24/ 50

26 Energy Energy to execute task T i once at speed s i : E i (s i ) = d i s 3 i = w i s 2 i Dynamic part of classical energy models Bi-criteria problem Constraint on deadline: t i D for each T i V Minimize energy consumption: n i=1 w i s 2 i Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 25/ 50

27 Complexity results Minimizing energy with fixed mapping on p processors: Continuous: Polynomial for some special graphs, geometric optimization in the general case Discrete: NP-complete (reduction from 2-partition); approximation algorithm Incremental: NP-complete (reduction from 2-partition); approximation algorithm Vdd-Hopping: Polynomial (linear programming) Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 26/ 50

28 Summary Results for Continuous, but not very practical In real life, Discrete model (DVFS) Vdd-Hopping: good alternative, mixing two consecutive modes, smoothes out the discrete nature of modes Incremental: alternate (and simpler in practice) solution, with one unique speed during task execution; can be made arbitrarily efficient JLPC Workshop 2013 Energy-efficient scheduling 27/ 50

29 Outline 1 Revisiting the greedy algorithm for independent jobs 2 Reclaiming the slack of a schedule 3 Tri-criteria problem: execution time, reliability, energy 4 Checkpointing and energy consumption 5 Conclusion Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 28/ 50

30 Framework DAG: G = (V, E) n = V tasks T i of weight w i p identical processors fully connected DVFS: interval of available continuous speeds [s min, s max ] One speed per task (I will not discuss results for the Vdd-Hopping model) Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 29/ 50

31 Makespan Execution time of T i at speed s i : d i = w i s i If T i is executed twice on the same processor at speeds s i and s i : d i = w i s i + w i s i Constraint on makespan: end of execution before deadline D Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 30/ 50

32 Reliability Transient fault: local, no impact on the rest of the system Reliability R i of task T i as a function of speed s Threshold reliability (and hence speed s rel ) R i (s) R 1 i (s rel ) s min s rel s max s Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 31/ 50

33 Re-execution: a task is re-executed on the same processor, just after its first execution With two executions, reliability R i of task T i is: R i = 1 (1 R i (s i ))(1 R i (s i )) Constraint on reliability: Reliability: R i R i (s rel ), and at most one re-execution Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 32/ 50

34 Energy Energy to execute task T i once at speed s i : E i (s i ) = w i s 2 i Dynamic part of classical energy models With re-executions, it is natural to take the worst-case scenario: ( Energy : E i = w i s 2 i + s i 2 ) Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 33/ 50

35 Tri-Crit-Cont Given G = (V, E) Find A schedule of the tasks A set of tasks I = {i T i is executed twice} Execution speed s i for each task T i Re-execution speed s i for each task in I such that i I w i (s 2 i + s 2 i ) + i / I w i s 2 i is minimized, while meeting reliability and deadline constraints Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 34/ 50

36 Complexity results One speed per task Re-execution at same speed as first execution, i.e., s i = s i Tri-Crit-Cont is NP-hard even for a linear chain, but not known to be in NP (because of Continuous model) Polynomial-time solution for a fork Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 35/ 50

37 Energy-reducing heuristics Two steps: Mapping (NP-hard) List scheduling Speed scaling + re-execution (NP-hard) Energy reducing The list-scheduling heuristic maps tasks onto processors at speed s max, and we keep this mapping in step two Step two = slack reclamation! Use of deceleration and re-execution Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 36/ 50

38 Deceleration and re-execution Deceleration: select a set of tasks that we execute at speed max max(s rel, s i=1..n t i max D ): slowest possible speed meeting both reliability and deadline constraints Re-execution: greedily select tasks for re-execution Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 37/ 50

39 Super-weight (SW) of a task SW: sum of the weights of the tasks (including T i ) whose execution interval is included into T i s execution interval SW of task slowed down = estimation of the total amount of work that can be slowed down together with that task p 4 T i p 3 p 2 p 1 s e time Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 38/ 50

40 Selected heuristics A.SUS-Crit: efficient on DAGs with low degree of parallelism max Set the speed of every task to max(s rel, s i=1..n t i max D ) Sort the tasks of every critical path according to their SW and try to re-execute them Sort all the tasks according to their weight and try to re-execute them B.SUS-Crit-Slow: good for highly parallel tasks: re-execute, then decelerate Sort the tasks of every critical path according to their SW and try to re-execute them. If not possible, then try to slow them down Sort all tasks according to their weight and try to re-execute them. If not possible, then try to slow them down Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 39/ 50

41 Results We compare the impact of: the number of processors p the ratio D of the deadline over the minimum deadline D min (given by the list-scheduling heuristic at speed s max ) on the output of each heuristic Results normalized by heuristic running each task at speed s max ; the lower the better Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 40/ 50

42 Results 1 1 A.SUS-Crit A.SUS-Crit 0.9 B.SUS-Crit-Slow 0.9 B.SUS-Crit-Slow Eg / Eg_fmax Eg / Eg_fmax Number of processors Number of processors With increasing p, D = 1.2 (left), D = 2.4 (right) A better when number of processors is small B better when number of processors is large Superiority of B for tight deadlines: decelerates critical tasks that cannot be re-executed Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 40/ 50

43 Summary Tri-criteria energy/makespan/reliability optimization problem Various theoretical results Two-step approach for polynomial-time heuristics: List-scheduling heuristic Energy-reducing heuristics Two complementary energy-reducing heuristics for Tri-Crit-Cont JLPC Workshop 2013 Energy-efficient scheduling 41/ 50

44 Outline 1 Revisiting the greedy algorithm for independent jobs 2 Reclaiming the slack of a schedule 3 Tri-criteria problem: execution time, reliability, energy 4 Checkpointing and energy consumption 5 Conclusion Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 42/ 50

45 Framework Execution of a divisible task (W operations) Failures may occur Transient faults Resilience through checkpointing Objective: minimize expected energy given a deadline bound Decisions before execution: Chunks: how many (n)? which sizes (W i for chunk i)? Speeds of each chunk: first run (s i )? re-execution (σ i )? Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 43/ 50

46 Framework Execution of a divisible task (W operations) Failures may occur Transient faults Resilience through checkpointing Objective: minimize expected energy given a deadline bound Decisions before execution: Chunks: how many (n)? which sizes (W i for chunk i)? Speeds of each chunk: first run (s i )? re-execution (σ i )? Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 43/ 50

47 Framework Execution of a divisible task (W operations) Failures may occur Transient faults Resilience through checkpointing Objective: minimize expected energy given a deadline bound Decisions before execution: Chunks: how many (n)? which sizes (W i for chunk i)? Speeds of each chunk: first run (s i )? re-execution (σ i )? Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 43/ 50

48 Models Chunks Single chunk Speed per chunk VS VS Multiple chunks Single speed Deadline bound Multiple speeds Hard ( Worst-case) VS Soft (Expected) Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 44/ 50

49 Summary of results: single chunk Single speed s E(E) convex (expected energy consumption) s E(T ) (expected execution time) and s T wc (worst-case execution time) decreasing Expression of s and E(E) (function of λ, W, s, E c, T c ) Multiple speeds Energy minimized when deadline tight σ expressed as a function of s Minimization of single-variable function Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 45/ 50

50 Summary of results: multiple chunks Single speed Equal-sized chunks, executed at same speed Bound on s given n Minimization of double-variable function Multiple speeds Conjecture: equal-sized chunks, same first-execution / re-execution speeds σ as a function of s, bound on s given n Minimization of double-variable function Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 46/ 50

51 Comparison Model (/SCSS) SCMSed SCMShd MCSSed MCSShd MCMSed MCMShd Model SCSS MCSS SCMS MCMS E e 06 1e 03 1e+00 lambda 1e 06 1e 03 1e+00 lambda Conclusions for realistic values of λ: Expected deadline constraint use 1 chunk, 1 speed Hard deadline constraint use multiple speeds anytime, multiple chunks if frequent failures Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 47/ 50

52 Outline 1 Revisiting the greedy algorithm for independent jobs 2 Reclaiming the slack of a schedule 3 Tri-criteria problem: execution time, reliability, energy 4 Checkpointing and energy consumption 5 Conclusion Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 48/ 50

53 Conclusion OnLine-Greedy and OffLine-Greedy for power: tight approximation factor for any p, extends long series of papers and completely solves N 3 minimization problem Different energy models, from continuous to discrete (through VDD-hopping and incremental) Tri-criteria heuristics with replication to deal with reliability Checkpointing techniques for reliability while minimizing energy consumption Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 49/ 50

54 What we had: Energy-efficient scheduling + frequency scaling What we aim at: Anne.Benoit@ens-lyon.fr JLPC Workshop 2013 Energy-efficient scheduling 50/ 50

Resilient and energy-aware algorithms

Resilient and energy-aware algorithms Resilient and energy-aware algorithms Anne Benoit ENS Lyon Anne.Benoit@ens-lyon.fr http://graal.ens-lyon.fr/~abenoit CR02-2016/2017 Anne.Benoit@ens-lyon.fr CR02 Resilient and energy-aware algorithms 1/

More information

Energy-aware checkpointing of divisible tasks with soft or hard deadlines

Energy-aware checkpointing of divisible tasks with soft or hard deadlines Energy-aware checkpointing of divisible tasks with soft or hard deadlines Guillaume Aupy 1, Anne Benoit 1,2, Rami Melhem 3, Paul Renaud-Goud 1 and Yves Robert 1,2,4 1. Ecole Normale Supérieure de Lyon,

More information

Reclaiming the energy of a schedule: models and algorithms

Reclaiming the energy of a schedule: models and algorithms Author manuscript, published in "Concurrency and Computation: Practice and Experience 25 (2013) 1505-1523" DOI : 10.1002/cpe.2889 CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE Concurrency Computat.:

More information

Energy-aware checkpointing of divisible tasks with soft or hard deadlines

Energy-aware checkpointing of divisible tasks with soft or hard deadlines Energy-aware checkpointing of divisible tasks with soft or hard deadlines Guillaume Aupy, Anne Benoit, Rami Melhem, Paul Renaud-Goud, Yves Robert To cite this version: Guillaume Aupy, Anne Benoit, Rami

More information

Energy-aware scheduling under reliability and makespan constraints

Energy-aware scheduling under reliability and makespan constraints Energy-aare scheduling under reliability and makespan constraints Guillaume Aupy, Anne Benoit and Yves Robert LIP, Ecole Normale Supérieure de Lyon Email: {Guillaume.Aupy Anne.Benoit Yves.Robert}@ens-lyon.fr

More information

Efficient Power Management Schemes for Dual-Processor Fault-Tolerant Systems

Efficient Power Management Schemes for Dual-Processor Fault-Tolerant Systems Efficient Power Management Schemes for Dual-Processor Fault-Tolerant Systems Yifeng Guo, Dakai Zhu The University of Texas at San Antonio Hakan Aydin George Mason University Outline Background and Motivation

More information

Bin packing and scheduling

Bin packing and scheduling Sanders/van Stee: Approximations- und Online-Algorithmen 1 Bin packing and scheduling Overview Bin packing: problem definition Simple 2-approximation (Next Fit) Better than 3/2 is not possible Asymptotic

More information

On the performance of greedy algorithms for energy minimization

On the performance of greedy algorithms for energy minimization On the erformance of greedy algorithms for energy minimization Anne Benoit, Paul Renaud-Goud, Yves Robert To cite this version: Anne Benoit, Paul Renaud-Goud, Yves Robert On the erformance of greedy algorithms

More information

Approximation algorithms for energy, reliability and makespan optimization problems

Approximation algorithms for energy, reliability and makespan optimization problems Approximation algorithms for energy, reliability and makespan optimization problems Guillaume Aupy, Anne Benoit REEARCH REPORT N 8107 July 014 Project-Team ROMA IN 049-6399 IRN INRIA/RR--8107--FR+ENG Approximation

More information

Embedded Systems Design: Optimization Challenges. Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden

Embedded Systems Design: Optimization Challenges. Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden of /4 4 Embedded Systems Design: Optimization Challenges Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden Outline! Embedded systems " Example area: automotive electronics " Embedded systems

More information

P C max. NP-complete from partition. Example j p j What is the makespan on 2 machines? 3 machines? 4 machines?

P C max. NP-complete from partition. Example j p j What is the makespan on 2 machines? 3 machines? 4 machines? Multiple Machines Model Multiple Available resources people time slots queues networks of computers Now concerned with both allocation to a machine and ordering on that machine. P C max NP-complete from

More information

On scheduling the checkpoints of exascale applications

On scheduling the checkpoints of exascale applications On scheduling the checkpoints of exascale applications Marin Bougeret, Henri Casanova, Mikaël Rabie, Yves Robert, and Frédéric Vivien INRIA, École normale supérieure de Lyon, France Univ. of Hawai i at

More information

Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems

Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems Energy-Efficient Real-Time Task Scheduling in Multiprocessor DVS Systems Jian-Jia Chen *, Chuan Yue Yang, Tei-Wei Kuo, and Chi-Sheng Shih Embedded Systems and Wireless Networking Lab. Department of Computer

More information

CycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators

CycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators CycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators Sandeep D souza and Ragunathan (Raj) Rajkumar Carnegie Mellon University High (Energy) Cost of Accelerators Modern-day

More information

Scheduling Lecture 1: Scheduling on One Machine

Scheduling Lecture 1: Scheduling on One Machine Scheduling Lecture 1: Scheduling on One Machine Loris Marchal 1 Generalities 1.1 Definition of scheduling allocation of limited resources to activities over time activities: tasks in computer environment,

More information

CS 6901 (Applied Algorithms) Lecture 3

CS 6901 (Applied Algorithms) Lecture 3 CS 6901 (Applied Algorithms) Lecture 3 Antonina Kolokolova September 16, 2014 1 Representative problems: brief overview In this lecture we will look at several problems which, although look somewhat similar

More information

On the Complexity of Mapping Pipelined Filtering Services on Heterogeneous Platforms

On the Complexity of Mapping Pipelined Filtering Services on Heterogeneous Platforms On the Complexity of Mapping Pipelined Filtering Services on Heterogeneous Platforms Anne Benoit, Fanny Dufossé and Yves Robert LIP, École Normale Supérieure de Lyon, France {Anne.Benoit Fanny.Dufosse

More information

Scheduling algorithms for heterogeneous and failure-prone platforms

Scheduling algorithms for heterogeneous and failure-prone platforms Scheduling algorithms for heterogeneous and failure-prone platforms Yves Robert Ecole Normale Supérieure de Lyon & Institut Universitaire de France http://graal.ens-lyon.fr/~yrobert Joint work with Olivier

More information

STATISTICAL PERFORMANCE

STATISTICAL PERFORMANCE STATISTICAL PERFORMANCE PROVISIONING AND ENERGY EFFICIENCY IN DISTRIBUTED COMPUTING SYSTEMS Nikzad Babaii Rizvandi 1 Supervisors: Prof.Albert Y.Zomaya Prof. Aruna Seneviratne OUTLINE Introduction Background

More information

Scheduling divisible loads with return messages on heterogeneous master-worker platforms

Scheduling divisible loads with return messages on heterogeneous master-worker platforms Scheduling divisible loads with return messages on heterogeneous master-worker platforms Olivier Beaumont, Loris Marchal, Yves Robert Laboratoire de l Informatique du Parallélisme École Normale Supérieure

More information

Spatio-Temporal Thermal-Aware Scheduling for Homogeneous High-Performance Computing Datacenters

Spatio-Temporal Thermal-Aware Scheduling for Homogeneous High-Performance Computing Datacenters Spatio-Temporal Thermal-Aware Scheduling for Homogeneous High-Performance Computing Datacenters Hongyang Sun a,, Patricia Stolf b, Jean-Marc Pierson b a Ecole Normale Superieure de Lyon & INRIA, France

More information

APTAS for Bin Packing

APTAS for Bin Packing APTAS for Bin Packing Bin Packing has an asymptotic PTAS (APTAS) [de la Vega and Leuker, 1980] For every fixed ε > 0 algorithm outputs a solution of size (1+ε)OPT + 1 in time polynomial in n APTAS for

More information

More Approximation Algorithms

More Approximation Algorithms CS 473: Algorithms, Spring 2018 More Approximation Algorithms Lecture 25 April 26, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 28 Formal definition of approximation

More information

Optimal checkpointing periods with fail-stop and silent errors

Optimal checkpointing periods with fail-stop and silent errors Optimal checkpointing periods with fail-stop and silent errors Anne Benoit ENS Lyon Anne.Benoit@ens-lyon.fr http://graal.ens-lyon.fr/~abenoit 3rd JLESC Summer School June 30, 2016 Anne.Benoit@ens-lyon.fr

More information

Embedded Systems 14. Overview of embedded systems design

Embedded Systems 14. Overview of embedded systems design Embedded Systems 14-1 - Overview of embedded systems design - 2-1 Point of departure: Scheduling general IT systems In general IT systems, not much is known about the computational processes a priori The

More information

Energy-efficient Mapping of Big Data Workflows under Deadline Constraints

Energy-efficient Mapping of Big Data Workflows under Deadline Constraints Energy-efficient Mapping of Big Data Workflows under Deadline Constraints Presenter: Tong Shu Authors: Tong Shu and Prof. Chase Q. Wu Big Data Center Department of Computer Science New Jersey Institute

More information

Schedulability of Periodic and Sporadic Task Sets on Uniprocessor Systems

Schedulability of Periodic and Sporadic Task Sets on Uniprocessor Systems Schedulability of Periodic and Sporadic Task Sets on Uniprocessor Systems Jan Reineke Saarland University July 4, 2013 With thanks to Jian-Jia Chen! Jan Reineke July 4, 2013 1 / 58 Task Models and Scheduling

More information

Exam Spring Embedded Systems. Prof. L. Thiele

Exam Spring Embedded Systems. Prof. L. Thiele Exam Spring 20 Embedded Systems Prof. L. Thiele NOTE: The given solution is only a proposal. For correctness, completeness, or understandability no responsibility is taken. Sommer 20 Eingebettete Systeme

More information

This means that we can assume each list ) is

This means that we can assume each list ) is This means that we can assume each list ) is of the form ),, ( )with < and Since the sizes of the items are integers, there are at most +1pairs in each list Furthermore, if we let = be the maximum possible

More information

Reclaiming the energy of a schedule: models and algorithms

Reclaiming the energy of a schedule: models and algorithms Reclaiming the energy of a schedule: models and algorithms Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert To cite this version: Guillaume Aupy, Anne Benoit, Fanny Dufossé, Yves Robert. Reclaiming

More information

Energy-Constrained Scheduling for Weakly-Hard Real-Time Systems

Energy-Constrained Scheduling for Weakly-Hard Real-Time Systems Energy-Constrained Scheduling for Weakly-Hard Real-Time Systems Tarek A. AlEnawy and Hakan Aydin Computer Science Department George Mason University Fairfax, VA 23 {thassan1,aydin}@cs.gmu.edu Abstract

More information

Segment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks

Segment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks Segment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks Junsung Kim, Björn Andersson, Dionisio de Niz, and Raj Rajkumar Carnegie Mellon University 2/31 Motion Planning on Self-driving Parallel

More information

Optimizing Energy Consumption under Flow and Stretch Constraints

Optimizing Energy Consumption under Flow and Stretch Constraints Optimizing Energy Consumption under Flow and Stretch Constraints Zhi Zhang, Fei Li Department of Computer Science George Mason University {zzhang8, lifei}@cs.gmu.edu November 17, 2011 Contents 1 Motivation

More information

Embedded Systems Development

Embedded Systems Development Embedded Systems Development Lecture 3 Real-Time Scheduling Dr. Daniel Kästner AbsInt Angewandte Informatik GmbH kaestner@absint.com Model-based Software Development Generator Lustre programs Esterel programs

More information

CSE 421 Greedy Algorithms / Interval Scheduling

CSE 421 Greedy Algorithms / Interval Scheduling CSE 421 Greedy Algorithms / Interval Scheduling Yin Tat Lee 1 Interval Scheduling Job j starts at s(j) and finishes at f(j). Two jobs compatible if they don t overlap. Goal: find maximum subset of mutually

More information

Lecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013

Lecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013 Lecture 3 Real-Time Scheduling Daniel Kästner AbsInt GmbH 203 Model-based Software Development 2 SCADE Suite Application Model in SCADE (data flow + SSM) System Model (tasks, interrupts, buses, ) SymTA/S

More information

Lecture 2: Scheduling on Parallel Machines

Lecture 2: Scheduling on Parallel Machines Lecture 2: Scheduling on Parallel Machines Loris Marchal October 17, 2012 Parallel environment alpha in Graham s notation): P parallel identical Q uniform machines: each machine has a given speed speed

More information

Reliability-Aware Power Management for Real-Time Embedded Systems. 3 5 Real-Time Tasks... Dynamic Voltage and Frequency Scaling...

Reliability-Aware Power Management for Real-Time Embedded Systems. 3 5 Real-Time Tasks... Dynamic Voltage and Frequency Scaling... Chapter 1 Reliability-Aware Power Management for Real-Time Embedded Systems Dakai Zhu The University of Texas at San Antonio Hakan Aydin George Mason University 1.1 1.2 Introduction... Background and System

More information

hal , version 1-27 Mar 2014

hal , version 1-27 Mar 2014 Author manuscript, published in "2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), New York, NY. : United States (2005)" 2 More formally, we denote by

More information

Optimizing Performance and Reliability on Heterogeneous Parallel Systems: Approximation Algorithms and Heuristics

Optimizing Performance and Reliability on Heterogeneous Parallel Systems: Approximation Algorithms and Heuristics Optimizing Performance and Reliability on Heterogeneous Parallel Systems: Approximation Algorithms and Heuristics Emmanuel Jeannot a, Erik Saule b, Denis Trystram c a INRIA Bordeaux Sud-Ouest, Talence,

More information

Scheduling divisible loads with return messages on heterogeneous master-worker platforms

Scheduling divisible loads with return messages on heterogeneous master-worker platforms Scheduling divisible loads with return messages on heterogeneous master-worker platforms Olivier Beaumont 1, Loris Marchal 2, and Yves Robert 2 1 LaBRI, UMR CNRS 5800, Bordeaux, France Olivier.Beaumont@labri.fr

More information

Bi-objective approximation scheme for makespan and reliability optimization on uniform parallel machines

Bi-objective approximation scheme for makespan and reliability optimization on uniform parallel machines Bi-objective approximation scheme for makespan and reliability optimization on uniform parallel machines Emmanuel Jeannot 1, Erik Saule 2, and Denis Trystram 2 1 INRIA-Lorraine : emmanuel.jeannot@loria.fr

More information

Algorithm Design. Scheduling Algorithms. Part 2. Parallel machines. Open-shop Scheduling. Job-shop Scheduling.

Algorithm Design. Scheduling Algorithms. Part 2. Parallel machines. Open-shop Scheduling. Job-shop Scheduling. Algorithm Design Scheduling Algorithms Part 2 Parallel machines. Open-shop Scheduling. Job-shop Scheduling. 1 Parallel Machines n jobs need to be scheduled on m machines, M 1,M 2,,M m. Each machine can

More information

Scheduling Lecture 1: Scheduling on One Machine

Scheduling Lecture 1: Scheduling on One Machine Scheduling Lecture 1: Scheduling on One Machine Loris Marchal October 16, 2012 1 Generalities 1.1 Definition of scheduling allocation of limited resources to activities over time activities: tasks in computer

More information

Multiprocessor Scheduling I: Partitioned Scheduling. LS 12, TU Dortmund

Multiprocessor Scheduling I: Partitioned Scheduling. LS 12, TU Dortmund Multiprocessor Scheduling I: Partitioned Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 22/23, June, 2015 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 47 Outline Introduction to Multiprocessor

More information

How to deal with uncertainties and dynamicity?

How to deal with uncertainties and dynamicity? How to deal with uncertainties and dynamicity? http://graal.ens-lyon.fr/ lmarchal/scheduling/ 19 novembre 2012 1/ 37 Outline 1 Sensitivity and Robustness 2 Analyzing the sensitivity : the case of Backfilling

More information

Mapping tightly-coupled applications on volatile resources

Mapping tightly-coupled applications on volatile resources Mapping tightly-coupled applications on volatile resources Henri Casanova, Fanny Dufossé, Yves Robert, Frédéric Vivien To cite this version: Henri Casanova, Fanny Dufossé, Yves Robert, Frédéric Vivien.

More information

arxiv: v3 [cs.ds] 14 Sep 2013

arxiv: v3 [cs.ds] 14 Sep 2013 Energy-Efficient Scheduling with Time and Processors Eligibility Restrictions Xibo Jin, Fa Zhang, Ying Song, Liya Fan and Zhiyong Liu arxiv:1301.4131v3 [cs.ds] 14 Sep 2013 Institute of Computing Technology,

More information

Algorithms. Outline! Approximation Algorithms. The class APX. The intelligence behind the hardware. ! Based on

Algorithms. Outline! Approximation Algorithms. The class APX. The intelligence behind the hardware. ! Based on 6117CIT - Adv Topics in Computing Sci at Nathan 1 Algorithms The intelligence behind the hardware Outline! Approximation Algorithms The class APX! Some complexity classes, like PTAS and FPTAS! Illustration

More information

Minimizing Mean Flowtime and Makespan on Master-Slave Systems

Minimizing Mean Flowtime and Makespan on Master-Slave Systems Minimizing Mean Flowtime and Makespan on Master-Slave Systems Joseph Y-T. Leung,1 and Hairong Zhao 2 Department of Computer Science New Jersey Institute of Technology Newark, NJ 07102, USA Abstract The

More information

CS 6783 (Applied Algorithms) Lecture 3

CS 6783 (Applied Algorithms) Lecture 3 CS 6783 (Applied Algorithms) Lecture 3 Antonina Kolokolova January 14, 2013 1 Representative problems: brief overview of the course In this lecture we will look at several problems which, although look

More information

ONLINE SCHEDULING OF MALLEABLE PARALLEL JOBS

ONLINE SCHEDULING OF MALLEABLE PARALLEL JOBS ONLINE SCHEDULING OF MALLEABLE PARALLEL JOBS Richard A. Dutton and Weizhen Mao Department of Computer Science The College of William and Mary P.O. Box 795 Williamsburg, VA 2317-795, USA email: {radutt,wm}@cs.wm.edu

More information

Loop Scheduling and Software Pipelining \course\cpeg421-08s\topic-7.ppt 1

Loop Scheduling and Software Pipelining \course\cpeg421-08s\topic-7.ppt 1 Loop Scheduling and Software Pipelining 2008-04-24 \course\cpeg421-08s\topic-7.ppt 1 Reading List Slides: Topic 7 and 7a Other papers as assigned in class or homework: 2008-04-24 \course\cpeg421-08s\topic-7.ppt

More information

Open Problems in Throughput Scheduling

Open Problems in Throughput Scheduling Open Problems in Throughput Scheduling Jiří Sgall Computer Science Institute of Charles University, Faculty of Mathematics and Physics, Malostranské nám. 25, CZ-11800 Praha 1, Czech Republic. sgall@iuuk.mff.cuni.cz

More information

Polynomial Time Algorithms for Minimum Energy Scheduling

Polynomial Time Algorithms for Minimum Energy Scheduling Polynomial Time Algorithms for Minimum Energy Scheduling Philippe Baptiste 1, Marek Chrobak 2, and Christoph Dürr 1 1 CNRS, LIX UMR 7161, Ecole Polytechnique 91128 Palaiseau, France. Supported by CNRS/NSF

More information

A lower bound on deterministic online algorithms for scheduling on related machines without preemption

A lower bound on deterministic online algorithms for scheduling on related machines without preemption Theory of Computing Systems manuscript No. (will be inserted by the editor) A lower bound on deterministic online algorithms for scheduling on related machines without preemption Tomáš Ebenlendr Jiří Sgall

More information

Real-time Scheduling of Periodic Tasks (2) Advanced Operating Systems Lecture 3

Real-time Scheduling of Periodic Tasks (2) Advanced Operating Systems Lecture 3 Real-time Scheduling of Periodic Tasks (2) Advanced Operating Systems Lecture 3 Lecture Outline The rate monotonic algorithm (cont d) Maximum utilisation test The deadline monotonic algorithm The earliest

More information

Scheduling Parallel Iterative Applications on Volatile Resources

Scheduling Parallel Iterative Applications on Volatile Resources Scheduling Parallel Iterative Applications on Volatile Resources Henry Casanova, Fanny Dufossé, Yves Robert and Frédéric Vivien Ecole Normale Supérieure de Lyon and University of Hawai i at Mānoa October

More information

4. How to prove a problem is NPC

4. How to prove a problem is NPC The reducibility relation T is transitive, i.e, A T B and B T C imply A T C Therefore, to prove that a problem A is NPC: (1) show that A NP (2) choose some known NPC problem B define a polynomial transformation

More information

CIS 4930/6930: Principles of Cyber-Physical Systems

CIS 4930/6930: Principles of Cyber-Physical Systems CIS 4930/6930: Principles of Cyber-Physical Systems Chapter 11 Scheduling Hao Zheng Department of Computer Science and Engineering University of South Florida H. Zheng (CSE USF) CIS 4930/6930: Principles

More information

Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2

Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2 Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2 Lecture Outline Scheduling periodic tasks The rate monotonic algorithm Definition Non-optimality Time-demand analysis...!2

More information

Slack Reclamation for Real-Time Task Scheduling over Dynamic Voltage Scaling Multiprocessors

Slack Reclamation for Real-Time Task Scheduling over Dynamic Voltage Scaling Multiprocessors Slack Reclamation for Real-Time Task Scheduling over Dynamic Voltage Scaling Multiprocessors Jian-Jia Chen, Chuan-Yue Yang, and Tei-Wei Kuo Department of Computer Science and Information Engineering Graduate

More information

Failure Tolerance of Multicore Real-Time Systems scheduled by a Pfair Algorithm

Failure Tolerance of Multicore Real-Time Systems scheduled by a Pfair Algorithm Failure Tolerance of Multicore Real-Time Systems scheduled by a Pfair Algorithm Yves MOUAFO Supervisors A. CHOQUET-GENIET, G. LARGETEAU-SKAPIN OUTLINES 2 1. Context and Problematic 2. State of the art

More information

Approximation Schemes for Scheduling on Parallel Machines

Approximation Schemes for Scheduling on Parallel Machines Approximation Schemes for Scheduling on Parallel Machines Noga Alon Yossi Azar Gerhard J. Woeginger Tal Yadid Abstract We discuss scheduling problems with m identical machines and n jobs where each job

More information

Reliability-aware Thermal Management for Hard Real-time Applications on Multi-core Processors

Reliability-aware Thermal Management for Hard Real-time Applications on Multi-core Processors Reliability-aware Thermal Management for Hard Real-time Applications on Multi-core Processors Vinay Hanumaiah Electrical Engineering Department Arizona State University, Tempe, USA Email: vinayh@asu.edu

More information

Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints

Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints Average-Case Performance Analysis of Online Non-clairvoyant Scheduling of Parallel Tasks with Precedence Constraints Keqin Li Department of Computer Science State University of New York New Paltz, New

More information

Online Interval Coloring and Variants

Online Interval Coloring and Variants Online Interval Coloring and Variants Leah Epstein 1, and Meital Levy 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. Email: lea@math.haifa.ac.il School of Computer Science, Tel-Aviv

More information

Approximation Algorithms (Load Balancing)

Approximation Algorithms (Load Balancing) July 6, 204 Problem Definition : We are given a set of n jobs {J, J 2,..., J n }. Each job J i has a processing time t i 0. We are given m identical machines. Problem Definition : We are given a set of

More information

Resource Management in Machine Scheduling Problems: A Survey

Resource Management in Machine Scheduling Problems: A Survey Decision Making in Manufacturing and Services Vol. 1 2007 No. 1 2 pp. 59 89 Resource Management in Machine Scheduling Problems: A Survey Adam Janiak,WładysławJaniak, Maciej Lichtenstein Abstract. The paper

More information

Checkpoint Scheduling

Checkpoint Scheduling Checkpoint Scheduling Henri Casanova 1,2 1 Associate Professor Department of Information and Computer Science University of Hawai i at Manoa, U.S.A. 2 Visiting Associate Professor National Institute of

More information

Scheduling Parallel Iterative Applications on Volatile Resources

Scheduling Parallel Iterative Applications on Volatile Resources Scheduling Parallel Iterative Applications on Volatile Resources Henri Casanova University of Hawai i at Mānoa, USA henric@hawaiiedu Fanny Dufossé, Yves Robert, Frédéric Vivien Ecole Normale Supérieure

More information

Embedded Systems 15. REVIEW: Aperiodic scheduling. C i J i 0 a i s i f i d i

Embedded Systems 15. REVIEW: Aperiodic scheduling. C i J i 0 a i s i f i d i Embedded Systems 15-1 - REVIEW: Aperiodic scheduling C i J i 0 a i s i f i d i Given: A set of non-periodic tasks {J 1,, J n } with arrival times a i, deadlines d i, computation times C i precedence constraints

More information

Static Load-Balancing Techniques for Iterative Computations on Heterogeneous Clusters

Static Load-Balancing Techniques for Iterative Computations on Heterogeneous Clusters Static Load-Balancing Techniques for Iterative Computations on Heterogeneous Clusters Hélène Renard, Yves Robert, and Frédéric Vivien LIP, UMR CNRS-INRIA-UCBL 5668 ENS Lyon, France {Helene.Renard Yves.Robert

More information

Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems 1

Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems 1 Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems 1 Vishnu Swaminathan and Krishnendu Chakrabarty Department of Electrical and Computer Engineering Duke University 130 Hudson

More information

Analysis of the Tradeoffs between Energy and Run Time for Multilevel Checkpointing

Analysis of the Tradeoffs between Energy and Run Time for Multilevel Checkpointing Analysis of the Tradeoffs between Energy and Run Time for Multilevel Checkpointing Prasanna Balaprakash, Leonardo A. Bautista Gomez, Slim Bouguerra, Stefan M. Wild, Franck Cappello, and Paul D. Hovland

More information

Distributed Optimization. Song Chong EE, KAIST

Distributed Optimization. Song Chong EE, KAIST Distributed Optimization Song Chong EE, KAIST songchong@kaist.edu Dynamic Programming for Path Planning A path-planning problem consists of a weighted directed graph with a set of n nodes N, directed links

More information

Fault Tolerate Linear Algebra: Survive Fail-Stop Failures without Checkpointing

Fault Tolerate Linear Algebra: Survive Fail-Stop Failures without Checkpointing 20 Years of Innovative Computing Knoxville, Tennessee March 26 th, 200 Fault Tolerate Linear Algebra: Survive Fail-Stop Failures without Checkpointing Zizhong (Jeffrey) Chen zchen@mines.edu Colorado School

More information

Energy-aware scheduling for GreenIT in large-scale distributed systems

Energy-aware scheduling for GreenIT in large-scale distributed systems Energy-aware scheduling for GreenIT in large-scale distributed systems 1 PASCAL BOUVRY UNIVERSITY OF LUXEMBOURG GreenIT CORE/FNR project Context and Motivation Outline 2 Problem Description Proposed Solution

More information

Non-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions

Non-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions Non-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions Mitra Nasri Chair of Real-time Systems, Technische Universität Kaiserslautern, Germany nasri@eit.uni-kl.de

More information

New Theory and Algorithms for Scheduling Arc Shutdown Jobs in Networks

New Theory and Algorithms for Scheduling Arc Shutdown Jobs in Networks New Theory and Algorithms for Scheduling Arc Shutdown Jobs in Networks Patrick Andersen February 27, 2014 This project explores a recently developed type of scheduling problem that combines the two Operations

More information

Saving Energy in Sparse and Dense Linear Algebra Computations

Saving Energy in Sparse and Dense Linear Algebra Computations Saving Energy in Sparse and Dense Linear Algebra Computations P. Alonso, M. F. Dolz, F. Igual, R. Mayo, E. S. Quintana-Ortí, V. Roca Univ. Politécnica Univ. Jaume I The Univ. of Texas de Valencia, Spain

More information

Che-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University

Che-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University Che-Wei Chang chewei@mail.cgu.edu.tw Department of Computer Science and Information Engineering, Chang Gung University } 2017/11/15 Midterm } 2017/11/22 Final Project Announcement 2 1. Introduction 2.

More information

Algorithms. NP -Complete Problems. Dong Kyue Kim Hanyang University

Algorithms. NP -Complete Problems. Dong Kyue Kim Hanyang University Algorithms NP -Complete Problems Dong Kyue Kim Hanyang University dqkim@hanyang.ac.kr The Class P Definition 13.2 Polynomially bounded An algorithm is said to be polynomially bounded if its worst-case

More information

Minimizing the total flow-time on a single machine with an unavailability period

Minimizing the total flow-time on a single machine with an unavailability period Minimizing the total flow-time on a single machine with an unavailability period Julien Moncel (LAAS-CNRS, Toulouse France) Jérémie Thiery (DIAGMA Supply Chain, Paris France) Ariel Waserhole (G-SCOP, Grenoble

More information

Divisible Load Scheduling

Divisible Load Scheduling Divisible Load Scheduling Henri Casanova 1,2 1 Associate Professor Department of Information and Computer Science University of Hawai i at Manoa, U.S.A. 2 Visiting Associate Professor National Institute

More information

Lecture 6. Real-Time Systems. Dynamic Priority Scheduling

Lecture 6. Real-Time Systems. Dynamic Priority Scheduling Real-Time Systems Lecture 6 Dynamic Priority Scheduling Online scheduling with dynamic priorities: Earliest Deadline First scheduling CPU utilization bound Optimality and comparison with RM: Schedulability

More information

Solving Fuzzy PERT Using Gradual Real Numbers

Solving Fuzzy PERT Using Gradual Real Numbers Solving Fuzzy PERT Using Gradual Real Numbers Jérôme FORTIN a, Didier DUBOIS a, a IRIT/UPS 8 route de Narbonne, 3062, Toulouse, cedex 4, France, e-mail: {fortin, dubois}@irit.fr Abstract. From a set of

More information

Designing Competitive Online Algorithms via a Primal-Dual Approach. Niv Buchbinder

Designing Competitive Online Algorithms via a Primal-Dual Approach. Niv Buchbinder Designing Competitive Online Algorithms via a Primal-Dual Approach Niv Buchbinder Designing Competitive Online Algorithms via a Primal-Dual Approach Research Thesis Submitted in Partial Fulfillment of

More information

EDF and RM Multiprocessor Scheduling Algorithms: Survey and Performance Evaluation

EDF and RM Multiprocessor Scheduling Algorithms: Survey and Performance Evaluation 1 EDF and RM Multiprocessor Scheduling Algorithms: Survey and Performance Evaluation Omar U. Pereira Zapata, Pedro Mejía Alvarez CINVESTAV-IPN, Sección de Computación Av. I.P.N. 258, Zacatenco, México,

More information

Preemptive Online Scheduling: Optimal Algorithms for All Speeds

Preemptive Online Scheduling: Optimal Algorithms for All Speeds Preemptive Online Scheduling: Optimal Algorithms for All Speeds Tomáš Ebenlendr Wojciech Jawor Jiří Sgall Abstract Our main result is an optimal online algorithm for preemptive scheduling on uniformly

More information

Real-Time Systems. Event-Driven Scheduling

Real-Time Systems. Event-Driven Scheduling Real-Time Systems Event-Driven Scheduling Marcus Völp, Hermann Härtig WS 2013/14 Outline mostly following Jane Liu, Real-Time Systems Principles Scheduling EDF and LST as dynamic scheduling methods Fixed

More information

Scheduling with Constraint Programming. Job Shop Cumulative Job Shop

Scheduling with Constraint Programming. Job Shop Cumulative Job Shop Scheduling with Constraint Programming Job Shop Cumulative Job Shop CP vs MIP: Task Sequencing We need to sequence a set of tasks on a machine Each task i has a specific fixed processing time p i Each

More information

Saving Energy in the LU Factorization with Partial Pivoting on Multi-Core Processors

Saving Energy in the LU Factorization with Partial Pivoting on Multi-Core Processors 20th Euromicro International Conference on Parallel, Distributed and Network-Based Special Session on Energy-aware Systems Saving Energy in the on Multi-Core Processors Pedro Alonso 1, Manuel F. Dolz 2,

More information

Tradeoff between Reliability and Power Management

Tradeoff between Reliability and Power Management Tradeoff between Reliability and Power Management 9/1/2005 FORGE Lee, Kyoungwoo Contents 1. Overview of relationship between reliability and power management 2. Dakai Zhu, Rami Melhem and Daniel Moss e,

More information

Design and Analysis of Algorithms

Design and Analysis of Algorithms CSE 0, Winter 08 Design and Analysis of Algorithms Lecture 8: Consolidation # (DP, Greed, NP-C, Flow) Class URL: http://vlsicad.ucsd.edu/courses/cse0-w8/ Followup on IGO, Annealing Iterative Global Optimization

More information

COSC 341: Lecture 25 Coping with NP-hardness (2)

COSC 341: Lecture 25 Coping with NP-hardness (2) 1 Introduction Figure 1: Famous cartoon by Garey and Johnson, 1979 We have seen the definition of a constant factor approximation algorithm. The following is something even better. 2 Approximation Schemes

More information

Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems

Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems Vishnu Swaminathan and Krishnendu Chakrabarty Department of Electrical & Computer Engineering Duke University Durham,

More information

Task assignment in heterogeneous multiprocessor platforms

Task assignment in heterogeneous multiprocessor platforms Task assignment in heterogeneous multiprocessor platforms Sanjoy K. Baruah Shelby Funk The University of North Carolina Abstract In the partitioned approach to scheduling periodic tasks upon multiprocessors,

More information

Batch delivery scheduling with simple linear deterioration on a single machine 1

Batch delivery scheduling with simple linear deterioration on a single machine 1 Acta Technica 61, No. 4A/2016, 281 290 c 2017 Institute of Thermomechanics CAS, v.v.i. Batch delivery scheduling with simple linear deterioration on a single machine 1 Juan Zou 2,3 Abstract. Several single

More information

There are three priority driven approaches that we will look at

There are three priority driven approaches that we will look at Priority Driven Approaches There are three priority driven approaches that we will look at Earliest-Deadline-First (EDF) Least-Slack-Time-first (LST) Latest-Release-Time-first (LRT) 1 EDF Earliest deadline

More information