scheduling in the random order model
play

Scheduling in the Random-Order Model Susanne Albers, Maximilian - PowerPoint PPT Presentation

Sep 10, 2023 •280 likes •997 views

Scheduling in the Random-Order Model Susanne Albers, Maximilian Janke Technical University of Munich Department of Computer Science Chair of Algorithms and Complexity Makespan Minimization Task: Assign jobs to machines . 4 3.5 3.5 2 1.5 1

  1. Scheduling in the Random-Order Model Susanne Albers, Maximilian Janke Technical University of Munich Department of Computer Science Chair of Algorithms and Complexity

  2. Makespan Minimization Task: Assign jobs to machines . 4 3.5 3.5 2 1.5 1 1 1 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 2

  3. Makespan Minimization Task: Assign jobs to machines . 3.5 1.5 1 4 3.5 1 2 1 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 2

  4. Makespan Minimization Task: Assign jobs to machines . Goal: Minimize the makespan . 3.5 1.5 makespan 5.5 1 load 4.5 4 3.5 1 2 1 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 2

  5. Makespan Minimization Task: Assign jobs to machines . Goal: Minimize the makespan . 1.5 3.5 3.5 makespan 4.5 4 2 1 1 1 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 2

  6. Online Algorithm Jobs are revealed one by one and assigned immediately. 1.5 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 3

  7. Online Algorithm Jobs are revealed one by one and assigned immediately. 2 1.5 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 3

  8. Online Algorithm Jobs are revealed one by one and assigned immediately. 1 2 1.5 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 3

  9. Online Algorithm Jobs are revealed one by one and assigned immediately. 1 2 1.5 1 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 3

  10. Online Algorithm Jobs are revealed one by one and assigned immediately. 2.5 1 2 1.5 1 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 3

  11. Online Algorithm Jobs are revealed one by one and assigned immediately. 3 1 2.5 2 1.5 1 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 3

  12. Online Algorithm Jobs are revealed one by one and assigned immediately. 3 1 2.5 2 1.5 1 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 3

  13. Competitive ratio The worst ratio an adversary can cause. 3 1 1 3 1 2.5 2.5 versus 2 2 1.5 1.5 1 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 3

  14. Literature Adversarial deterministic algorithms. [Günther, Maurer, Megow and Wiese, 2013] and [Chen, Ye, Zhang, 2015] approximate the optimum online algorithm. [Rudin III, 2001] 1 . 885 1 . 9201 [Fleischer, Wahl, 2000] [Gormley et. al., 2000] 1 . 853 1 . 923 [Albers, 1999] [Albers, 1999] 1 . 852 1 . 945 [Karger, Philipps, Torng, 1996] [Bartal, Karloff, Rabani, 1994] 1 . 837 1 . 986 [Bartal, Fiat, Karloff, Vohra, 1995] 2 − 1 [Faigle, Kern, Turan, 1989] 1 . 707 m − ε m [Galambos, Woeginger, 1993] 2 − 1 / m [Graham, 1966] 1 . 5 1 . 8 1 . 9 2 4 / 3 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 4

  15. Literature Adversarial deterministic algorithms. Adversarial randomized algorithms. [Rudin III, 2001] 1 . 885 1 . 9201 [Fleischer, Wahl, 2000] [Chen, Vliet, Woeginger, 1994] 1 . 5819 [Sgall, 1997] 1 . 5819 1 . 916 [Albers, 2002] 1 . 5 1 . 8 1 . 9 2 4 / 3 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 4

  16. Literature Adversarial deterministic algorithms. Adversarial randomized algorithms. Deterministic algorithms which know OPT . (Bin Stretching) 1 . 5 [Böhm, Sgall, van Stee, Veselý, 2016] 1 . 53 [Gabay, Kotov, Brauner, 2013] [Azar, Regev, 1998] 4 / 3 1 . 57 [Kellerer, Kotov, 2013] 1 . 625 [Azar, Regev, 1998] 1 1 . 5 1 . 8 1 . 9 2 4 / 3 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 4

  17. Literature Adversarial deterministic algorithms. Adversarial randomized algorithms. Deterministic algorithms which know OPT . (Bin Stretching) Deterministic algorithms which know the total processing volume. [Albers, Hellwig, 2012] 1 . 585 1 . 585 [Kellerer, Kotov, Gabay, 2015] [Angelli, Nagy, Speranza, 2004] 1 . 565 1 . 6 [Cheng, Kellerer, Kotov, 2005] [Cheng, Kellerer, Kotov, 2005] 1 . 5 1 . 725 [Angelli, Nagy, Speranza, 2004] 1 . 75 [Albers, Hellwig, 2012] 1 1 . 5 1 . 8 1 . 9 2 4 / 3 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 4

  18. Literature Adversarial deterministic algorithms. Adversarial randomized algorithms. Deterministic algorithms which know OPT . (Bin Stretching) Deterministic algorithms which know the total processing volume. Deterministic algorithms which advice. constant in input length constant in m [Albers, Hellwig, 2013] [Dohrau, 2015] 1 1 . 5 1 . 8 1 . 9 2 4 / 3 I made some corrections here. Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 4

  19. Literature Adversarial deterministic algorithms. Adversarial randomized algorithms. Deterministic algorithms which know OPT . (Bin Stretching) Deterministic algorithms which know the total processing volume. Deterministic algorithms which advice. Buffer Reordering. 1 . 4659 [Englert, Özmen, Westermann, 2008] 1 1 . 5 1 . 8 1 . 9 2 4 / 3 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 4

  20. Literature Adversarial deterministic algorithms. Adversarial randomized algorithms. Deterministic algorithms which know OPT . (Bin Stretching) Deterministic algorithms which know the total processing volume. Deterministic algorithms which advice. Buffer Reordering. Job processing times ordered decreasingly. 1 . 25 [Cheng, Kellerer, Kotov, 2012] [Seiden et. al., 2000] 1 . 1805 4 / 3 [Graham, 1969] 1 1 . 5 1 . 8 1 . 9 2 4 / 3 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 4

  21. Literature Adversarial deterministic algorithms. Adversarial randomized algorithms. Deterministic algorithms which know OPT . (Bin Stretching) Deterministic algorithms which know the total processing volume. Deterministic algorithms which advice. Buffer Reordering. [Rudin III, 2001] 1 . 885 1 . 9201 [Fleischer, Wahl, 2000] [Gormley et. al., 2000] 1 . 853 1 . 923 [Albers, 1999] [Albers, 1999] 1 . 852 1 . 945 [Karger, Philipps, Torng, 1996] [Bartal, Karloff, Rabani, 1994] 1 . 837 1 . 986 [Bartal, Fiat, Karloff, Vohra, 1995] 2 − 1 [Faigle, Kern, Turan, 1989] 1 . 707 m − ε m [Galambos, Woeginger, 1993] 2 − 1 / m [Graham, 1966] 1 . 5 1 . 8 1 . 9 2 4 / 3 Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 4

  22. Is worst-case analysis too pessimistic? (Lower bound of [Albers, 1999] for m = 40 machines.) Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 5

  23. Is worst-case analysis too pessimistic? (Lower bound of [Albers, 1999] for m = 40 machines.) The argument of Albers does not hold anymore if we • Delete any job. (The lower bound would be 1 . 714) Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 5

  24. Is worst-case analysis too pessimistic? (Lower bound of [Albers, 1999] for m = 40 machines.) The argument of Albers does not hold anymore if we • Delete any job. • Swap (non-identical) jobs. Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 5

  25. Is worst-case analysis too pessimistic? (Lower bound of [Albers, 1999] for m = 40 machines.) The argument of Albers does not hold anymore if we • Delete any job. • Swap (non-identical) jobs. • Change a job size significantly. Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 5

  26. Is worst-case analysis too pessimistic? (Lower bound of [Albers, 1999] for m = 40 machines.) The argument of Albers does not hold anymore if we • Swap (non-identical) jobs. How important is job order? Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 5

  27. Random-Order Analysis (Random permutation of [Albers, 1999] for m = 40 machines.) Adversary chooses job set , order is uniformly random . Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 6

  28. Random-Order Analysis (Random permutation of [Albers, 1999] for m = 40 machines.) Adversary chooses job set , order is uniformly random . Expected makespan of A versus optimum makespan . Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 7

  29. Random-Order Analysis (Random permutation of [Albers, 1999] for m = 40 machines.) Adversary chooses job set , order is uniformly random . Expected makespan of A versus optimum makespan . Competitive ratio: Worst ratio the adversary may cause. Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 8

  30. Is Random-Order Analysis too optimistic? Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 9

  31. Is Random-Order Analysis too optimistic? We are nearly c-competitive iff we are ( c + o m ( 1 )) -competitive with probability 1 − o m ( 1 ) after random permutation and have a constant competitive ratio on worst-case sequences. Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 10

  32. Is Random-Order Analysis too optimistic? We are nearly c-competitive iff we are ( c + o m ( 1 )) -competitive with probability 1 − o m ( 1 ) after random permutation and have a constant competitive ratio on worst-case sequences. A nearly c-competitive online algorithm is c-competitive in the random-order model for m → ∞ . Maximilian Janke (TUM) | OLAWA 2020 | Scheduling in the Random-Order Model 11

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Random first-order transition of a spin glass model in three dimensions Toward a mean-field

