2
play

2 CPU scheduling criteria CPU Utilization How busy is the CPU ? - PowerPoint PPT Presentation

Sep 23, 2023 •849 likes •1.94k views

Chapter 2 (Fourth Part) Scheduling Mechanisms and Policies Slide Credits: Jonathan Walpole Andrew Tanenbaum 1 Process state model New Process Termination Ready Running Blocked 2 CPU scheduling criteria CPU Utilization How busy is

  1. Shortest Job First Select the job with the shortest (expected) running time Non-Preemptive Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 29 0 5 10 15 20

  2. Shortest Job First Select the job with the shortest (expected) running time Non-Preemptive Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 30 0 5 10 15 20

  3. Shortest Job First Select the job with the shortest (expected) running time Non-Preemptive Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 31 0 5 10 15 20

  4. Shortest Job First Select the job with the shortest (expected) running time Non-Preemptive Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 32 0 5 10 15 20

  5. Shortest Job First Select the job with the shortest (expected) running time Non-Preemptive Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 33 0 5 10 15 20

  6. Shortest Job First Select the job with the shortest (expected) running time Non-Preemptive Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 34 0 5 10 15 20

  7. Shortest Job First Select the job with the shortest (expected) running time Non-Preemptive Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 35 0 5 10 15 20

  8. Shortest Job First Select the job with the shortest (expected) running time Non-Preemptive Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 36 0 5 10 15 20

  9. Shortest Job First Select the job with the shortest (expected) running time Non-Preemptive Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 37 0 5 10 15 20

  10. Shortest Job First Select the job with the shortest (expected) running time Non-Preemptive Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 0 2 2 6 1 3 4 4 7 4 6 5 9 5 8 2 1 38 0 5 10 15 20

  11. Shortest Job First Select the job with the shortest (expected) running time Non-Preemptive Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 0 3 2 2 6 1 7 3 4 4 7 11 4 6 5 9 14 5 8 2 1 3 39 0 5 10 15 20

  12. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Same Job Mix 40 0 5 10 15 20

  13. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 41 0 5 10 15 20

  14. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 42 0 5 10 15 20

  15. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 43 0 5 10 15 20

  16. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 44 0 5 10 15 20

  17. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 45 0 5 10 15 20

  18. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 46 0 5 10 15 20

  19. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 47 0 5 10 15 20

  20. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 48 0 5 10 15 20

  21. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 49 0 5 10 15 20

  22. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 50 0 5 10 15 20

  23. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 51 0 5 10 15 20

  24. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 52 0 5 10 15 20

  25. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 53 0 5 10 15 20

  26. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 0 2 2 6 7 3 4 4 0 4 6 5 9 5 8 2 0 54 0 5 10 15 20

  27. Shortest Remaining Time Preemptive version of SJF Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 0 3 2 2 6 7 13 3 4 4 0 4 4 6 5 9 14 5 8 2 0 2 55 0 5 10 15 20

  28. Round-Robin Scheduling Goal: Enable interactivity Limit the amount of CPU that a process can have at one time. Time quantum Amount of time the OS gives a process before intervention The “time slice” Typically: 1 to 100ms 56

  29. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 57 0 5 10 15 20

  30. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 58 0 5 10 15 20

  31. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 59 0 5 10 15 20

  32. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 60 0 5 10 15 20

  33. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 61 0 5 10 15 20

  34. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 62 0 5 10 15 20

  35. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 63 0 5 10 15 20

  36. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 64 0 5 10 15 20

  37. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 65 0 5 10 15 20

  38. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 66 0 5 10 15 20

  39. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 67 0 5 10 15 20

  40. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 68 0 5 10 15 20

  41. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 69 0 5 10 15 20

  42. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 70 0 5 10 15 20

  43. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 71 0 5 10 15 20

  44. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 72 0 5 10 15 20

  45. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 73 0 5 10 15 20

  46. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 74 0 5 10 15 20

  47. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 75 0 5 10 15 20

  48. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 76 0 5 10 15 20

  49. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 77 0 5 10 15 20

  50. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 78 0 5 10 15 20

  51. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 79 0 5 10 15 20

  52. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 80 0 5 10 15 20

  53. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 81 0 5 10 15 20

  54. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 Ready List: 82 0 5 10 15 20

  55. Round-Robin Scheduling Arrival Processing Process Time Time 1 0 3 2 2 6 3 4 4 4 6 5 5 8 2 83 0 5 10 15 20

  56. Round-Robin Scheduling Arrival Processing Turnaround Process Time Time Delay Time 1 0 3 1 4 2 2 6 10 16 3 4 4 9 13 4 6 5 9 14 5 8 2 5 7 84 0 5 10 15 20

  57. Round-Robin Scheduling Effectiveness of round-robin depends on • The number of jobs, and • The size of the time quantum. Large # of jobs means that the time between scheduling of a single job increases (Slow responses) Larger time quantum means that the time between the scheduling of a single job also increases (Slow responses) Smaller time quantum means higher processing rates but 85 also more overhead!

  58. Scheduling in general purpose systems 86

  59. Priority scheduling Assign a priority (number) to each process. Schedule processes based on its priority. Higher priority jobs processes get more CPU time. Managing priorities Can use “nice” to reduce your priority Can periodically adjust a process’ priority Prevents starvation of a lower priority process Can improve performance of I/O-bound processes p = aT 0 + (1-a)T 1 efficient to calculate when a = 1/2 Can use feedback to help determine the priorities 87 priority = 1/fraction last quantum used

  60. Multi-Level Queue Scheduling Multiple queues, each with its own priority. (Equivalently: Each priority has its own ready queue) Within each queue... Round-robin scheduling. Simplist Approach: A Process’s priority is fixed & unchanging High priority CPU Low priority 88

  61. Multi-Level Feedback Queue Scheduling Problem: Fixed priorities are too restrictive Processes exhibit varying ratios of CPU to I/O times. Dynamic Priorities Priorities are altered over time, as process behavior changes! 89

  62. Multi-Level Feedback Queue Scheduling Problem: Fixed priorities are too restrictive Processes exhibit varying ratios of CPU to I/O times. Dynamic Priorities Priorities are altered over time, as process behavior changes! Issue: When do you change the priority of a process and how often? 90

  63. Multi-Level Feedback Queue Scheduling Problem: Fixed priorities are too restrictive Processes exhibit varying ratios of CPU to I/O times. Dynamic Priorities Priorities are altered over time, as process behavior changes! Issue: When do you change the priority of a process and how often? Solution: Let the amount of CPU used be an indication of how a process is to be handled Expired time quantum  more processing needed Unexpired time quantum  less processing needed 91 Adjusting quantum and frequency vs. adjusting priority??

  64. Multi-Level Feedback Queue Scheduling n priority levels, round-robin scheduling within a level Quanta increase as priority decreases Jobs are demoted to lower priorities if they do not complete within the current quantum ?? High priority CPU Low priority 92

  65. Multi-Level Feedback Queue Scheduling Details, details, details... • Starting priority? • High priority vs. low priority • Moving between priorities? • How long should the time quantum be? 93

  66. Lottery Scheduling Scheduler gives each thread some lottery tickets. To select the next process to run... The scheduler randomly selects a lottery number The winning process gets to run Example Thread A gets 50 tickets Thread B gets 15 tickets Thread C gets 35 tickets There are 100 tickets outstanding. 94

  67. Lottery Scheduling Scheduler gives each thread some lottery tickets. To select the next process to run... The scheduler randomly selects a lottery number The winning process gets to run Example Thread A gets 50 tickets 50% of CPU Thread B gets 15 tickets 15% of CPU Thread C gets 35 tickets 35% of CPU There are 100 tickets outstanding. 95

  68. Lottery Scheduling Scheduler gives each thread some lottery tickets. To select the next process to run... The scheduler randomly selects a lottery number The winning process gets to run Example Thread A gets 50 tickets 50% of CPU Thread B gets 15 tickets 15% of CPU Thread C gets 35 tickets 35% of CPU There are 100 tickets outstanding. • Flexible • Fair 96 • Responsive.

  69. A Brief Look at Real-Time Systems Assume processes are relatively periodic Fixed amount of work per period (e.g. sensor systems or multimedia data) 97

  70. A Brief Look at Real-Time Systems Assume processes are relatively periodic Fixed amount of work per period (e.g. sensor systems or multimedia data) Two “main” types of schedulers... Rate-Monotonic Schedulers Earliest-Deadline-First Schedulers 98

  71. A Brief Look at Real-Time Systems Assume processes are relatively periodic Fixed amount of work per period (e.g. sensor systems or multimedia data) Two “main” types of schedulers... Rate-Monotonic Schedulers Assign a fixed, unchanging priority to each process No dynamic adjustment of priorities • Less aggressive allocation of processor Earliest-Deadline-First Schedulers Assign dynamic priorities based upon deadlines. 99

  72. A Brief Look at Real-Time Systems Typically real-time systems involve several steps (that aren’t in traditional systems) • Admission control All processes must ask for resources ahead of time. If sufficient resources exist, the job is admitted “into” the system. • Resource allocation Upon admission... the appropriate resources need to be reserved for the task. • Resource enforcement Carry out the resource allocations properly. 100

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

