co2101 processes and multi tasking
play

CO2101 Processes and Multi-tasking Tom Ridge (tr61) 7th October - PowerPoint PPT Presentation

Dec 14, 2023 •177 likes •1.27k views

CO2101 Processes and Multi-tasking Tom Ridge (tr61) 7th October 2019 tr61 Multi-tasking 7th October 2019 1 / 33 How to implement multi-tasking Why multi-tasking? Simple Fetch-Execute Cycle CPU operates in a Fetch-Execute cycle it

  1. How to implement multi-tasking Programs and processes Aside about Kernel Mode vs User Mode OS needs to protect processes from each other for security If a user’s process had access to all machine instructions, then the user could do anything the OS can. tr61 Multi-tasking 7th October 2019 11 / 33

  2. How to implement multi-tasking Programs and processes Aside about Kernel Mode vs User Mode OS needs to protect processes from each other for security If a user’s process had access to all machine instructions, then the user could do anything the OS can. The solution is for the CPU to have a special operating mode, kernel or supervisor mode, which can only be invoked by the OS. tr61 Multi-tasking 7th October 2019 11 / 33

  3. How to implement multi-tasking Programs and processes Aside about Kernel Mode vs User Mode OS needs to protect processes from each other for security If a user’s process had access to all machine instructions, then the user could do anything the OS can. The solution is for the CPU to have a special operating mode, kernel or supervisor mode, which can only be invoked by the OS. In kernel mode, certain privileged instructions, e.g , interrupt processing, dispatcher, memory allocation, are possible; normal processes run in user mode tr61 Multi-tasking 7th October 2019 11 / 33

  4. How to implement multi-tasking The Dispatcher The Dispatcher After an interrupt has been handled, control is passed to the Dispatcher (or Low Level Scheduler). tr61 Multi-tasking 7th October 2019 12 / 33

  5. How to implement multi-tasking The Dispatcher The Dispatcher After an interrupt has been handled, control is passed to the Dispatcher (or Low Level Scheduler). Is the current process still the most suitable to run? If so, resume 1 execution; otherwise . . . tr61 Multi-tasking 7th October 2019 12 / 33

  6. How to implement multi-tasking The Dispatcher The Dispatcher After an interrupt has been handled, control is passed to the Dispatcher (or Low Level Scheduler). Is the current process still the most suitable to run? If so, resume 1 execution; otherwise . . . Save the state of the current process in its PCB 2 tr61 Multi-tasking 7th October 2019 12 / 33

  7. How to implement multi-tasking The Dispatcher The Dispatcher After an interrupt has been handled, control is passed to the Dispatcher (or Low Level Scheduler). Is the current process still the most suitable to run? If so, resume 1 execution; otherwise . . . Save the state of the current process in its PCB 2 3 Retrieve the state of the most suitable process from its PCB tr61 Multi-tasking 7th October 2019 12 / 33

  8. How to implement multi-tasking The Dispatcher The Dispatcher After an interrupt has been handled, control is passed to the Dispatcher (or Low Level Scheduler). Is the current process still the most suitable to run? If so, resume 1 execution; otherwise . . . Save the state of the current process in its PCB 2 3 Retrieve the state of the most suitable process from its PCB Transfer control to the new process, at the point indicated in the PCB 4 tr61 Multi-tasking 7th October 2019 12 / 33

  9. How to implement multi-tasking The Dispatcher The Dispatcher After an interrupt has been handled, control is passed to the Dispatcher (or Low Level Scheduler). Is the current process still the most suitable to run? If so, resume 1 execution; otherwise . . . Save the state of the current process in its PCB 2 3 Retrieve the state of the most suitable process from its PCB Transfer control to the new process, at the point indicated in the PCB 4 The action of storing the state of current process and (re-)starting another process is called a context switch tr61 Multi-tasking 7th October 2019 12 / 33

  10. How to implement multi-tasking The Dispatcher States of processes The running process is in the RUNNING state; only one RUNNING process on a processor at a time. tr61 Multi-tasking 7th October 2019 13 / 33

  11. How to implement multi-tasking The Dispatcher States of processes The running process is in the RUNNING state; only one RUNNING process on a processor at a time. Clock interrupt: Initiated by a clock within the CPU. Gives the dispatcher an opportunity to context switch. A process stopped by clock interrupt goes to READY state. tr61 Multi-tasking 7th October 2019 13 / 33

  12. How to implement multi-tasking The Dispatcher States of processes The running process is in the RUNNING state; only one RUNNING process on a processor at a time. Clock interrupt: Initiated by a clock within the CPU. Gives the dispatcher an opportunity to context switch. A process stopped by clock interrupt goes to READY state. I/O interrupt: Initiated by CPU when an I/O instruction occurs in the running process or by an I/O device signalling completion of an I/O operation When a process starts an I/O operation it goes to the BLOCKED state When an I/O operation completes for a process, it goes to READY state tr61 Multi-tasking 7th October 2019 13 / 33

  13. How to implement multi-tasking The Dispatcher States of processes The running process is in the RUNNING state; only one RUNNING process on a processor at a time. Clock interrupt: Initiated by a clock within the CPU. Gives the dispatcher an opportunity to context switch. A process stopped by clock interrupt goes to READY state. I/O interrupt: Initiated by CPU when an I/O instruction occurs in the running process or by an I/O device signalling completion of an I/O operation When a process starts an I/O operation it goes to the BLOCKED state When an I/O operation completes for a process, it goes to READY state The dispatcher can select a process to run only if it is READY. tr61 Multi-tasking 7th October 2019 13 / 33

  14. How to implement multi-tasking The Dispatcher Diagram of process states Process entry I/O completion READY BLOCKED Dispatch Timeout I/O wait RUNNING Termination tr61 Multi-tasking 7th October 2019 14 / 33

  15. How to implement multi-tasking The Dispatcher Summary of the story and what next A process can be RUNNING (currently running), READY (ready to run) or BLOCKED (waiting on I/O). tr61 Multi-tasking 7th October 2019 15 / 33

  16. How to implement multi-tasking The Dispatcher Summary of the story and what next A process can be RUNNING (currently running), READY (ready to run) or BLOCKED (waiting on I/O). tr61 Multi-tasking 7th October 2019 15 / 33

  17. How to implement multi-tasking The Dispatcher Summary of the story and what next A process can be RUNNING (currently running), READY (ready to run) or BLOCKED (waiting on I/O). tr61 Multi-tasking 7th October 2019 15 / 33

  18. How to implement multi-tasking The Dispatcher Summary of the story and what next A process can be RUNNING (currently running), READY (ready to run) or BLOCKED (waiting on I/O). Interrupts are used to stop the currently RUNNING process. tr61 Multi-tasking 7th October 2019 15 / 33

  19. How to implement multi-tasking The Dispatcher Summary of the story and what next A process can be RUNNING (currently running), READY (ready to run) or BLOCKED (waiting on I/O). Interrupts are used to stop the currently RUNNING process. A clock interrupt causes the current process to become READY. tr61 Multi-tasking 7th October 2019 15 / 33

  20. How to implement multi-tasking The Dispatcher Summary of the story and what next A process can be RUNNING (currently running), READY (ready to run) or BLOCKED (waiting on I/O). Interrupts are used to stop the currently RUNNING process. A clock interrupt causes the current process to become READY. An I/O interrupt causes the current process to become BLOCKED, upon completion of the I/O it becomes READY tr61 Multi-tasking 7th October 2019 15 / 33

  21. How to implement multi-tasking The Dispatcher Summary of the story and what next A process can be RUNNING (currently running), READY (ready to run) or BLOCKED (waiting on I/O). Interrupts are used to stop the currently RUNNING process. A clock interrupt causes the current process to become READY. An I/O interrupt causes the current process to become BLOCKED, upon completion of the I/O it becomes READY The Dispatcher chooses the next process to run from the queue of READY processes. tr61 Multi-tasking 7th October 2019 15 / 33

  22. How to implement multi-tasking The Dispatcher Summary of the story and what next A process can be RUNNING (currently running), READY (ready to run) or BLOCKED (waiting on I/O). Interrupts are used to stop the currently RUNNING process. A clock interrupt causes the current process to become READY. An I/O interrupt causes the current process to become BLOCKED, upon completion of the I/O it becomes READY The Dispatcher chooses the next process to run from the queue of READY processes. Scheduling: is the policy for choosing among the READY processes. tr61 Multi-tasking 7th October 2019 15 / 33

  23. How to implement multi-tasking The Dispatcher Types of Scheduling policy Scheduling policy determines: Which READY process to run next. How long a process is given to use the CPU. tr61 Multi-tasking 7th October 2019 16 / 33

  24. How to implement multi-tasking The Dispatcher Types of Scheduling policy Scheduling policy determines: Which READY process to run next. How long a process is given to use the CPU. Non-preemptive scheduling: A process releases CPU only if it BLOCKS on I/O (or it finishes). i.e. the process cannot be stopped during regular operation. tr61 Multi-tasking 7th October 2019 16 / 33

  25. How to implement multi-tasking The Dispatcher Types of Scheduling policy Scheduling policy determines: Which READY process to run next. How long a process is given to use the CPU. Non-preemptive scheduling: A process releases CPU only if it BLOCKS on I/O (or it finishes). i.e. the process cannot be stopped during regular operation. Preemptive scheduling: A process can be stopped at any point by a clock interrupt. tr61 Multi-tasking 7th October 2019 16 / 33

  26. How to implement multi-tasking The Dispatcher Efficiency measures of scheduling policies There are many possible ways to measure efficiency of scheduling policies. We consider the following 3: Turnaround time. CPU usage. Response time. tr61 Multi-tasking 7th October 2019 17 / 33

  27. How to implement multi-tasking The Dispatcher Efficiency measures of scheduling policies There are many possible ways to measure efficiency of scheduling policies. We consider the following 3: Turnaround time. CPU usage. Response time. tr61 Multi-tasking 7th October 2019 17 / 33

  28. How to implement multi-tasking The Dispatcher Efficiency measures of scheduling policies There are many possible ways to measure efficiency of scheduling policies. We consider the following 3: Turnaround time. CPU usage. Response time. tr61 Multi-tasking 7th October 2019 17 / 33

  29. How to implement multi-tasking The Dispatcher Turnaround time Turnaround time of a particular process is its duration in real time, i.e. the difference between the time it is submitted for execution and the time execution is complete. tr61 Multi-tasking 7th October 2019 18 / 33

  30. How to implement multi-tasking The Dispatcher Turnaround time Turnaround time of a particular process is its duration in real time, i.e. the difference between the time it is submitted for execution and the time execution is complete. Turnaround time of a group of processes is the average of their individual turnaround times. tr61 Multi-tasking 7th October 2019 18 / 33

  31. How to implement multi-tasking The Dispatcher Turnaround time Turnaround time of a particular process is its duration in real time, i.e. the difference between the time it is submitted for execution and the time execution is complete. Turnaround time of a group of processes is the average of their individual turnaround times. Example: We have 3 processes with respective start (submitted) and end times ( 100 , 200 ) , ( 150 , 300 ) and ( 200 , 400 ) . The individual turnaround times are 100, 150, 200. The average turnaround time is 150 tr61 Multi-tasking 7th October 2019 18 / 33

  32. How to implement multi-tasking The Dispatcher Turnaround time Turnaround time of a particular process is its duration in real time, i.e. the difference between the time it is submitted for execution and the time execution is complete. Turnaround time of a group of processes is the average of their individual turnaround times. Example: We have 3 processes with respective start (submitted) and end times ( 100 , 200 ) , ( 150 , 300 ) and ( 200 , 400 ) . The individual turnaround times are 100, 150, 200. The average turnaround time is 150 Generally a scheduling policy aims to keep average turnaround time as low as possible . tr61 Multi-tasking 7th October 2019 18 / 33

  33. How to implement multi-tasking The Dispatcher CPU Usage If all the processes are blocked waiting for completion of their I/O operations, the CPU stays idle. tr61 Multi-tasking 7th October 2019 19 / 33

  34. How to implement multi-tasking The Dispatcher CPU Usage If all the processes are blocked waiting for completion of their I/O operations, the CPU stays idle. A good scheduling policy minimises the idleness time. tr61 Multi-tasking 7th October 2019 19 / 33

  35. How to implement multi-tasking The Dispatcher CPU Usage If all the processes are blocked waiting for completion of their I/O operations, the CPU stays idle. A good scheduling policy minimises the idleness time. CPU usage: given some amount of time, the percentage of time during which the CPU is busy. tr61 Multi-tasking 7th October 2019 19 / 33

  36. How to implement multi-tasking The Dispatcher CPU Usage If all the processes are blocked waiting for completion of their I/O operations, the CPU stays idle. A good scheduling policy minimises the idleness time. CPU usage: given some amount of time, the percentage of time during which the CPU is busy. Generally a scheduling policy aims to maximise CPU usage. tr61 Multi-tasking 7th October 2019 19 / 33

  37. How to implement multi-tasking The Dispatcher Response time The OS (or something else) classifies some processes as user commands. tr61 Multi-tasking 7th October 2019 20 / 33

  38. How to implement multi-tasking The Dispatcher Response time The OS (or something else) classifies some processes as user commands. E.g , in Linux, user requests are commands like cp, cd, ls, etc. or applications. tr61 Multi-tasking 7th October 2019 20 / 33

  39. How to implement multi-tasking The Dispatcher Response time The OS (or something else) classifies some processes as user commands. E.g , in Linux, user requests are commands like cp, cd, ls, etc. or applications. The response time is average turnaround time of user requests. tr61 Multi-tasking 7th October 2019 20 / 33

  40. How to implement multi-tasking The Dispatcher Response time The OS (or something else) classifies some processes as user commands. E.g , in Linux, user requests are commands like cp, cd, ls, etc. or applications. The response time is average turnaround time of user requests. The turnaround time of other processes (“batch processes”) is ignored. tr61 Multi-tasking 7th October 2019 20 / 33

  41. How to implement multi-tasking The Dispatcher Response time The OS (or something else) classifies some processes as user commands. E.g , in Linux, user requests are commands like cp, cd, ls, etc. or applications. The response time is average turnaround time of user requests. The turnaround time of other processes (“batch processes”) is ignored. For interactive users response time should be minimised. tr61 Multi-tasking 7th October 2019 20 / 33

  42. How to implement multi-tasking The Dispatcher Response time The OS (or something else) classifies some processes as user commands. E.g , in Linux, user requests are commands like cp, cd, ls, etc. or applications. The response time is average turnaround time of user requests. The turnaround time of other processes (“batch processes”) is ignored. For interactive users response time should be minimised. NOTE The terminology “response time” is not completely standardized (like lots of CS terminology) tr61 Multi-tasking 7th October 2019 20 / 33

  43. How to implement multi-tasking The Dispatcher Types of operating systems Batch systems: Run a series of programs without human intervention. Examples: scientific computing, salary calculation in big companies. Turnaround time and CPU usage are more important measures than response time. Example: recoding a video tr61 Multi-tasking 7th October 2019 21 / 33

  44. How to implement multi-tasking The Dispatcher Types of operating systems Batch systems: Run a series of programs without human intervention. Examples: scientific computing, salary calculation in big companies. Turnaround time and CPU usage are more important measures than response time. Example: recoding a video Interactive systems: Designed to continuously communicate with the user. Examples: desktop workstations/laptops, etc ; mobile phones, tablets . . . Response time is more important measure than general average turnaround time or CPU utilisation. Users often don’t care if a background task takes a little bit longer, provided the thing they clicked on shows some sort of response almost immediately (i.e., without noticable delay) tr61 Multi-tasking 7th October 2019 21 / 33

  45. How to implement multi-tasking Scheduling policies Generalisations I/O is not relevant when comparing different scheduling policies — when a process blocks on I/O it is no longer available for scheduling. tr61 Multi-tasking 7th October 2019 22 / 33

  46. How to implement multi-tasking Scheduling policies Generalisations I/O is not relevant when comparing different scheduling policies — when a process blocks on I/O it is no longer available for scheduling. Consider each long running process to be split into short bursts that require no I/O; treat these bursts as separate processes as far as the scheduler is concerned. tr61 Multi-tasking 7th October 2019 22 / 33

  47. How to implement multi-tasking Scheduling policies First come first served (FCFS) policy This policy is non-preemptive. tr61 Multi-tasking 7th October 2019 23 / 33

  48. How to implement multi-tasking Scheduling policies First come first served (FCFS) policy This policy is non-preemptive. The first READY process in the queue is started. tr61 Multi-tasking 7th October 2019 23 / 33

  49. How to implement multi-tasking Scheduling policies First come first served (FCFS) policy This policy is non-preemptive. The first READY process in the queue is started. The process releases the CPU when it finishes or it BLOCK s on I/O tr61 Multi-tasking 7th October 2019 23 / 33

  50. How to implement multi-tasking Scheduling policies First come first served (FCFS) policy This policy is non-preemptive. The first READY process in the queue is started. The process releases the CPU when it finishes or it BLOCK s on I/O When a BLOCKed process returns to READY state, it goes to the back of the READY queue. tr61 Multi-tasking 7th October 2019 23 / 33

  51. How to implement multi-tasking Scheduling policies Advantages and disadvantages of the FCFS policy Advantages: Easy to implement. No indefinite waiting (when a process can potentially wait forever to be run). tr61 Multi-tasking 7th October 2019 24 / 33

  52. How to implement multi-tasking Scheduling policies Advantages and disadvantages of the FCFS policy Advantages: Easy to implement. No indefinite waiting (when a process can potentially wait forever to be run). Disadvantage: likely to be un-responsive; because turnaround time of short processes can be much longer than their actual execution time. tr61 Multi-tasking 7th October 2019 24 / 33

  53. How to implement multi-tasking Scheduling policies Shortest job first (SJF) policy The policy is non-preemptive. tr61 Multi-tasking 7th October 2019 25 / 33

  54. How to implement multi-tasking Scheduling policies Shortest job first (SJF) policy The policy is non-preemptive. Requires knowledge about the runtime of processes before they actually execute. tr61 Multi-tasking 7th October 2019 25 / 33

  55. How to implement multi-tasking Scheduling policies Shortest job first (SJF) policy The policy is non-preemptive. Requires knowledge about the runtime of processes before they actually execute. From the queue of READY processes choose the one whose (expected) runtime is smallest. tr61 Multi-tasking 7th October 2019 25 / 33

  56. How to implement multi-tasking Scheduling policies Shortest job first (SJF) policy The policy is non-preemptive. Requires knowledge about the runtime of processes before they actually execute. From the queue of READY processes choose the one whose (expected) runtime is smallest. Otherwise, as for FCFS. tr61 Multi-tasking 7th October 2019 25 / 33

  57. How to implement multi-tasking Scheduling policies Advantages and disadvantages of the SJF policy Advantage: favourable to processes with short runtimes. tr61 Multi-tasking 7th October 2019 26 / 33

  58. How to implement multi-tasking Scheduling policies Advantages and disadvantages of the SJF policy Advantage: favourable to processes with short runtimes. Disadvantages: Requires advance knowledge about runtimes. Indefinite waiting is possible: a long process can wait a long time if multiple new short processes arrive. tr61 Multi-tasking 7th October 2019 26 / 33

  59. How to implement multi-tasking Scheduling policies Shortest remaining time first (SRTF) policy This is a preemptive policy. tr61 Multi-tasking 7th October 2019 27 / 33

  60. How to implement multi-tasking Scheduling policies Shortest remaining time first (SRTF) policy This is a preemptive policy. For every process, requires knowledge of the remaining runtime . tr61 Multi-tasking 7th October 2019 27 / 33

  61. How to implement multi-tasking Scheduling policies Shortest remaining time first (SRTF) policy This is a preemptive policy. For every process, requires knowledge of the remaining runtime . Very similar to SJF . The differences are: Arrival of a process in the READY queue leads to an interrupt. Chooses process with the shortest remaining time instead of shortest overall time. So if a process with shorter remaining time than the current one arrives in the READY queue, then the current process is preempted. tr61 Multi-tasking 7th October 2019 27 / 33

  62. How to implement multi-tasking Scheduling policies Shortest remaining time first (SRTF) policy This is a preemptive policy. For every process, requires knowledge of the remaining runtime . Very similar to SJF . The differences are: Arrival of a process in the READY queue leads to an interrupt. Chooses process with the shortest remaining time instead of shortest overall time. So if a process with shorter remaining time than the current one arrives in the READY queue, then the current process is preempted. tr61 Multi-tasking 7th October 2019 27 / 33

  63. How to implement multi-tasking Scheduling policies Shortest remaining time first (SRTF) policy This is a preemptive policy. For every process, requires knowledge of the remaining runtime . Very similar to SJF . The differences are: Arrival of a process in the READY queue leads to an interrupt. Chooses process with the shortest remaining time instead of shortest overall time. So if a process with shorter remaining time than the current one arrives in the READY queue, then the current process is preempted. tr61 Multi-tasking 7th October 2019 27 / 33

  64. How to implement multi-tasking Scheduling policies Advantages and disadvantages of the SRTF policy. Advantage: even more sensitive to the short processes than SJF . tr61 Multi-tasking 7th October 2019 28 / 33

  65. How to implement multi-tasking Scheduling policies Advantages and disadvantages of the SRTF policy. Advantage: even more sensitive to the short processes than SJF . Disadvantages: requires advance knowledge of runtimes; indefinite waiting is still possible. tr61 Multi-tasking 7th October 2019 28 / 33

  66. How to implement multi-tasking Scheduling policies Round-Robin scheduling policy This is a preemptive policy used in interactive systems. tr61 Multi-tasking 7th October 2019 29 / 33

  67. How to implement multi-tasking Scheduling policies Round-Robin scheduling policy This is a preemptive policy used in interactive systems. Each process in turn gets the CPU for a fixed time quantum (typically 10–100 ms). tr61 Multi-tasking 7th October 2019 29 / 33

  68. How to implement multi-tasking Scheduling policies Round-Robin scheduling policy This is a preemptive policy used in interactive systems. Each process in turn gets the CPU for a fixed time quantum (typically 10–100 ms). When the quantum finishes: a timeout interrupt occurs and the process goes to the back of the READY queue. tr61 Multi-tasking 7th October 2019 29 / 33

  69. How to implement multi-tasking Scheduling policies Round-Robin scheduling policy This is a preemptive policy used in interactive systems. Each process in turn gets the CPU for a fixed time quantum (typically 10–100 ms). When the quantum finishes: a timeout interrupt occurs and the process goes to the back of the READY queue. New processes join the back of the READY queue. tr61 Multi-tasking 7th October 2019 29 / 33

  70. How to implement multi-tasking Scheduling policies Quantum duration for round-robin Context switch: is the procedure of replacing the currently running process by another one. This takes a non-zero amount of time. tr61 Multi-tasking 7th October 2019 30 / 33

  71. How to implement multi-tasking Scheduling policies Quantum duration for round-robin Context switch: is the procedure of replacing the currently running process by another one. This takes a non-zero amount of time. tr61 Multi-tasking 7th October 2019 30 / 33

  72. How to implement multi-tasking Scheduling policies Quantum duration for round-robin Context switch: is the procedure of replacing the currently running process by another one. This takes a non-zero amount of time. If the quantum is too short (similar to the time taken for a context switch), the CPU spends a large proportion of its time just context switching. tr61 Multi-tasking 7th October 2019 30 / 33

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

