NET 424: REAL-TIME SYSTEMS (Practical Part)

Slides:



Advertisements
Similar presentations
CSE 421 Algorithms Richard Anderson Lecture 23 Network Flow Applications.
Advertisements

ASSIGNMENT 1 Model Answers. Question 1 Q1) Consider building a garden shed project, which involves designing the shed, figuring out what materials are.
READING QUIZ In the analysis of a planar truss, all the member are assumed to be ___________. A) three-force member B) zero-force member C) two-force member.
Section 2.6 Question 1. Section 2.6 Answer 1 Section 2.6 Question 2.
CSE 421 Algorithms Richard Anderson Lecture 22 Network Flow.
CSE 421 Algorithms Richard Anderson Lecture 24 Network Flow Applications.
CSEP 521 Applied Algorithms
EXAMPLE 1 Solve absolute value inequalities
 The factorial function (n!)  Permutations  Combinations.
Statistical Analysis Professor Lynne Stokes Department of Statistical Science Lecture 14 Sequential Experimentation, Screening Designs, Fold-Over Designs.
Chapter 4 sections 1 and 2.  Fig. 1  Not connected  All vertices are even.  Fig. 2  Connected  All vertices are even.
Introduction To simplify an expression, such as (a + bx)(c + dx), polynomials can be multiplied. Unlike addition and subtraction of polynomial terms, any.
Chinese postman problem
CSE 421 Algorithms Richard Anderson Lecture 26 Network Flow Applications.
AP Calculus BC September 9, 2015 Day 7 – The Chain Rule and Implicit Differentiation.
Graphing Inequalities Solving One-Step Inequalities Solving Multi-Step Inequalities.
5.4 Factor and Solve Polynomial Equations Day 2 Algebra 2.
3.6 Solving Absolute Value Equations and Inequalities
Ch. 1-5 Absolute Value Equations and Inequalities.
Introduction to Real-Time Systems
Determine the sequence of genes along a chromosome based on the following recombination frequencies A-C 20% A-D 10% B-C 15% B-D 5%
NET 222: COMMUNICATIONS AND NETWORKS FUNDAMENTALS ( NET 222: COMMUNICATIONS AND NETWORKS FUNDAMENTALS (PRACTICAL PART) Tutorial 4 : Chapter 5 Data & computer.
CSE 421 Algorithms Richard Anderson Lecture 22 Network Flow.
CSE 421 Algorithms Richard Anderson Lecture 24 Network Flow Applications.
Lecture 9 CSE 331 June 18, The “real” end of Semester blues MondayTuesdayWednesdayThursdayFriday Project 331 HW Exam study Party! Write up a term.
南亚和印度.
The graph is neither Eulerian or Semi – Eulerian as it has 4 ODD vertices.
Shared Mathematics Working together (talking / sharing) Working at centres Using manipulatives Explaining / justifying Answering “How do I know?” Independent.
COMM 470 Week 5 Learning Team Social Media Tools in Ecommerce ​ Check this A+ tutorial guideline at Week-5-Learning-Team-Social-Media-Tools-in-Ecommerce.
Warm-Up 3) 1) 4) Name the dimensions 2).
Real Numbers and Their Properties
Topological Sort (an application of DFS)
Combinations COURSE 3 LESSON 11-3
COMMUNICATION.
PROJECT MANAGEMENT WITH CPM/PERT.
1.3 Segments & Their Measures
Deterministic Models: Preliminaries
Type Topic in here! Created by Educational Technology Network
الفصل السادس: التعلم عن بعد (تال101ت)
فرایند تسهیلگری در مددکاری جامعه ای
در تجزیه و تحلیل شغل باید به 3 سوال اساسی پاسخ دهیم Job analysis تعریف کارشکافی، مطالعه و ثبت جنبه های مشخص و اساسی هر یک از مشاغل عبارتست از مراحلی.
Welcome to Accel Precalculus !!!
Deterministic Models: Preliminaries
Richard Anderson Lecture 23 Network Flow Applications
برنامج قواعد البيانات (مايكروسوفت أوفيس اكسس (Microsoft Office Access
تجزیه و تحلیل تصمیم گیری
Lecture 12 CSE 331 Sep 26, 2016.
Richard Anderson Lecture 27 Network Flow Applications
Warm-up 3.).
Modeling Scheduling Problems
Introduction to Transportation Engineering
1-2 Measuring & Constructing Segments
Lecture 9: Radix-64 Tutorial
Lesson 3.2 Segment Measure pp
AB AC AD AE AF 5 ways If you used AB, then, there would be 4 remaining ODD vertices (C, D, E and F) CD CE CF 3 ways If you used CD, then, there.
NET 424: REAL-TIME SYSTEMS (Practical Part)
Indicator 10 Solving Inequalities.
Net 222: Communications and networks fundamentals (Practical Part)
NET 424: REAL-TIME SYSTEMS (Practical Part)
Net 222: Communications and networks fundamentals (Practical Part)
NET 424: REAL-TIME SYSTEMS (Practical Part)
NET 424: REAL-TIME SYSTEMS (Practical Part)
Figure 9.1.
Warm-Up 3) 1) 4) Name the dimensions 2).
NET 424: REAL-TIME SYSTEMS (Practical Part)
Kruskal’s Algorithm AQR.
Richard Anderson Lecture 23 Network Flow Applications
Addition Property of Inequality
Line Graphs.
1.5: Solving Inequalities
Presentation transcript:

NET 424: REAL-TIME SYSTEMS (Practical Part) Networks and Communication Department Tutorial 5 : on lecture 4

Question 1 Assume there are 6 jobs given the following execution time and Absolute Deadline find the following for each job: 1. Latency 2. Tardiness 3. Average Latency L Job(J) 1 2 3 4 5 6 E(J) 7 17 27 35 41 D(J) 9 15 20 23 30 Networks and Communication Department

Answer 1-Latency = E(J) – D(J) : Job(J) 1 2 3 4 5 6 E(J) 7 17 27 35 41 9 15 20 23 30 L(J) -3 -2 12 11 Networks and Communication Department

Answer (Cont.) 2. Tardiness (J) = Max [ 0, L(J) ] Job(J) 1 2 3 4 5 6 E(J) 7 17 27 35 41 D(J) 9 15 20 23 30 L(J) -3 -2 12 11 Tardiness(J) Networks and Communication Department

Answer (Cont.) 3- Average(L)=L = sum( |L| ) / # of jobs = 37 /6 = 6.16 Networks and Communication Department

Question 2 By given 7 the tasks : A, B, C, D, E, F, G Construct the precedence graph A<C B<C C<E D<F B<D C<F D<G Networks and Communication Department

Answer 2 A C E B F D G Networks and Communication Department