Zero Turnaround in Java Jevgeni Kabanov ZeroTurnaround Lead Aranea and Squill Project Co-Founder

Zero Turnaround in Java Jevgeni Kabanov ZeroTurnaround Lead Aranea and Squill Project Co-Founder

Zero Turnaround in Java Jevgeni Kabanov ZeroTurnaround Lead Aranea and Squill Project Co-Founder Turnaround cycle Check Make a the change change Build, deploy, wait DEMO: SPRING PETCLINIC TURNAROUND Outline Turnaround Why should

868 views • 51 slides
Slides Added over Course 2 Normal Distribution Tutorial (1) Let Q be the order quantity, and

Slides Added over Course 2 Normal Distribution Tutorial (1) Let Q be the order quantity, and

Slides Added over Course 2 Normal Distribution Tutorial (1) Let Q be the order quantity, and Start with 0.0180 Center the ( , ) the parameters of the = 100, 0.0160 distribution over 0 normal demand distribution 0.0140 =

361 views • 9 slides
Scheduling Processes call stack, etc. This state resides in memory. The OS also stores

Scheduling Processes call stack, etc. This state resides in memory. The OS also stores

11/6/16 COMP 530: Operating Systems COMP 530: Operating Systems Processes (refresher) Each process has state, that includes its text and data, procedure Scheduling Processes call stack, etc. This state resides in memory. The OS