A multi-tasking wordset for Standard Forth Andrew Haley Consulting Engineer 8 September 2017

A multi-tasking wordset for Standard Forth Andrew Haley Consulting Engineer 8 September 2017

A multi-tasking wordset for Standard Forth Andrew Haley Consulting Engineer 8 September 2017 Background Forth has been multi-tasking for almost 50 years. It's time to standardize it. Chuck Moore's early Forths had a simple and effjcient

263 views • 22 slides
Review First, operating systems solves time-sharing multi-tasking context = memory address

Review First, operating systems solves time-sharing multi-tasking context = memory address

Review First, operating systems solves time-sharing multi-tasking context = memory address space + stack pointer + instruction pointer IBM360 uses context-switch for time-sharing multi-tasking Second, operating systems solves

870 views • 39 slides
Real-Time Multi-Tasking Environments Shinpei Kato * , Karthik Lakshmanan * , Raj Rajkumar * , and

Real-Time Multi-Tasking Environments Shinpei Kato * , Karthik Lakshmanan * , Raj Rajkumar * , and

TimeGraph: GPU Scheduling for Real-Time Multi-Tasking Environments Shinpei Kato * , Karthik Lakshmanan * , Raj Rajkumar * , and Yutaka Ishikawa ** * Carnegie Mellon University ** The University of Tokyo USENIX Annual Technical Conference 2011

