Warm Up – 3/25 - Tuesday Bill is taking a sales trip starting in Atlanta. Draw a graph that represents this table. Find the nearest neighbor tour from.

Slides:



Advertisements
Similar presentations
Time Management: An Issue  The idea of a VPA came as a solution to time management problems because every person feels like more time is needed to function.
Advertisements

CS 149: Operating Systems February 3 Class Meeting
Fakultät für informatik informatik 12 technische universität dortmund Lab 3: Scheduling - Session 10 - Peter Marwedel Heiko Falk TU Dortmund Informatik.
Chapter 8: Scheduling “Science is organized knowledge. Wisdom is organized life.” -Immanuel Kant.
SCHEDULING Critical Activities are: B, F, I, M, Q.
The Mathematics of Scheduling Chapter 8. How long does it take to build a house? It depends on Size of the house Type of construction Number of workers.
Lesson 17: Objective: Relate decimal and fraction multiplication
Warm-ups Week of February 16-20, 2015.
Reading Time/Distance Graphs 2D Motion Simulation.
Tips for Beginning & Ending a Tutoring Session
A processor is a person, machine, computer, or robot etc., which works on a task. To solve a scheduling problem typically the tasks are scheduled to minimize.
Woodstown Middle School Moving through Middle School Organization and Study Skills.
Selecting, Formatting, and Printing a finished Report…….
More Language of Algebra (Basics). The Commutative and Associative Properties can be used with other properties when evaluating and simplifying.
Spring 2015 Mathematics in Management Science Machine Scheduling Problem Statement of MSP Assumptions & Goals Priority Lists List Processing Algorithm.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 6 The Mathematics of Touring 6.1Hamilton Paths and Hamilton Circuits.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 8 The Mathematics of Scheduling 8.1The Basic Elements of Scheduling.
Spring 2015 Mathematics in Management Science Critical Path Scheduling Critical Paths & Times Backflow Algorithm Critical Times PL Critical Path Algorithm.
Ordering Real Numbers.
© 2000 Morgan Kaufman Overheads for Computers as Components Processes and operating systems  Operating systems.
© 2000 Morgan Kaufman Overheads for Computers as Components Processes and operating systems Operating systems. 1.
RTOS task scheduling models
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 March 03, 2005 Session 15.
Jumping Jack Experiment Sixth Grade Common Core State Standard EE.C.9.
Planning under Uncertainty Lab This lab asks you to develop your own algorithm for planning when the environment is partially observable and dynamic.
CSCI1600: Embedded and Real Time Software Lecture 24: Real Time Scheduling II Steven Reiss, Fall 2015.
Time Management  A system of skills to use time in effective and productive ways  Most common steps:  Prevent or reduce stress  Keep an activity record.
Cleaning up the CFG Eliminating useless nodes & edges This lecture describes the algorithm Clean, presented in Chapter 10 of EaC2e. The algorithm is due.
Multithreading The objectives of this chapter are: To understand the purpose of multithreading To describe Java's multithreading mechanism.
QUANTITATIVE METHODS FOR MANAGERS ASSIGNMENT MODEL.
Planning and Scheduling.  A job can be made up of a number of smaller tasks that can be completed by a number of different “processors.”  The processors.
8.2: Digraphs (continue). Digraphs Example 1) TASKSTIMETASKS BEFORE A3 B10C,F,G C2A D4G E5C F8A,H G7H H5.
Process Control Management Prepared by: Dhason Operating Systems.
CSC 480 Software Engineering Project Planning. Proposal writing Project planning and scheduling Project costing Project monitoring and reviews Personnel.
Managing Your Stress Lesson 4. Identify physical, mental, and emotional signs of stress. Managing stress is part of mental and physical health. Stress.
AP STATISTICS LESSON AP STATISTICS LESSON PROBABILITY MODELS.
SPACE SHUTTLE.
Tabu Search for Solving Personnel Scheduling Problem
I Have! Who Has?.
Time Management Tips for Students
Weighted Graphs and traveling Salesperson problem
Activity networks – Example 1
Monitoring Implementation and Sustainability
Uniform Distributions and Random Variables
Topological Sort In this topic, we will discuss: Motivations
Activity List the human resources needed on your project
Week 1.
Study Skills That Pay the Bills
Flavius Gruian < >
Processor Management Damian Gordon.
Chapter 5: CPU Scheduling
Number Words   two one three.
Scheduling Theory By Sarah Walker 12/4/2018.
Let’s Write Numbers On the Farm
Recursively Defined Sequences
CSCI1600: Embedded and Real Time Software
Planning and Scheduling
Uniform Distributions and Random Variables
Processes and operating systems
NET 424: REAL-TIME SYSTEMS (Practical Part)
Planning and Scheduling
Modeling Discrete Variables
Hamilton Paths and Hamilton Circuits
Time Management A system of skills to use time in effective and productive ways Most common steps: Prevent or reduce stress Keep an activity record Organize.
Warm Up – 3/27 - Thursday Write a priority list using the decreasing time algorithm. Do you see any problem with this?
Tuesday September 30-Friday October 3
Warm Up: take out yesterday’s paper
Processor Management Damian Gordon.
Objective: Understand limit notation. Find limits using table of values. Warm up 1. What happens along the graph of as you.
Warm up 19 1.) Graph using 3 points x +3y =6
Presentation transcript:

Warm Up – 3/25 - Tuesday Bill is taking a sales trip starting in Atlanta. Draw a graph that represents this table. Find the nearest neighbor tour from Atlanta.

Priority List Scheduling A priority list is a list of all the tasks prioritized in the order we prefer to execute them. If task X is ahead of task Y in the priority list, then if we are given the choice to do X or Y, we will perform task X. Priority lists are a time management device. The trick is finding a priority list that gives us a good time.

Example #1 Before launching a shuttle into space, five system checks (A, B, C, D, and E) must be performed. (Note: A(6) means it takes 6 hours to complete task A)

Priority List We are given the following priority list: A(6), B(5), C(7), D(2), E(5) We have two identical computers ( 𝑃 1 𝑎𝑛𝑑 𝑃 2 ) checking the systems. Our goal is to describe what happens!

Example #1 A(6), B(5), C(7), D(2), E(5) 𝑇=0 (𝑆𝑡𝑎𝑟𝑡). We assign 𝑃 1 to task A and 𝑃 2 to task B. 𝑇=5. 𝑃 1 is still working on task A. 𝑃 2 finishes task B. We cannot perform D until both A and B have finished! So we assign 𝑃 2 to begin work on C.

Example #1 A(6), B(5), C(7), D(2), E(5) 𝑇=6. 𝑃 1 has completed task A. 𝑃 2 is working on C. 𝐴 𝑎𝑛𝑑 𝐵 have both completed so we assign 𝑃 1 to D. 𝑇=8. 𝑃 1 finishes task D. There are no more tasks for 𝑃 1 so it sits idle. 𝑃 2 continues working on C.

Example #1 A(6), B(5), C(7), D(2), E(5) 𝑇=12. 𝑃 2 finishes task C. We assign 𝐸 to 𝑃 1 . 𝑇=17. 𝑃 1 finishes task E. We are ready for launch.

Example #2 Our previous priority list took quite a long time and was probably not an optimal use of time. Lets reverse our Priority list: E(5), D(2), C(7), B(5), A(6)

Example #2 E(5), D(2), C(7), B(5), A(6) 𝑇=0 𝑆𝑡𝑎𝑟𝑡 . We can start with A, B, or C. According to our priority list we start with B and C. 𝑃 1 gets assigned to C, 𝑃 2 gets assigned to B. 𝑇=5. 𝑃 2 finishes task B. 𝑃 1 still working on C. 𝑃 2 is assigned the only available task A.

Example #2 E(5), D(2), C(7), B(5), A(6) 𝑇=7. 𝑃 1 finishes task C. 𝑃 2 continues working on A. 𝑃 1 begins work on E which is the highest priority. 𝑇=11. 𝑃 2 finishes task A. 𝑃 2 begins working on 𝐷 2 . 𝑇=12. 𝑃 1 finishes E. Sits idle. 𝑇=13. 𝑃 2 finishes D. Finished.

Example #2 As you an see, there is much less idle time and the project gets done four hours faster!