367 views • 7 slides
HW/SW Codesign w/ FPGAs Data Flow Modeling III ECE 522 DFG Performance Modeling and

HW/SW Codesign w/ FPGAs Data Flow Modeling III ECE 522 DFG Performance Modeling and

HW/SW Codesign w/ FPGAs Data Flow Modeling III ECE 522 DFG Performance Modeling and Transformations We indicated earlier that Data Flow graphs (DFGs) are untimed , i.e., our analysis did not model the amount of time needed to complete a

221 views • 17 slides
Social Enterprises and Social Science: Introduction to Collaboration Tuesday 15 September 2020

Social Enterprises and Social Science: Introduction to Collaboration Tuesday 15 September 2020

Social Enterprises and Social Science: Introduction to Collaboration Tuesday 15 September 2020 11.30am-1pm Zoom Running Order 11.30am Welcome Kevin Fearon, Queens University Belfast 11.35am Introductory Remarks Janene Ware, Director at

783 views • 43 slides
Announcements Announcements Reading for next Wednesday (Sep 7) Reading for next Wednesday

Announcements Announcements Reading for next Wednesday (Sep 7) Reading for next Wednesday

Announcements Announcements Reading for next Wednesday (Sep 7) Reading for next Wednesday (Sep 7) Chapter 3 Check Check http://www.itk.ilstu.edu/faculty/kwsuh/courses/ ITK168/Fall2011/index.htm ITK168/Fall2011/index.htm

709 views • 35 slides
Massachusetts Health Reform: Massachusetts Health Reform: What We ve Accomplished So Far

Massachusetts Health Reform: Massachusetts Health Reform: What We ve Accomplished So Far

Massachusetts Health Reform: Massachusetts Health Reform: What We ve Accomplished So Far ve Accomplished So Far What We Nancy Turnbull Nancy Turnbull May 14, 2007 May 14, 2007 Massachusetts Health Policy Forum April 2006 April 2006