671 views • 26 slides
Lambeth Lambeth Partnership Tasking Partnership Tasking & & Co- -ordination

Lambeth Lambeth Partnership Tasking Partnership Tasking & & Co- -ordination

Lambeth Lambeth Partnership Tasking Partnership Tasking & & Co- -ordination ordination Co Protective Marking: Publication Scheme: Suitable for Publication File Name: Safer Lambeth Presentation 06 June 2013

587 views • 23 slides
Lambeth Lambeth Partnership Tasking Partnership Tasking & & Co- -ordination

Lambeth Lambeth Partnership Tasking Partnership Tasking & & Co- -ordination

Lambeth Lambeth Partnership Tasking Partnership Tasking & & Co- -ordination ordination Co Protective Marking: Publication Scheme: Suitable for Publication File Name: Safer Lambeth Presentation 09 th July 2013

450 views • 25 slides
Lambeth Lambeth Partnership Tasking Partnership Tasking & & Co- -ordination

Lambeth Lambeth Partnership Tasking Partnership Tasking & & Co- -ordination

Lambeth Lambeth Partnership Tasking Partnership Tasking & & Co- -ordination ordination Co Protective Marking: Publication Scheme: Suitable for Publication File Name: Safer Lambeth Presentation. 8 th December 11. ppt

