Embedded System Lab. 1 Embedded system Lab.

Slides:



Advertisements
Similar presentations
Welcome to Who Wants to be a Millionaire
Advertisements

Threads Chapter 4 Threads are a subdivision of processes
Chapter 6 I/O Systems.
Chapter 13: I/O Systems I/O Hardware Application I/O Interface
Process Description and Control
1 Concurrency: Deadlock and Starvation Chapter 6.
Slide 1 Insert your own content. Slide 2 Insert your own content.
Advanced Operating Systems
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Exponents You will have 20 seconds to complete each of the following 16 questions. A chime will sound as each slide changes. Read the instructions at.
Welcome to Who Wants to be a Millionaire
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
Year 6 mental test 10 second questions Numbers and number system Numbers and the number system, fractions, decimals, proportion & probability.
1 Interprocess Communication 1. Ways of passing information 2. Guarded critical activities (e.g. updating shared data) 3. Proper sequencing in case of.
Scheduling Introduction to Scheduling
Editing Instructions Simply add a question and 4 possible answers by overtyping the white text. The green box on the next slide shows which answer should.
Welcome to Who Wants to be a Millionaire
£1 Million £500,000 £250,000 £125,000 £64,000 £32,000 £16,000 £8,000 £4,000 £2,000 £1,000 £500 £300 £200 £100 Welcome.
Welcome to Who Wants to be a Millionaire
1 Communication in Distributed Systems REKs adaptation of Tanenbaums Distributed Systems Chapter 2.
Chapter 8 Interfacing Processors and Peripherals.
I/O and Networking Fred Kuhns
I/O Systems.
Slide 19-1 Copyright © 2004 Pearson Education, Inc. Operating Systems: A Modern Perspective, Chapter 19.
LOTTERY SCHEDULING: FLEXIBLE PROPORTIONAL-SHARE RESOURCE MANAGEMENT
© S Haughton more than 3?
5.9 + = 10 a)3.6 b)4.1 c)5.3 Question 1: Good Answer!! Well Done!! = 10 Question 1:
How to Find the Square Root of a Non-Perfect Square
Created by Susan Neal $100 Fractions Addition Fractions Subtraction Fractions Multiplication Fractions Division General $200 $300 $400 $500 $100 $200.
$1 Million $500,000 $250,000 $125,000 $64,000 $32,000 $16,000 $8,000 $4,000 $2,000 $1,000 $500 $300 $200 $100 Welcome.
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
3.1 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Process An operating system executes a variety of programs: Batch system.
1 Processes and Threads Chapter Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling.
Processes Management.
Processes Management.
Operating System Architecture and Distributed Systems
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
Fakultät für informatik informatik 12 technische universität dortmund Lab 3: Scheduling Solution - Session 10 - Heiko Falk TU Dortmund Informatik 12 Germany.
Håkan Sundell, Chalmers University of Technology 1 Evaluating the performance of wait-free snapshots in real-time systems Björn Allvin.
Week 1.
We will resume in: 25 Minutes.
Partial Products. Category 1 1 x 3-digit problems.
Bottoms Up Factoring. Start with the X-box 3-9 Product Sum
3-Software Design Basics in Embedded Systems
G Robert Grimm New York University Lottery Scheduling.
1 Pertemuan 8 Penjadwalan (lanjutan) Matakuliah: T0316/sistem Operasi Tahun: 2005 Versi/Revisi: 5.
RTOS Scheduling – II EE202A (Fall 2001): Lecture #5.
Scheduling CS623, Lecture 7 3/9/2004 © Joel Wein, updated by T. Suel.
Lottery Scheduling: Flexible Proportional-Share Resource Management Sim YounSeok C. A. Waldspurger and W. E. Weihl.
Outline for Today Objectives: Linux scheduler Lottery scheduling
Advanced Operating Systems (CS 202) Scheduling Jan, 20, 2016.
Course Introduction CSSE 332 Operating Systems Rose-Hulman Institute of Technology.
Outline for Today Objectives: Announcements Interrupts (continued)
PROCESS MANAGEMENT IN MACH
The Mach Operating System
Advanced Operating Systems (CS 202) Scheduling (2)
Lottery Scheduling and Dominant Resource Fairness (Lecture 24, cs262a)
Lottery Scheduling: Flexible Proportional-Share Resource Management
Lottery Scheduling Ish Baid.
CSE 542: Operating Systems
Presentation transcript:

Embedded System Lab. 1 Embedded system Lab.

Internal seminar Embedded System Lab. 2 contents Lottery Scheduling Defined Lottery scheduling Implementation

Internal seminar Embedded System Lab. 3 Lottery Scheduling Defined Lottery scheduling is a randomized resource allocation mechanism. Resource rights are represented by lottery tickets. Each allocation is determined by holding a lottery; the resource is granted to the client with the winning ticket. [Waldspurger]

Internal seminar Embedded System Lab. 4 Lottery scheduling Resource rights Lottery Tickets encapsulate Resource Rights that are abstract, relative, and uniform. Abstraction Relativity uniformity

Internal seminar Embedded System Lab. 5 Lottery scheduling Lotteries Scheduling by lottery is probabilistically fair. How many wins?

Internal seminar Embedded System Lab. 6 Lottery scheduling Lotteries When to wins? Starvation dose not exist.

Internal seminar Embedded System Lab. 7 Modular resource management Ticket? The explicit representation of resource rights. Provides a convenient substrate for modular resource management.

Internal seminar Embedded System Lab. 8 Modular resource management Ticket transfers Ticket Avoid Priority inversion problem => priority inheritance Ticket :3Ticket :10Ticket :5 c a b b a c t

Internal seminar Embedded System Lab. 9 Modular resource management Ticket Inflation Provides alternative to transfers. Escalating resource rights by creating more tickets. In general, such inflation should be disallowed. However, ticket inflation can be very useful among mutually trusting clients.

Internal seminar Embedded System Lab. 10 Modular resource management Ticket currencies Local abstraction barrier: Interpretation of value of a ticket in different modules Base currency + exchange rate Compensation tickets A client which consumes only a fraction f of its allocated resource quantum can be granted a compensation ticket that inflates ins value by 1/f until the client starts its next quantum.

Internal seminar Embedded System Lab. 11 Implementation 25MHz MUPS-based DECStation 5000/125 Mach kernel 3.0 Scheduling quantum : 100ms Random number park-miller algorithm Executes in approximately 10 RISC instructions.

Internal seminar Embedded System Lab. 12 Implementation Lotteries Winning ticket random Ticket O(n) Partial ticket tree : O(lg n)

Internal seminar Embedded System Lab. 13 Implementation Mach kernel interface A minimal lottery scheduling interface is exported by the microkernel. operation Create, destroy ticket currency

Internal seminar Embedded System Lab. 14 Implementation Ticket currencies

Internal seminar Embedded System Lab. 15 Implementation Compensation Tickets This is consistent with proportional sharing, and permits I/O-bound tasks that use few processor cycle to start quickly. A B Ticket : 400 Quantum : 100ms A 100ms B 20ms After 100msAfter 20ms f=1/5 Compensation tickets = /f = 2000 B = 2000 tickets

Internal seminar Embedded System Lab. 16 Implementation Ticket Transfers mach_msg system call Synchronous RPCs client server ticket transfer User interface User-level comands Create/destroy tickets and currencies mktkt, rmtkt, mkcur, rmcur Fund/unfund a currency fund, unfund Execute a shell command fundx