303 views • 17 slides
22/03/2018 PenCHORD Timeline THE THE RO ROLE OF OF SYSTEM SYSTEM DY DYNAMICS IN IN HE HEAL ALTH

22/03/2018 PenCHORD Timeline THE THE RO ROLE OF OF SYSTEM SYSTEM DY DYNAMICS IN IN HE HEAL ALTH

22/03/2018 PenCHORD Timeline THE THE RO ROLE OF OF SYSTEM SYSTEM DY DYNAMICS IN IN HE HEAL ALTH TH AND AND SOC SOCIAL CARE CARE 2009 2010 2011 2012 2013 2014 2015 2016 2017 Launch PenCLAHRC 2 PenCLAHRC Martin Pitt Event starts

341 views • 6 slides
16 October 2017 BZE Discussion Group A Short-lived Gas Shortfall Tim Forcey Dylan McConnell

16 October 2017 BZE Discussion Group A Short-lived Gas Shortfall Tim Forcey Dylan McConnell

16 October 2017 BZE Discussion Group A Short-lived Gas Shortfall Tim Forcey Dylan McConnell 1 Eastern Australia gas exports (LNG) dwarf domestic use Starting in 2015 disruption! The end of cheap gas in Eastern Australia. And the

721 views • 61 slides
Low Level RF and Instrumenta3on Pla5orm Requirements October

Low Level RF and Instrumenta3on Pla5orm Requirements October

Low Level RF and Instrumenta3on Pla5orm Requirements October 2012 B. Chase, D. Peterson AD/RF Fermilab VXI Controller Hardware Technologies of

848 views • 25 slides
Security Challenges For Future System s Steve Purser Head of Technical Competence Department

Security Challenges For Future System s Steve Purser Head of Technical Competence Department

Security Challenges For Future System s Steve Purser Head of Technical Competence Department June 2011 Agenda Introduction to ENISA The Trends Scope & Requirements Design Considerations Deploying Secure Systems ENISAs contribution

663 views • 31 slides
1 Electroimpact Proprietary About Ben Hempstead, PE BSME University of Washington Started

1 Electroimpact Proprietary About Ben Hempstead, PE BSME University of Washington Started

1 Electroimpact Proprietary About Ben Hempstead, PE BSME University of Washington Started at EI in 1994 Mechanical Engineer (Lead) for automation projects Chief of Staff 2 Electroimpact Proprietary Electroimpact is a world

691 views • 43 slides
Wind Up R. J. Lauckner Outline Mandate u Objectives u Working Sessions u Preliminary

Wind Up R. J. Lauckner Outline Mandate u Objectives u Working Sessions u Preliminary

Wind Up R. J. Lauckner Outline Mandate u Objectives u Working Sessions u Preliminary Conclusions u A few final thoughts u 2/10 14th April, 2000 First LHC-CP Workshop. Wind-Up, R. J. Lauckner Mandate Purpose (Why?) To deliver for the

349 views • 10 slides
Community succession Vacant space Pioneer species i Intermediate Disturbance Climax

Community succession Vacant space Pioneer species i Intermediate Disturbance Climax

Community succession Vacant space Pioneer species i Intermediate Disturbance Climax community community Markov models of succession (list of assumptions from Gotelli) ( p ) Communities can be classified into discrete states

104 views • 7 slides
COVID-19 and Beyond Prof.dr. Stef van Weeghel Global Tax Policy Leader, PwC Professor of

COVID-19 and Beyond Prof.dr. Stef van Weeghel Global Tax Policy Leader, PwC Professor of

COVID-19 and Beyond Prof.dr. Stef van Weeghel Global Tax Policy Leader, PwC Professor of international tax law, University of Amsterdam Chair Board of Trustees, IBFD BUILDING A GROWTH-FRIENDLY TAX ENVIRONMENT COVID-19 and Beyond: Three phases

407 views • 5 slides
Sanmina Q1 FY19 Results January 28, 2019 WHAT WE MAKE, MAKES A DIFFERENCE Concept to

Sanmina Q1 FY19 Results January 28, 2019 WHAT WE MAKE, MAKES A DIFFERENCE Concept to