466 views • 32 slides
Managing Command and Control Information Using a C2IEDM Based Tasking Grammar Dr. Michael Hieb

Managing Command and Control Information Using a C2IEDM Based Tasking Grammar Dr. Michael Hieb

Managing Command and Control Information Using a C2IEDM Based Tasking Grammar Dr. Michael Hieb C4I Center George Mason University mhieb@gmu.edu Content 1. Battle Management Language 2. The need for a C2 Grammar 3. A BML Tasking Grammar 4.

347 views • 34 slides
System Integrator Presentation Collaborating on multi-stakeholder processes When we

System Integrator Presentation Collaborating on multi-stakeholder processes When we

System Integrator Presentation Collaborating on multi-stakeholder processes When we collaborate on processes that run outside of our own organization we communicate like we are still in the 00's And this produces unstructured data which is

335 views • 20 slides
Threads Threads Threads vs Processes Multi-threading Models Threading Issues

Threads Threads Threads vs Processes Multi-threading Models Threading Issues

CSC 4103 - Operating Systems Roadmap Spring 2008 Processes Lecture - IV Interprocess Communication Threads Threads Threads vs Processes Multi-threading Models Threading Issues Tevfik Ko ar Louisiana State

450 views • 6 slides
CO2101 Operating Systems, Networks and Distributed Systems Introduction Tom Ridge (tr61)