Random first-order transition of a spin glass model in three dimensions Toward a mean-field

Random first-order transition of a spin glass model in three dimensions Toward a mean-field theory for glass transitions Koji Hukushima University of Tokyo, Dep. of Basic Sciences 14 August 2015 In collaboration with Takashi Takahasi.

534 views • 37 slides
First order phase transition for the Random Cluster model with q > 4 Ioan Manolescu joint work

First order phase transition for the Random Cluster model with q > 4 Ioan Manolescu joint work

First order phase transition for the Random Cluster model with q > 4 Ioan Manolescu joint work with: Hugo Duminil-Copin, Maxime Gagnebin, Matan Harel, Vincent Tassion University of Fribourg 14th February 2017 Diablerets Ioan Manolescu

830 views • 81 slides
Cooperative Multicast Scheduling with Random Network Coding in WiMAX Jin Jin, Baochun Li,

Cooperative Multicast Scheduling with Random Network Coding in WiMAX Jin Jin, Baochun Li,

Cooperative Multicast Scheduling with Random Network Coding in WiMAX Jin Jin, Baochun Li, Department of Electrical Computer Engineering University of Toronto WiMAX MBS IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in

856 views • 53 slides
Scheduling Algorithm and Analysis Model and Cyclic Scheduling (Module 27) Yann-Hang Lee Arizona