Sanmina Q1 FY19 Results January 28, 2019 WHAT WE MAKE, MAKES A DIFFERENCE Concept to Delivery / Advanced Technology / Manufacturing & Global Supply Chain Solutions / Systems & Intelligence Safe Harbor Statement Certain

633 views • 20 slides
THE RANDSTAD REGION Red = urban centre of Randstad daily urban system Pink = suburban area of

THE RANDSTAD REGION Red = urban centre of Randstad daily urban system Pink = suburban area of

THE RANDSTAD REGION Red = urban centre of Randstad daily urban system Pink = suburban area of Randstad daily urban system Light green = Green Heart of the Randstad Turquoise = outer ring of the Randstad Orange = urban centre of other daily

316 views • 4 slides
UKNOF39 Welcome & Attendee Information UKNOF 39 Meeting London 17 th January 2018 Keith

UKNOF39 Welcome & Attendee Information UKNOF 39 Meeting London 17 th January 2018 Keith

UKNOF39 Welcome & Attendee Information UKNOF 39 Meeting London 17 th January 2018 Keith Mitchell UKNOF UKNOF Remit From Charter: To pro-actively support the sharing of knowledge, ideas and best practices to enhance the

316 views • 13 slides
22 Ne(p, ) 23 Na cross section measurement at astrophysical energies Federico Ferraro

22 Ne(p, ) 23 Na cross section measurement at astrophysical energies Federico Ferraro

22 Ne(p, ) 23 Na cross section measurement at astrophysical energies Federico Ferraro Universit degli Studi di Genova, INFN Sezione di Genova VIII International Nuclear Physics in Astrophysics Conference, 22 June 2017 Catania,

482 views • 37 slides
Renormalization Group Approaches to Strongly Correlated Electron and Electron-Phonon Systems

Renormalization Group Approaches to Strongly Correlated Electron and Electron-Phonon Systems

Renormalization Group Approaches to Strongly Correlated Electron and Electron-Phonon Systems Outline 1. The Application of NRG-DMFT to the Hubbard-Holstein Models 2. Polaron Bands in a a Many-electron System 3. Calculation of Renormalised

781 views • 60 slides
English Resource Semantics Dan Flickinger, Ann Copestake & Woodley Packard Stanford

English Resource Semantics Dan Flickinger, Ann Copestake & Woodley Packard Stanford

English Resource Semantics Dan Flickinger, Ann Copestake & Woodley Packard Stanford University, University of Cambridge & University of Washington 24 May 2016 Flickinger, Copestake, Packard English Resource Semantics 24.05.2016 1 /

1.68k views • 130 slides
Watching the Watchers: Automatically Inferring TV Content From Outdoor Light Effusions Yi Xu,

Watching the Watchers: Automatically Inferring TV Content From Outdoor Light Effusions Yi Xu,

Watching the Watchers: Automatically Inferring TV Content From Outdoor Light Effusions Yi Xu, Jan-Michael Frahm and Fabian Monrose CCS 2014 Bart Kosciarz Introduction + Why Should You Care? Exploit emanations of changes in light to reveal TV

618 views • 17 slides
Alive2 Verifying existing optimizations Nuno Lopes John Regehr Microsoft Research University

Alive2 Verifying existing optimizations Nuno Lopes John Regehr Microsoft Research University

Alive2 Verifying existing optimizations Nuno Lopes John Regehr Microsoft Research University of Utah Alive Found dozens of bugs in LLVM Avoided many other bugs due to use before commit Verifying peephole optimizations $ alive

863 views • 28 slides
BY THE NUMBERS BY THE NUMBERS BY THE NUMBERS BY THE NUMBERS BY THE NUMBERS BY THE NUMBERS

BY THE NUMBERS BY THE NUMBERS BY THE NUMBERS BY THE NUMBERS BY THE NUMBERS BY THE NUMBERS

BY THE NUMBERS BY THE NUMBERS BY THE NUMBERS BY THE NUMBERS BY THE NUMBERS BY THE NUMBERS Pre-roll, Outstream, Video Production, OTT, Social Video Display, Audience Extension, Mobile Precise, Programmatic, Retargeting, Social, Native SEM,

476 views • 31 slides

More recommend