CO2101 Operating Systems, Networks and Distributed Systems Introduction Tom Ridge (tr61)

CO2101 Operating Systems, Networks and Distributed Systems Introduction Tom Ridge (tr61) 7th October 2019 tr61 Introduction 7th October 2019 1 / 25 Module Organisation Outline Module Organisation 1 Teaching staff Background

506 views • 49 slides
Stochastic Integration for non-Martingales Stationary Increment Processes Multi-color noise

Stochastic Integration for non-Martingales Stationary Increment Processes Multi-color noise

Introduction Main Result Applications Summary Stochastic Integration for non-Martingales Stationary Increment Processes Multi-color noise approach Daniel Alpay 1 Alon Kipnis 1 1 Department of Mathematics Ben-Gurion University of the Negev

1.13k views • 87 slides
Joint Emotion Analysis via Multi-task Gaussian Processes Daniel Beck, Trevor Cohn, Lucia Specia

Joint Emotion Analysis via Multi-task Gaussian Processes Daniel Beck, Trevor Cohn, Lucia Specia

Joint Emotion Analysis via Multi-task Gaussian Processes Daniel Beck, Trevor Cohn, Lucia Specia October 28, 2014 Introduction 1 Multi-task Gaussian Process Regression 2 Experiments and Discussion 3 Conclusions and Future Work 4 2 / 23