Scheduling Algorithm and Analysis Model and Cyclic Scheduling (Module 27) Yann-Hang Lee Arizona

Scheduling Algorithm and Analysis Model and Cyclic Scheduling (Module 27) Yann-Hang Lee Arizona State University yhlee@asu.edu (480) 727-7507 Summer 2014 Real-time Systems Lab, Computer Science and Engineering, ASU Task Scheduling

501 views • 8 slides
Data Streams: Random Order & Multiple Passes 2009 Barbados Workshop on Computational

Data Streams: Random Order & Multiple Passes 2009 Barbados Workshop on Computational

Data Streams: Random Order & Multiple Passes 2009 Barbados Workshop on Computational Complexity Andrew McGregor Introduction Random Order Streams: Average case analysis: data is worst-case but order is random. Lower bounds are more

1.27k views • 84 slides
Instruction scheduling However, that order is usually not the only valid one, in the sense that

Instruction scheduling However, that order is usually not the only valid one, in the sense that

Instruction ordering When a compiler emits the instructions corresponding to a program, it imposes a total order on them. Instruction scheduling However, that order is usually not the only valid one, in the sense that it can be changed without

209 views • 3 slides
Real-Time Scheduling slides: P. Puschner Scheduling Task Model Assumptions about task timing,

Real-Time Scheduling slides: P. Puschner Scheduling Task Model Assumptions about task timing,

