A Tighter Analysis of Work Stealing
|
|
- Emerald Walsh
- 5 years ago
- Views:
Transcription
1 A Tighter Analysis of Work Stealing Marc Tchiboukdjian Nicolas Gast Denis Trystram Jean-Louis Roch Julien Bernard Laboratoire d Informatique de Grenoble INRIA Marc Tchiboukdjian A Tighter Analysis of Work Stealing 1/18
2 Parallel programming with task parallel libraries Fib(n) { if ( n <= 1 ) return n ; else { x = spawn Fib(n-1) ; y = Fib(n-2) ; sync ; return x+y ; } } online scheduler Shared Memory C 1 C 2 C 3 C 4 m processors Work W =17 Depth D=9 The new standard for parallel programming? Cilk, Intel TBB, Microsoft TPL, KAAPI,... Marc Tchiboukdjian A Tighter Analysis of Work Stealing 2/18
3 Efficiently schedule task parallel programs List scheduling Greedy scheduler: when tasks are available, no processor is idle C max W ( m ) D m core 1 core 2 core 3 core 4 Marc Tchiboukdjian A Tighter Analysis of Work Stealing 3/18
4 Efficiently schedule task parallel programs List scheduling Greedy scheduler: when tasks are available, no processor is idle C max W ( m ) D m core 1 core 2 core 3 core 4 Problem: contention on the list Marc Tchiboukdjian A Tighter Analysis of Work Stealing 3/18
5 Efficiently schedule task parallel programs List scheduling Greedy scheduler: when tasks are available, no processor is idle C max W ( m ) D m core 1 core 2 core 3 core 4 Problem: contention on the list Work stealing Each processor has its own list When empty, it tries to steal tasks in others lists u.a.r Contention is reduced: only when several thieves target same victim steal core 1 core 2 core 3 core 4 Marc Tchiboukdjian A Tighter Analysis of Work Stealing 3/18
6 Previous Work on Work Stealing Work generation is probabilist, focus on steady state results [Mitzenmacher 98, Berenbrink et al. 03] Study of the makespan on identical processors [Blumofe Leiserson 99, Arora Blumofe Plaxton 01] Extended to processors with varying speeds [Bender Rabin 02] Marc Tchiboukdjian A Tighter Analysis of Work Stealing 4/18
7 Work Stealing Scheduler of Arora Blumofe Plaxton running task ready task stolen task executed task steal steal thief Unit tasks, one source, out-degree at most 2 Execute depth-first and steal breadth-first Analysis based on critical path work queue... E[C max ] W m + 32 D { P C max W m + 64 D + 16 log 2 1 } ɛ ɛ pop worker Marc Tchiboukdjian A Tighter Analysis of Work Stealing 5/18 push
8 Why a new analysis of work stealing? Analysis of Arora, Blumofe, Plaxton DAG with only 1 source and out-degree at most 2 (does not cover independent tasks) Fixed steal policy (task at the top of the deque) Big constant factor New analysis Apply to several application models: independent tasks, ABP DAG, unrestricted DAG Can model different steal policies: standard steal, cooperative steal More accurate Marc Tchiboukdjian A Tighter Analysis of Work Stealing 6/18
9 Remaining of the talk 1 Proof methodology 2 Example of unit independent tasks 3 Conclusions Marc Tchiboukdjian A Tighter Analysis of Work Stealing 7/18
10 Proof based on load balancing processor j steals processor i w i (t) w i (t + 1) w j (t + 1) Each processor owns some amount of work w i (t) After a steal operation from processor j to processor i, some work is transfered from i to j (e.g. one half): max{w j (t + 1), w i (t + 1)} ρ w i (t) (with ρ < 1) Marc Tchiboukdjian A Tighter Analysis of Work Stealing 8/18
11 Potential Function Φ: Motivation Gantt chart with 25 processors and 2000 unit tasks White: execution Grey: steal Difficult to see any structure due to the random choices Potential function decreasing at each successful steal Bound number of steals S to bound C max m C max = W + S Marc Tchiboukdjian A Tighter Analysis of Work Stealing 9/18
12 Potential Function Φ: Definition Definition Φ(t) = 1 i m ( w i (t) w(t) m Φ represents how well the load is balanced between the lists ) 2 w(t) m w i (t) w(t) m Marc Tchiboukdjian A Tighter Analysis of Work Stealing 10/18
13 Potential Function Φ: Properties Φ(t) = 1 Φ = 0 = no more steals 1 i m ( w i (t) w(t) m ) 2 2 i, w i w i c = Φ = 0 c 3 Idle processor i steals half of the work of active processor j = Φ = w j 2 2 Marc Tchiboukdjian A Tighter Analysis of Work Stealing 11/
14 Proof Methodology 1 Compute the expected decrease of the potential in one step when α t processors are active and m α t are stealing E[Φ t Φ t+1 Φ t ] h(α t ) Φ t 2 Solve the equation to bound the number of steals S E[S] λ m log 2 Φ 0 { ( 1 )} P S λ m log 2 Φ 0 + log 2 ɛ ɛ 3 Deduce a bound on the execution time E[C max ] W m + λ log 2 Φ 0 with λ = max 1 α m m α m log 2 (1 h(α)) Marc Tchiboukdjian A Tighter Analysis of Work Stealing 12/18
15 Example: unit independent tasks Remainder w i (t): number of tasks on processor i at time t w(t): total number of tasks at time t steal half of the tasks if several thieves target the same victim, only one succeed First step: expected decrease of the potential Φ t = 1 i m ( Φ t = Φ t Φ t+1 = w i (t) w(t) m ) 2 = active processors 1 i m w 2 i (t) w 2 (t) m δ i (t) 1 m w 2 (t) w 2 (t) = w 2 (t) (w(t) α t ) 2 = 2α t w(t) α 2 t Marc Tchiboukdjian A Tighter Analysis of Work Stealing 13/18
16 Expected decrease of Φ in one step If processor i is not stolen, one unit of work is executed δ i (t) = w 2 i (t) w 2 i (t + 1) = w 2 i (t) (w i (t) 1) 2 = 2w i (t) 1 Marc Tchiboukdjian A Tighter Analysis of Work Stealing 14/18
17 Expected decrease of Φ in one step If processor i is not stolen, one unit of work is executed δ i (t) = w 2 i (t) w 2 i (t + 1) = w 2 i (t) (w i (t) 1) 2 = 2w i (t) 1 If processor j steals half of the work of processor i δ i (t) = wi 2 (t) wi 2 (t + 1) wj 2 (t + 1) ( = wi 2 wi (t) ) 2 ( wi (t) (t) = w i 2(t) + w i (t) 1 2 ) 2 Marc Tchiboukdjian A Tighter Analysis of Work Stealing 14/18
18 Expected decrease of Φ in one step Expected decrease on active processor i { } E[δ i (t)] = P processor i is not stolen ( ) 2w i (t) 1 { } ( w 2 + P processor i is stolen i (t) ) + w i (t) 1 2 As there are m α t idle processors attempting to steal, { } ( P processor i is stolen = p(α t ) = ) m αt m 1 Summing δ i on all active processors, we get E[ Φ t Φ t ] p(α t) 2 Φ t Marc Tchiboukdjian A Tighter Analysis of Work Stealing 15/18
19 Unit independent tasks: result Expected decrease of the potential in one step Solve the equation E[ Φ t Φ t ] p(α t) 2 Φ t E[S] λ m log 2 Φ 0 + m 1 with λ = Bound on the makespan 1 1 log 2 (1 + 1 e ) E[C max ] W m + λ log 2 Φ W m log 2 W + 1 Results from simulation 2.37 log 2 W (gap: adversary choosing α t ) Marc Tchiboukdjian A Tighter Analysis of Work Stealing 16/18
20 Cooperative Stealing Standard steal: if several thieves target the same victim, only one succeed Cooperative steal: all thieves targeting the same victim succeed to steal some work If k processors steal processor i ( δ i (t) = w i (t) 2 wi (t) 1 ) 2 k ( wi (t) ) 2 ( 1 1 ) w i (t) 2 k + 1 k + 1 k + 1 Same analysis leads to E[C coop max ] W m + 2 log 2 (1 1 e ) log 2 W +1 W m log 2 W +1 20% less steals Marc Tchiboukdjian A Tighter Analysis of Work Stealing 17/18
21 Conclusion Work stealing analysis Introduced a new technique based on a potential function Accurate Can modify the steal policy Not in the paper Improved constant factor for ABP DAG W Arora, Blumofe, Plaxton: m + 32 D Our analysis: W m D + 1 Our analysis also applies to weighted independent tasks and unrestricted DAG Marc Tchiboukdjian A Tighter Analysis of Work Stealing 18/18
arxiv: v1 [cs.dc] 19 Jul 2011
DECENTRALIZED LIST SCHEDULING MARC TCHIBOUKDJIAN, NICOLAS GAST, AND DENIS TRYSTRAM arxiv:1107.3734v1 [cs.dc] 19 Jul 2011 ABSTRACT. Classical list scheduling is a very popular and efficient technique for
More informationWork Stealing with Parallelism Feedback
Work Stealing with Parallelism Feedback Kunal Agrawal Yuxiong He Charles E. Leiserson Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge, MA 02139,
More informationProvably Efficient Two-Level Adaptive Scheduling
Provably Efficient Two-Level Adaptive Scheduling Yuxiong He 1, Wen-Jing Hsu 1, and Charles E. Leiserson 2 1 Nanyang Technological University, Nanyang Avenue 639798, Singapore, yxhe@mit.edu, hsu@ntu.edu.sg
More informationAdaptive Work Stealing with Parallelism Feedback
Adaptive Work Stealing with Parallelism Feedback Kunal Agrawal Yuxiong He Wen Jing Hsu Charles E. Leiserson Massachusetts Institute of Technology Nanyang Technological University Multiprocessor scheduling
More informationList Scheduling: The Price of Distribution
List Scheduling: The Price of Distribution Marc Tchiboukdjian, Denis Trystra, Jean-Louis Roch, Julien Bernard To cite this version: Marc Tchiboukdjian, Denis Trystra, Jean-Louis Roch, Julien Bernard. List
More informationWork Stealing with Parallelism Feedback
Work Stealing with Parallelism Feedback Kunal Agrawal Yuxiong He Charles E. Leiserson Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge, MA 02139,
More informationMulti-threading model
Multi-threading model High level model of thread processes using spawn and sync. Does not consider the underlying hardware. Algorithm Algorithm-A begin { } spawn Algorithm-B do Algorithm-B in parallel
More informationOn 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 informationScheduling Parallel DAG Jobs Online to Minimize Average Flow Time
Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time Kunal Agrawal Jing Li Kefu Lu Benjamin Moseley July 8, 205 Abstract In this work, we study the problem of scheduling parallelizable jobs
More informationA Mean Field Model of Work Stealing in Large-Scale Systems
A Mean Field Model of Work Stealing in Large-Scale Systems ABSTRACT Nicolas Gast Grenoble University and LIG 5, avenue Jean Kuntzmann Montbonnont, France nicolas.gast@imag.fr In this paper, we consider
More informationRevisiting the Cache Miss Analysis of Multithreaded Algorithms
Revisiting the Cache Miss Analysis of Multithreaded Algorithms Richard Cole Vijaya Ramachandran September 19, 2012 Abstract This paper concerns the cache miss analysis of algorithms when scheduled in work-stealing
More informationA Generic Mean Field Model for Optimization in Large-scale Stochastic Systems and Applications in Scheduling
A Generic Mean Field Model for Optimization in Large-scale Stochastic Systems and Applications in Scheduling Nicolas Gast Bruno Gaujal Grenoble University Knoxville, May 13th-15th 2009 N. Gast (LIG) Mean
More informationScheduling 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 informationOperator assignment problem in aircraft assembly lines: a new planning approach taking into account economic and ergonomic constraints
Operator assignment problem in aircraft assembly lines: a new planning approach taking into account economic and ergonomic constraints Dmitry Arkhipov, Olga Battaïa, Julien Cegarra, Alexander Lazarev May
More informationA fast 5/2-approximation algorithm for hierarchical scheduling
A fast 5/2-approximation algorithm for hierarchical scheduling Marin Bougeret 1, Pierre-François Dutot 1, Klaus Jansen 2, Christina Otte 2, and Denis Trystram 1 1 Grenoble University 38330 Montbonnot Saint
More informationThe Cache Complexity of Multithreaded Cache Oblivious Algorithms
The Cache Complexity of Multithreaded Cache Oblivious Algorithms Matteo Frigo and Volker Strumpen IBM Austin Research Laboratory 11501 Burnet Road, Austin, TX 78758 ABSTRACT We present a technique for
More informationPeriodic I/O Scheduling for Supercomputers
Periodic I/O Scheduling for Supercomputers Guillaume Aupy 1, Ana Gainaru 2, Valentin Le Fèvre 3 1 Inria & U. of Bordeaux 2 Vanderbilt University 3 ENS Lyon & Inria PMBS Workshop, November 217 Slides available
More informationTDDB68 Concurrent programming and operating systems. Lecture: CPU Scheduling II
TDDB68 Concurrent programming and operating systems Lecture: CPU Scheduling II Mikael Asplund, Senior Lecturer Real-time Systems Laboratory Department of Computer and Information Science Copyright Notice:
More informationFederated Scheduling for Stochastic Parallel Real-time Tasks
Federated Scheduling for Stochastic Parallel Real-time Tasks Jing Li, Kunal Agrawal, Christopher Gill, and Chenyang Lu Department of Computer Science and Engineering Washington University in St. Louis
More informationAdaptive Scheduling with Parallelism Feedback
Adaptive Scheduling with Parallelism Feedback Kunal Agrawal Yuxiong He Wen Jing Hsu Charles E. Leiserson Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge,
More informationDependency Graph Approach for Multiprocessor Real-Time Synchronization. TU Dortmund, Germany
Dependency Graph Approach for Multiprocessor Real-Time Synchronization Jian-Jia Chen, Georg von der Bru ggen, Junjie Shi, and Niklas Ueter TU Dortmund, Germany 14,12,2018 at RTSS Jian-Jia Chen 1 / 21 Multiprocessor
More informationParallel Performance Theory - 1
Parallel Performance Theory - 1 Parallel Computing CIS 410/510 Department of Computer and Information Science Outline q Performance scalability q Analytical performance measures q Amdahl s law and Gustafson-Barsis
More informationP 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 informationCSCE 313 Introduction to Computer Systems. Instructor: Dezhen Song
CSCE 313 Introduction to Computer Systems Instructor: Dezhen Song Schedulers in the OS CPU Scheduling Structure of a CPU Scheduler Scheduling = Selection + Dispatching Criteria for scheduling Scheduling
More informationCommon-Deadline Lazy Bureaucrat Scheduling Problems
Common-Deadline Lazy Bureaucrat Scheduling Problems Behdad Esfahbod, Mohammad Ghodsi, and Ali Sharifi Computer Engineering Department Sharif University of Technology, Tehran, Iran, {behdad,ghodsi}@sharif.edu,
More information2/5/07 CSE 30341: Operating Systems Principles
page 1 Shortest-Job-First (SJR) Scheduling Associate with each process the length of its next CPU burst. Use these lengths to schedule the process with the shortest time Two schemes: nonpreemptive once
More informationChe-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 informationLoad Balancing in Distributed Service System: A Survey
Load Balancing in Distributed Service System: A Survey Xingyu Zhou The Ohio State University zhou.2055@osu.edu November 21, 2016 Xingyu Zhou (OSU) Load Balancing November 21, 2016 1 / 29 Introduction and
More informationReview for the Midterm Exam
Review for the Midterm Exam 1 Three Questions of the Computational Science Prelim scaled speedup network topologies work stealing 2 The in-class Spring 2012 Midterm Exam pleasingly parallel computations
More informationAverage-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 informationModule 5: CPU Scheduling
Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 5.1 Basic Concepts Maximum CPU utilization obtained
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 6.1 Basic Concepts Maximum CPU utilization obtained
More informationOptimizing 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 informationThe Natural Work-Stealing Algorithm is Stable
The Natural Work-Stealing Algorithm is Stable Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg University of Warwick Department of Computer Science Coventry CV4 7AL, UK E-mail: (petra tf leslie)@dcs.warwick.ac.uk
More informationEnergy-efficient scheduling
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
More informationAn Empirical Evaluation of Work Stealing with Parallelism Feedback
An Empirical Evaluation of Work Stealing with Parallelism Feedback Kunal Agrawal Yuxiong He Charles E. Leiserson Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology
More informationOn-line Scheduling to Minimize Max Flow Time: An Optimal Preemptive Algorithm
On-line Scheduling to Minimize Max Flow Time: An Optimal Preemptive Algorithm Christoph Ambühl and Monaldo Mastrolilli IDSIA Galleria 2, CH-6928 Manno, Switzerland October 22, 2004 Abstract We investigate
More informationMultiprocessor Scheduling II: Global Scheduling. LS 12, TU Dortmund
Multiprocessor Scheduling II: Global Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 28, June, 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 42 Global Scheduling We will only focus on identical
More informationComp 204: Computer Systems and Their Implementation. Lecture 11: Scheduling cont d
Comp 204: Computer Systems and Their Implementation Lecture 11: Scheduling cont d 1 Today Scheduling algorithms continued Shortest remaining time first (SRTF) Priority scheduling Round robin (RR) Multilevel
More informationTransparent Fault Tolerance for Scalable Functional Computation
Transparent Fault Tolerance for Scalable Functional Computation Rob Stewart 1 Patrick Maier 2 Phil Trinder 2 26 th July 2016 1 Heriot-Watt University Edinburgh 2 University of Glasgow Motivation Tolerating
More informationAnalysis of Scheduling Algorithms with Reservations
Analysis of Scheduling Algorithms with Reservations Lionel Eyraud-Dubois 2, Grégory Mounié and Denis Trystram LIG, Grenoble Universités, 2 LIP, ÉNS Lyon, ENSIMAG-montbonnot, 5 avenue Kuntzmann 46 allée
More informationA Framework for Scheduling with Online Availability
A Framework for Scheduling with Online Availability Florian Diedrich, and Ulrich M. Schwarz Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Olshausenstr. 40, 24098 Kiel, Germany {fdi,ums}@informatik.uni-kiel.de
More informationParallel Performance Theory
AMS 250: An Introduction to High Performance Computing Parallel Performance Theory Shawfeng Dong shaw@ucsc.edu (831) 502-7743 Applied Mathematics & Statistics University of California, Santa Cruz Outline
More informationA Semiconductor Wafer
M O T I V A T I O N Semi Conductor Wafer Fabs A Semiconductor Wafer Clean Oxidation PhotoLithography Photoresist Strip Ion Implantation or metal deosition Fabrication of a single oxide layer Etching MS&E324,
More informationBalanced Dense Polynomial Multiplication on Multicores
Balanced Dense Polynomial Multiplication on Multicores Yuzhen Xie SuperTech Group, CSAIL MIT joint work with Marc Moreno Maza ORCCA, UWO ACA09, Montreal, June 26, 2009 Introduction Motivation: Multicore-enabling
More informationThe Greedy Method. Design and analysis of algorithms Cs The Greedy Method
Design and analysis of algorithms Cs 3400 The Greedy Method 1 Outline and Reading The Greedy Method Technique Fractional Knapsack Problem Task Scheduling 2 The Greedy Method Technique The greedy method
More informationScheduling Parallel Jobs with Linear Speedup
Scheduling Parallel Jobs with Linear Speedup Alexander Grigoriev and Marc Uetz Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht, The Netherlands. Email: {a.grigoriev, m.uetz}@ke.unimaas.nl
More informationParallelization of Multilevel Preconditioners Constructed from Inverse-Based ILUs on Shared-Memory Multiprocessors
Parallelization of Multilevel Preconditioners Constructed from Inverse-Based ILUs on Shared-Memory Multiprocessors J.I. Aliaga 1 M. Bollhöfer 2 A.F. Martín 1 E.S. Quintana-Ortí 1 1 Deparment of Computer
More information1 Ordinary Load Balancing
Comp 260: Advanced Algorithms Prof. Lenore Cowen Tufts University, Spring 208 Scribe: Emily Davis Lecture 8: Scheduling Ordinary Load Balancing Suppose we have a set of jobs each with their own finite
More informationENHANCING CPU PERFORMANCE USING SUBCONTRARY MEAN DYNAMIC ROUND ROBIN (SMDRR) SCHEDULING ALGORITHM
ENHANCING CPU PERFORMANCE USING SUBCONTRARY MEAN DYNAMIC ROUND ROBIN (SMD) SCHEDULING ALGORITHM Sourav Kumar Bhoi *1, Sanjaya Kumar Panda 2 and Debashee Tarai 3 * 1 Department of Computer Science & Engineering,
More informationCS-206 Concurrency. Lecture 10. Scheduling & Work Distribution. Spring 2015 Prof. Babak Falsafi parsa.epfl.ch/courses/cs206/
CS-206 Concurrency Lecture 10 zzz Scheduling & Work Distribution Spring 2015 Prof. Babak Falsafi parsa.epfl.ch/courses/cs206/ Adapted from slides originally developed by Maurice Herlihy and Nir Shavit
More informationAccelerating linear algebra computations with hybrid GPU-multicore systems.
Accelerating linear algebra computations with hybrid GPU-multicore systems. Marc Baboulin INRIA/Université Paris-Sud joint work with Jack Dongarra (University of Tennessee and Oak Ridge National Laboratory)
More informationCHAPTER 5 - PROCESS SCHEDULING
CHAPTER 5 - PROCESS SCHEDULING OBJECTIVES To introduce CPU scheduling, which is the basis for multiprogrammed operating systems To describe various CPU-scheduling algorithms To discuss evaluation criteria
More informationOnline Scheduling of Parallel Jobs on Two Machines is 2-Competitive
Online Scheduling of Parallel Jobs on Two Machines is 2-Competitive J.L. Hurink and J.J. Paulus University of Twente, P.O. box 217, 7500AE Enschede, The Netherlands Abstract We consider online scheduling
More informationTask Models and Scheduling
Task Models and Scheduling Jan Reineke Saarland University June 27 th, 2013 With thanks to Jian-Jia Chen at KIT! Jan Reineke Task Models and Scheduling June 27 th, 2013 1 / 36 Task Models and Scheduling
More informationOnline Scheduling Switch for Maintaining Data Freshness in Flexible Real-Time Systems
Online Scheduling Switch for Maintaining Data Freshness in Flexible Real-Time Systems Song Han 1 Deji Chen 2 Ming Xiong 3 Aloysius K. Mok 1 1 The University of Texas at Austin 2 Emerson Process Management
More informationDynamic Time Quantum based Round Robin CPU Scheduling Algorithm
Dynamic Time Quantum based Round Robin CPU Scheduling Algorithm Yosef Berhanu Department of Computer Science University of Gondar Ethiopia Abebe Alemu Department of Computer Science University of Gondar
More informationFine Grain Quality Management
Fine Grain Quality Management Jacques Combaz Jean-Claude Fernandez Mohamad Jaber Joseph Sifakis Loïc Strus Verimag Lab. Université Joseph Fourier Grenoble, France DCS seminar, 10 June 2008, Col de Porte
More informationOutline / Reading. Greedy Method as a fundamental algorithm design technique
Greedy Method Outline / Reading Greedy Method as a fundamental algorithm design technique Application to problems of: Making change Fractional Knapsack Problem (Ch. 5.1.1) Task Scheduling (Ch. 5.1.2) Minimum
More informationLSN 15 Processor Scheduling
LSN 15 Processor Scheduling ECT362 Operating Systems Department of Engineering Technology LSN 15 Processor Scheduling LSN 15 FCFS/FIFO Scheduling Each process joins the Ready queue When the current process
More informationCHAPTER 16: SCHEDULING
CHAPTER 16: SCHEDULING Solutions: 1. Job A B C A B C 1 5 8 6 row 1 0 3 1 Worker 2 6 7 9 reduction 2 0 1 3 3 4 5 3 3 1 2 0 column reduction A B C 1 0 2 1 Optimum: 2 0 0 3 Worker 1, Job A 3 1 1 0 2 B 3 C
More informationNon-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 informationUC Santa Barbara. Operating Systems. Christopher Kruegel Department of Computer Science UC Santa Barbara
Operating Systems Christopher Kruegel Department of Computer Science http://www.cs.ucsb.edu/~chris/ Many processes to execute, but one CPU OS time-multiplexes the CPU by operating context switching Between
More informationOptimizing 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 informationPerformance comparison of aggressive push and traditional pull strategies in large distributed systems
1 Performance comparison of aggressive push and traditional pull strategies in large distributed systems Benny Van Houdt Department of Mathematics and Computer Science University of Antwerp - IBBT Middelheimlaan
More informationNotation. Bounds on Speedup. Parallel Processing. CS575 Parallel Processing
Parallel Processing CS575 Parallel Processing Lecture five: Efficiency Wim Bohm, Colorado State University Some material from Speedup vs Efficiency in Parallel Systems - Eager, Zahorjan and Lazowska IEEE
More informationSanta Claus Schedules Jobs on Unrelated Machines
Santa Claus Schedules Jobs on Unrelated Machines Ola Svensson (osven@kth.se) Royal Institute of Technology - KTH Stockholm, Sweden March 22, 2011 arxiv:1011.1168v2 [cs.ds] 21 Mar 2011 Abstract One of the
More informationThe makespan problem of scheduling multi groups of jobs on multi processors at different speeds
Algorithmic Operations Research Vol.7 (2012) 41 50 The makespan problem of scheduling multi groups of jobs on multi processors at different speeds Wei Ding Department of Mathematics, Sun Yat-sen University,
More informationHow 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 informationJournal of Global Research in Computer Science
Volume 2, No. 2, February 2011 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info Design and Performance Evaluation of Multi Cyclic Round Robin (MCRR) Algorithm
More informationMulti-core Real-Time Scheduling for Generalized Parallel Task Models
Multi-core Real-Time Scheduling for Generalized Parallel Task Models Abusayeed Saifullah, Kunal Agrawal, Chenyang Lu, and Christopher Gill Department of Computer Science and Engineering Washington University
More informationTDDI04, K. Arvidsson, IDA, Linköpings universitet CPU Scheduling. Overview: CPU Scheduling. [SGG7] Chapter 5. Basic Concepts.
TDDI4 Concurrent Programming, Operating Systems, and Real-time Operating Systems CPU Scheduling Overview: CPU Scheduling CPU bursts and I/O bursts Scheduling Criteria Scheduling Algorithms Multiprocessor
More informationCS 370. FCFS, SJF and Round Robin. Yashwanth Virupaksha and Abhishek Yeluri
CS 370 FCFS, SJF and Round Robin Yashwanth Virupaksha and Abhishek Yeluri Homework-4 Review Write a C program to demonstrate the following scheduling algorithms First Come First Serve. (20 pts) Shortest
More informationFederated Scheduling for Stochastic Parallel Real-time Tasks
Federated Scheduling for Stochastic Parallel Real-time Tasks Jing Li, Kunal Agrawal, Christopher Gill, and Chenyang Lu Department of Computer Science and Engineering Washington University in St. Louis
More informationScheduling selfish tasks: about the performance of truthful algorithms
Scheduling selfish tasks: about the performance of truthful algorithms (Regular Submission) George Christodoulou Max-Planck-Institut fr Informatik, Saarbrücken, Germany gchristo@mpi-inf.mpg.de Laurent
More informationJournal of Global Research in Computer Science
Volume 2, No. 4, April 2011 Journal of Global Research in Computer Science RESEARCH ARTICLE Available Online at www.jgrcs.info PERFORMANCE EVALUATION OF A NEW PROPOSED SHOTREST EXECUTION FIRST DYNAMIC
More informationReal-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 informationSpace-efficient scheduling of stochastically generated tasks
Space-efficient scheduling of stochastically generated tasks Tomáš Brázdil 1, Javier Esparza 2, Stefan Kiefer 3, and Michael Luttenberger 2 1 Faculty of Informatics, Masaryk University, Brno, Czech Republic
More informationALG 5.4. Lexicographical Search: Applied to Scheduling Theory. Professor John Reif
Algorithms Professor John Reif ALG 54 input assume problem Scheduling Problems Set of n tasks in precidence relation on tasks Also, given m processors Unit time cost to process task using single processor
More informationScheduling Online Algorithms. Tim Nieberg
Scheduling Online Algorithms Tim Nieberg General Introduction on-line scheduling can be seen as scheduling with incomplete information at certain points, decisions have to be made without knowing the complete
More informationScheduling 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 informationResilient 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 informationSpeed Scaling for Weighted Flow Time
Speed Scaling for Weighted Flow Time Nikhil Bansal Kirk Pruhs Cliff Stein 1 Introduction In addition to the traditional goal of efficiently managing time and space, many computers now need to efficiently
More informationScheduling problem subject to compatibility constraints
Scheduling problem subject to compatibility constraints Mohamed Bendraouche 1 and Mourad Boudhar 2 1 Faculty of Sciences, Saad Dahleb University, Route de Soumaa, BP 270, Blida, Algeria mbendraouche@yahoo.fr
More informationCPU Scheduling Exercises
CPU Scheduling Exercises NOTE: All time in these exercises are in msec. Processes P 1, P 2, P 3 arrive at the same time, but enter the job queue in the order presented in the table. Time quantum = 3 msec
More informationCoin Changing: Give change using the least number of coins. Greedy Method (Chapter 10.1) Attempt to construct an optimal solution in stages.
IV-0 Definitions Optimization Problem: Given an Optimization Function and a set of constraints, find an optimal solution. Optimal Solution: A feasible solution for which the optimization function has the
More informationScheduling Adaptively Parallel Jobs. Bin Song. Submitted to the Department of Electrical Engineering and Computer Science. Master of Science.
Scheduling Adaptively Parallel Jobs by Bin Song A. B. (Computer Science and Mathematics), Dartmouth College (996) Submitted to the Department of Electrical Engineering and Computer Science in partial fulllment
More informationA Dynamic Programming algorithm for minimizing total cost of duplication in scheduling an outtree with communication delays and duplication
A Dynamic Programming algorithm for minimizing total cost of duplication in scheduling an outtree with communication delays and duplication Claire Hanen Laboratory LIP6 4, place Jussieu F-75 252 Paris
More informationState-dependent and Energy-aware Control of Server Farm
State-dependent and Energy-aware Control of Server Farm Esa Hyytiä, Rhonda Righter and Samuli Aalto Aalto University, Finland UC Berkeley, USA First European Conference on Queueing Theory ECQT 2014 First
More informationA Note on Parallel Algorithmic Speedup Bounds
arxiv:1104.4078v1 [cs.dc] 20 Apr 2011 A Note on Parallel Algorithmic Speedup Bounds Neil J. Gunther February 8, 2011 Abstract A parallel program can be represented as a directed acyclic graph. An important
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should
More informationLecture 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 informationRecoverable Robustness in Scheduling Problems
Master Thesis Computing Science Recoverable Robustness in Scheduling Problems Author: J.M.J. Stoef (3470997) J.M.J.Stoef@uu.nl Supervisors: dr. J.A. Hoogeveen J.A.Hoogeveen@uu.nl dr. ir. J.M. van den Akker
More informationHYBRID FLOW-SHOP WITH ADJUSTMENT
K Y BERNETIKA VOLUM E 47 ( 2011), NUMBER 1, P AGES 50 59 HYBRID FLOW-SHOP WITH ADJUSTMENT Jan Pelikán The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering
More informationLast class: Today: Threads. CPU Scheduling
1 Last class: Threads Today: CPU Scheduling 2 Resource Allocation In a multiprogramming system, we need to share resources among the running processes What are the types of OS resources? Question: Which
More informationApproximation Algorithms for Scheduling with Reservations
Approximation Algorithms for Scheduling with Reservations Florian Diedrich 1,,, Klaus Jansen 1,, Fanny Pascual 2, and Denis Trystram 2, 1 Institut für Informatik, Christian-Albrechts-Universität zu Kiel,
More informationSingle Machine Models
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 8 Single Machine Models 1. Dispatching Rules 2. Single Machine Models Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Dispatching
More informationMore 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 informationEliminations and echelon forms in exact linear algebra
Eliminations and echelon forms in exact linear algebra Clément PERNET, INRIA-MOAIS, Grenoble Université, France East Coast Computer Algebra Day, University of Waterloo, ON, Canada, April 9, 2011 Clément
More informationCPU Scheduling. CPU Scheduler
CPU Scheduling These slides are created by Dr. Huang of George Mason University. Students registered in Dr. Huang s courses at GMU can make a single machine readable copy and print a single copy of each
More information