861 views • 61 slides
Using Ontologies for Flexibly Specifying Multi-User Processes ICSE 2010 Workshop on Flexible

Using Ontologies for Flexibly Specifying Multi-User Processes ICSE 2010 Workshop on Flexible

Using Ontologies for Flexibly Specifying Multi-User Processes ICSE 2010 Workshop on Flexible Modeling Tools Cape Town, South Africa, 2 May 2010 Gregor Gabrysiak , Holger Giese and Andreas Seibel System Analysis and Modeling Group Hasso Plattner

645 views • 18 slides
The Rocky Road To Tasking March 21, 2019 Ivo Kabadshow, Laura Morgenstern Jlich Supercomputing

The Rocky Road To Tasking March 21, 2019 Ivo Kabadshow, Laura Morgenstern Jlich Supercomputing

The Rocky Road To Tasking March 21, 2019 Ivo Kabadshow, Laura Morgenstern Jlich Supercomputing Centre Member of the Helmholtz Association Requirements for MD Strong scalability Performance portability HPC HPC High Frequency Trading

665 views • 47 slides
Towards General Vision Architectures: Attentive Single-Tasking of Multiple Tasks depth Neural

Towards General Vision Architectures: Attentive Single-Tasking of Multiple Tasks depth Neural

Towards General Vision Architectures: Attentive Single-Tasking of Multiple Tasks depth Neural Architects - ICCV 28 October 2019 Iasonas Kokkinos Kevis Maninis Ilija Radosavovic What can we get out of an image? What can we get out of an