Real-Time Scheduling slides: P. Puschner Scheduling Task Model Assumptions about task timing, interaction Scheduling Algorithm Scheduling mode and selection function Schedulability Test Prediction of worst-case behavior 2 Real-Time

519 views • 40 slides
execution states with swapping Scheduling 3F. Execution State Model exit running 4A.

execution states with swapping Scheduling 3F. Execution State Model exit running 4A.

4/14/2017 execution states with swapping Scheduling 3F. Execution State Model exit running 4A. Introduction to Scheduling create 4B. Non-Preemptive Scheduling request 4C. Preemptive Scheduling allocate blocked ready 4D. Dynamic

306 views • 8 slides
Lower Bounds for Quantile Estimation in Random-Order and Multi-Pass Streams Sudipto Guha (UPenn)

Lower Bounds for Quantile Estimation in Random-Order and Multi-Pass Streams Sudipto Guha (UPenn)

Lower Bounds for Quantile Estimation in Random-Order and Multi-Pass Streams Sudipto Guha (UPenn) Andrew McGregor (UCSD) Data Stream Model Data Stream Model Stream: m elements from a universe of size n :

991 views • 82 slides
Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service

Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service

Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations Siqian Shen Department of Industrial and Operations Engineering University of Michigan joint work with Ruiwei Jiang and Yiling Zhang (PhD

803 views • 41 slides
Outline Math Programming DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Scheduling CPM/PERT

Outline Math Programming DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Scheduling CPM/PERT

Scheduling Outline Math Programming DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Scheduling CPM/PERT Resource Constrained Project Scheduling Model Lecture 3 RCPSP and Mixed Integer Programming 2. Mathematical Programming Introduction

478 views • 10 slides
The Order Up-To Inventory Model Inventory Control Best Order Up To Level Best

The Order Up-To Inventory Model Inventory Control Best Order Up To Level Best

The Order Up-To Inventory Model Inventory Control Best Order Up To Level Best Service Level Impact of Lead Time 1 1. Medtronics InSync Pacemaker Model 7272. Implanted in a patient after a cardiac surgery. One

844 views • 19 slides
CPU Scheduling CPU Scheduling CPU Scheduling 101 CPU Scheduling 101 The CPU scheduler makes a

CPU Scheduling CPU Scheduling CPU Scheduling 101 CPU Scheduling 101 The CPU scheduler makes a

CPU Scheduling CPU Scheduling CPU Scheduling 101 CPU Scheduling 101 The CPU scheduler makes a sequence of moves that determines the interleaving of threads. Programs use synchronization to prevent bad moves. but

621 views • 22 slides
CPU Scheduling CPU Scheduling CPU Scheduling 101 CPU Scheduling 101 The CPU scheduler makes a

CPU Scheduling CPU Scheduling CPU Scheduling 101 CPU Scheduling 101 The CPU scheduler makes a

CPU Scheduling CPU Scheduling CPU Scheduling 101 CPU Scheduling 101 The CPU scheduler makes a sequence of moves that determines the interleaving of threads. Programs use synchronization to prevent bad moves. but

592 views • 29 slides
How Risky is the Random-Oracle Model? Gatan Leurent and Phong Nguy n & & France

How Risky is the Random-Oracle Model? Gatan Leurent and Phong Nguy n & & France

How Risky is the Random-Oracle Model? Gatan Leurent and Phong Nguy n & & France Aug. 19, 2009 Full version on http:/ / eprint.iacr.org/2008/ 441 Summary The Random-Oracle Model (ROM) Random-Oracle Instantiations Robustness

789 views • 48 slides
Module 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms

Module 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms

Module 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation Silberschatz, Galvin, and Gagne 1999 Applied Operating System

731 views • 36 slides
TypeScript - a look at SPA's and Angular 2 Christian Holm Diget Agenda EcmaScript 6

TypeScript - a look at SPA's and Angular 2 Christian Holm Diget Agenda EcmaScript 6

TypeScript - a look at SPA's and Angular 2 Christian Holm Diget Agenda EcmaScript 6 TypeScript Libraries: ImmutableJS + React SPA architecture Angular 2.0 EcmaScript 6/2015 Let + const function f() { { let x; { //

859 views • 48 slides
Polymorphism and interfaces QUIZ QUIZ Definition of Interface Which lines are legal public

Polymorphism and interfaces QUIZ QUIZ Definition of Interface Which lines are legal public

Polymorphism and interfaces QUIZ QUIZ Definition of Interface Which lines are legal public interface Car { components of an interface? A. private int speed; 1. A B. public void speedUp() {speed++;} 2. B 3. C C. public void

281 views • 15 slides
Lecture 7 Public Key Cryptography (Diffie-Hellman and RSA) 1 Public Key Cryptography

Lecture 7 Public Key Cryptography (Diffie-Hellman and RSA) 1 Public Key Cryptography

Lecture 7 Public Key Cryptography (Diffie-Hellman and RSA) 1 Public Key Cryptography Asymmetric cryptography Invented in 1974-1978 (Diffie-Hellman and Rivest-Shamir- Adleman) Two keys: private (SK), public (PK) Encryption:

810 views • 42 slides
SOCI 210: Sociological Perspectives Oct. 13 1. Inequality & mobility 2. Social divisions and

SOCI 210: Sociological Perspectives Oct. 13 1. Inequality & mobility 2. Social divisions and

SOCI 210: Sociological Perspectives Oct. 13 1. Inequality & mobility 2. Social divisions and class 3. Global inequality 1 Social Divisions & Social Class 2 Social class Last week: Today: Discussed social class from a

805 views • 6 slides
Herding behaviour in digital currency markets: An integrated survey and empirical estimation

Herding behaviour in digital currency markets: An integrated survey and empirical estimation

2 nd Crypto Asset Lab Conference, Milan, 27 October 2020 Herding behaviour in digital currency markets: An integrated survey and empirical estimation Dr. Nikolaos A. Kyriazis Department of Economics, University of Thessaly, Greece Herding

325 views • 31 slides
CRYPTOCURRENCY C r y p t o i s m o n e y 2 . 0 , a h u g e h u g e h u g e d e a l .

CRYPTOCURRENCY C r y p t o i s m o n e y 2 . 0 , a h u g e h u g e h u g e d e a l .

CRYPTOCURRENCY C r y p t o i s m o n e y 2 . 0 , a h u g e h u g e h u g e d e a l . WHAT IS CRYPTOCURRENCY? \ A cryptocurrency (or crypto currency) is a digital asset designed to work as a medium of exchange using

454 views • 10 slides
Learning high-fidelity GW models from numerical relativity data Scott Field Department of

Learning high-fidelity GW models from numerical relativity data Scott Field Department of

Overview GWSurrogate models Building a 1D model Learning high-fidelity GW models from numerical relativity data Scott Field Department of Mathematics, U. Mass Dartmouth ICERM Workshop Nov 18, 2020 Scott Field Surrogate models Overview

801 views • 64 slides
SSIP Evaluation Workshop 2.0: Taking the Online Series to the Next Level Improving Data,

SSIP Evaluation Workshop 2.0: Taking the Online Series to the Next Level Improving Data,

SSIP Evaluation Workshop 2.0: Taking the Online Series to the Next Level Improving Data, Improving Outcomes Pre-Conference August 14, 2018 Welcome! TA Centers DaSy ECTA IDC NCSI State Participants 2 Intended Outcomes

398 views • 38 slides

More recommend