1.24k views • 69 slides
Scalable Exact Inference in Multi-Output Gaussian Processes Wessel P. Bruinsma 1 , 2 , Eric Perim

Scalable Exact Inference in Multi-Output Gaussian Processes Wessel P. Bruinsma 1 , 2 , Eric Perim

Scalable Exact Inference in Multi-Output Gaussian Processes Wessel P. Bruinsma 1 , 2 , Eric Perim 2 , Will Tebbutt 1 , J. Scott Hosking 3 , 4 , Arno Solin 5 , Richard E. Turner 1 , 6 1 University of Cambridge, 2 Invenia Labs, 3 British Antarctic

340 views • 23 slides
Programming and Data Structures (PDS) (Theory: 3-1-0) The basic components of a digital

Programming and Data Structures (PDS) (Theory: 3-1-0) The basic components of a digital

CS11001/CS11002 Programming and Data Structures (PDS) (Theory: 3-1-0) The basic components of a digital computer Input devices These are the devices using which the user provides input instances. In a programmable computer, input devices

384 views • 20 slides
lecture 13 MIPS data path and control 1 - single cycle model - fetch vs execute -

lecture 13 MIPS data path and control 1 - single cycle model - fetch vs execute -

lecture 13 MIPS data path and control 1 - single cycle model - fetch vs execute - examples: add, lw, sw, bne, j February 22, 2016 Q: Did A2 take you more than 10 hours ? Do you receive notifications of news items on mycourses?

394 views • 18 slides
Computer Organization & Assembly Language Programming (CSE 2312) Lecture 17: More Processor

Computer Organization & Assembly Language Programming (CSE 2312) Lecture 17: More Processor

Computer Organization & Assembly Language Programming (CSE 2312) Lecture 17: More Processor Pipeline, Other Parallelism, and Debugging with GDB Taylor Johnson Announcements and Outline Programming assignment 1 assigned soon ERB

1.47k views • 120 slides
What makes a fast processor? 1. Instructions required per program ISA design: RISC vs. CISC

What makes a fast processor? 1. Instructions required per program ISA design: RISC vs. CISC

What makes a fast processor? 1. Instructions required per program ISA design: RISC vs. CISC 2. Memory bandwidth and latency Memory hierarchy Cache parameterisation 3. Instructions executed per second Internal CPU

260 views • 22 slides
Fast Write Protection Xiao Guangrong <xiaoguangrong@tencent.com> Agenda Background

Fast Write Protection Xiao Guangrong <xiaoguangrong@tencent.com> Agenda Background

Fast Write Protection Xiao Guangrong <xiaoguangrong@tencent.com> Agenda Background Challenges Fast write protection Dirty bitmap Evaluation Future plan Background Live migration is a key feature for cloud

605 views • 21 slides
1 Processes and the Kernel The Kernel Processes and the Kernel The Kernel Today, all

1 Processes and the Kernel The Kernel Processes and the Kernel The Kernel Today, all

Memory Protection Memory Protection Paging Virtual memory provides protection by: Each process (user or OS) has different virtual memory space. Machines and Virtualization Machines and Virtualization The OS maintain the page tables

83 views • 5 slides
Protecting Free and Open Communications on the Internet Against Man-in-the-Middle Attacks on

Protecting Free and Open Communications on the Internet Against Man-in-the-Middle Attacks on

Protecting Free and Open Communications on the Internet Against Man-in-the-Middle Attacks on Third-Party Software Jeffrey Knockel, Jedidiah Crandall Computer Science Department University of New Mexico Recent News Iran: forged SSL

569 views • 27 slides
For the Love of Fashion Third Quarter 2018 Results 1 IMPORTANT NOTICE This presentation, and

For the Love of Fashion Third Quarter 2018 Results 1 IMPORTANT NOTICE This presentation, and

For the Love of Fashion Third Quarter 2018 Results 1 IMPORTANT NOTICE This presentation, and the accompanying oral presentation, contains forward-looking statements within the meaning of the Private Securities Litigation Reform Act of 1995. All

235 views • 12 slides

More recommend