# OPERATING SYSTEMS. Systems and Models. CS 3502 Spring Chapter 03

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 OPERATING SYSTEMS CS 3502 Spring 2018 Systems and Models Chapter 03

2 Systems and Models A system is the part of the real world under study. It is composed of a set of entities interacting among themselves and with the environment. A model is an abstract representation of a system. The system behavior is dependent on the input data and actions from the environment.

3 Abstraction The most important concept in analysis and design A high-level description of a collection of objects Only the relevant properties and features of the objects are included.

4 System A system has: Structure Behavior The model of a system is simpler than the real system in its structure and behavior. But it should be equivalent to the system.

5 A High-Level Model

6 Using Models A user can: Manipulate the model by supplying it with a set of inputs Observe its behavior or output Predict the behavior of the real system by analyzing the behavior of the model.

7 Behavior of a Model Depends on: The passage of time Input data Events generated by the environment

8 Types of Model The most general categories of models are: Physical models Graphical models Mathematical models. These are the most flexible ones and are the ones studied here.

9 Solutions to Mathematical Models Analytic, the solution is a set of expressions that define the behavior of the model. Numeric, mathematical techniques are used to derive values for the model behavior within given intervals. Deterministic and stochastic models are solved with numerical techniques.

10 Models with Uncertain Behavior Models are further categorized as: Deterministic - models that display a completely predictable behavior (with 100% certainty) Stochastic - models that display some level of uncertainty in their behavior. This random behavior is implemented with random variables.

11 Model of a Simple Batch System

12 Stochastic Models One or more attributes (implemented as random variables) change value according to some probability distribution. Example of random variables in the simple batch OS model: Inter-arrival time of jobs CPU service time of jobs

13 Random Variables The values of most workload parameters change randomly, and are represented by a probability distribution. For example, in a model of a computer system, the interarrival intervals of jobs usually follow an exponential distribution. Other probability distributions that are used in the models discussed in this book are: normal, uniform, and Poisson. In the simulation models considered, most workload parameters are implemented as random variables.

14 Simulation Models A simulation model is a mathematical model implemented with a general-purpose programming language, or a simulation language. A simulation run is an experiment carried out for some observation period and with the simulation model to study the behavior of the model.

15 Continuous and Discrete Models Continuous models change their state continuously with time. Mathematical notation is used to completely define the behavior. For example, the free-falling object. Discrete models only change their state at discrete instants. For example, arrival of a job in the Simple batch OS model.

16 Simulation Results For every simulation run there are two types of output: Trace - sequence of events that occur during the simulation period Performance measures - summary statistics about the simulation.

17 Studying Operating Systems To study the structure and behavior of an OS is a very complicated task Modeling and simulation are used to study the different components and various aspects of an operating system.

18 Performance Measures Measures that indicate how well (or bad) is the system being studied carrying out its functions, with respect to some aspect In studying a system, usually several performance measures are necessary.

19 Approaches for Studying Performance Measurements on the real system Simulation models Analytical models

20 Performance: External Goals Goals that can be measured without looking at the internals of a system Examples Maximize Work Performed (Throughput) Minimize Response Time Fairness Scheduling processes Goals often conflict

21 Performance: Internal Goals Performance Goals for sub-systems that are internal to the computer(s) Examples Maximize CPU Utilization % time CPU is busy Maximize Disk Utilization % time Disk is busy Minimize Disk Access Time Time it takes to perform a disk request

22 Performance Study Define a set of relevant objectives and goals Decide on the following: The performance metrics The system parameters The system factors The system workloads

23 Workload on a System The performance measures depend on the current workload of the system The workload for a system can be characterized by another series of measures, which are made on the input to the system Errors in characterizing the workload may have serious consequences.

24 Workload Parameters Inter-arrival time Task size I/O request rate I/O service rate Memory request

25 System Parameters System memory Processor speed Number and type of processors Degree of multi-programming Length of time slice Number and type of I/O ports

26 Arrival Interval & Rate Arrival Interval is the time between 2 resource requests arriving Arrival Rate = 1 / Arrival Interval How often requests for a resource arrive Denoted by λ

27 Service Time & Rate Service Time is the time to actually perform a request e.g. 500 Msec / request Service Rate = 1 / Service Time Denoted by μ e.g. 2 requests / second

28 Arrival Rate vs Service Rate Arrival Rate < Service Rate Resource can handle requests Queuing Time will be small If Arrival Rate significantly less Resource may be under-utilized

29 Arrival Rate vs Service Rate Arrival Rate = Service Rate Resource fully utilized Resource can generally handle requests But Requests will often be queued

30 Arrival Rate vs Service Rate Arrival Rate > Service Rate Resource unable to handle all requests Queuing Time may be large If difference is large Resource will be over-utilized

31 Arrival Rate vs Service Rate Both rates will change from one instant to another Queuing system & resource scheduling handle momentary imbalances Long-term imbalances indicate a system with a major resource utilization problem

32 Service Time Is the Service Time for a given request always the same?

33 Service Time Service Time for a given request can vary A request to read data from a certain part of a disk will not always take the same amount of time. For some resources, a request s Service Time may be affected by the previous requests that have been executed

34 Relevant Performance Measures Throughput Capacity Response time Utilization Reliability Speedup Backlog

35 Meaning of Performance Measures The average number of jobs in the system The average number of jobs in the queue(s) (i.e., that are waiting) The average time that a job spends in the system The average time that a job spends in the queue(s) The CPU utilization Throughput - the total number of jobs serviced.

36 System Capacity The capacity of a system is determined by its maximum performance The nominal capacity of a system is given by the maximum achievable throughput under ideal conditions The usable capacity is the maximum throughput achievable under specified constraints.

37 Bottleneck The computer system reaches capacity when one or more of its servers or resources reach a utilization close to 100%. The bottleneck of the system will be localized in the server or resource with a utilization close to 100%, while the other servers and resources each have utilization significantly below 100%.

38 Modeling Bottleneck The bottleneck of the computer system described here can be localized at the processor, the queue, or the memory. The queue may become full (reaches capacity) very often as the processor utilization increases. The memory capacity may also be used at capacity (100%). Thus, in any of the three cases, the processor, the queue, or the memory will need to be replaced or increased in capacity.

39 Efficiency and Reliability The efficiency of a system is the ratio usable capacity to nominal capacity The reliability of a system is measured by the probability of errors. Also defined as the mean time between errors. Availability is the fraction of time that the system is available for user requests, also called the system uptime.

40 A More Complete Model of a Computer System

41

42

### Lecture 11: CPU Scheduling

CS 422/522 Design & Implementation of Operating Systems Lecture 11: CPU Scheduling Zhong Shao Dept. of Computer Science Yale University Acknowledgement: some slides are taken from previous versions of

### Motivating Examples of the Power of Analytical Modeling

Chapter 1 Motivating Examples of the Power of Analytical Modeling 1.1 What is Queueing Theory? Queueing theory is the theory behind what happens when you have lots of jobs, scarce resources, and subsequently

### An-Najah National University Faculty of Engineering Industrial Engineering Department. System Dynamics. Instructor: Eng.

An-Najah National University Faculty of Engineering Industrial Engineering Department System Dynamics Instructor: Eng. Tamer Haddad Introduction Knowing how the elements of a system interact & how overall

### Intro to O/S Scheduling. Intro to O/S Scheduling (continued)

Intro to O/S Scheduling 1. Intro to O/S Scheduling 2. What is Scheduling? 3. Computer Systems Scheduling 4. O/S Scheduling Categories 5. O/S Scheduling and Process State 6. O/S Scheduling Layers 7. Scheduling

### Scheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling

Scheduling I Today! Introduction to scheduling! Classical algorithms Next Time! Advanced topics on scheduling Scheduling out there! You are the manager of a supermarket (ok, things don t always turn out

### Chapter III TRANSPORTATION SYSTEM. Tewodros N.

Chapter III TRANSPORTATION SYSTEM ANALYSIS www.tnigatu.wordpress.com tedynihe@gmail.com Lecture Overview Traffic engineering studies Spot speed studies Volume studies Travel time and delay studies Parking

### EPOCH TASK SCHEDULING IN DISTRIBUTED SERVER SYSTEMS

EPOCH TASK SCHEDULING IN DISTRIBUTED SERVER SYSTEMS Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki 5424 Thessaloniki, Greece Email: karatza@csd.auth.gr KEYWORDS Simulation,

### PERFORMANCE MODELING OF AUTOMATED MANUFACTURING SYSTEMS

PERFORMANCE MODELING OF AUTOMATED MANUFACTURING SYSTEMS N. VISWANADHAM Department of Computer Science and Automation Indian Institute of Science Y NARAHARI Department of Computer Science and Automation

### System. Figure 1: An Abstract System. If we observed such an abstract system we might measure the following quantities:

2 Operational Laws 2.1 Introduction Operational laws are simple equations which may be used as an abstract representation or model of the average behaviour of almost any system. One of the advantages of

### Resource Allocation Strategies in a 2-level Hierarchical Grid System

st Annual Simulation Symposium Resource Allocation Strategies in a -level Hierarchical Grid System Stylianos Zikos and Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki 5

### G54SIM (Spring 2016)

G54SIM (Spring 2016) Lecture 03 Introduction to Conceptual Modelling Peer-Olaf Siebers pos@cs.nott.ac.uk Motivation Define what a conceptual model is and how to communicate such a model Demonstrate how

### Reference model of real-time systems

Reference model of real-time systems Chapter 3 of Liu Michal Sojka Czech Technical University in Prague, Faculty of Electrical Engineering, Department of Control Engineering November 8, 2017 Some slides

### Principles of Operating Systems

Principles of Operating Systems Lecture 9-10 - CPU Scheduling Ardalan Amiri Sani (ardalan@uci.edu) [lecture slides contains some content adapted from previous slides by Prof. Nalini Venkatasubramanian,

### Motivation. Types of Scheduling

Motivation 5.1 Scheduling defines the strategies used to allocate the processor. Successful scheduling tries to meet particular objectives such as fast response time, high throughput and high process efficiency.

### Chapter 6: CPU Scheduling. Basic Concepts. Histogram of CPU-burst Times. CPU Scheduler. Dispatcher. Alternating Sequence of CPU And I/O Bursts

Chapter 6: CPU Scheduling Basic Concepts Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation Maximum CPU utilization obtained

### Justifying Simulation. Why use simulation? Accurate Depiction of Reality. Insightful system evaluations

Why use simulation? Accurate Depiction of Reality Anyone can perform a simple analysis manually. However, as the complexity of the analysis increases, so does the need to employ computer-based tools. While

### Introduction to Experimental Design

Introduction to Experimental Design Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu These slides are available on-line at: http://www.cse.wustl.edu/~jain/cse567-08/

### Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations

Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki 54006 Thessaloniki, Greece karatza@csd.auth.gr Abstract

### Discrete Event Simulation: A comparative study using Empirical Modelling as a new approach.

Discrete Event Simulation: A comparative study using Empirical Modelling as a new approach. 0301941 Abstract This study introduces Empirical Modelling as a new approach to create Discrete Event Simulations

### Principles of Inventory Management

John A. Muckstadt Amar Sapra Principles of Inventory Management When You Are Down to Four, Order More fya Springer Inventories Are Everywhere 1 1.1 The Roles of Inventory 2 1.2 Fundamental Questions 5

### CS 153 Design of Operating Systems Winter 2016

CS 153 Design of Operating Systems Winter 2016 Lecture 11: Scheduling Scheduling Overview Scheduler runs when we context switching among processes/threads on the ready queue What should it do? Does it

### Queuing Theory: A Case Study to Improve the Quality Services of a Restaurant

Queuing Theory: A Case Study to Improve the Quality Services of a Restaurant Lakhan Patidar 1*, Trilok Singh Bisoniya 2, Aditya Abhishek 3, Pulak Kamar Ray 4 Department of Mechanical Engineering, SIRT-E,

### 10/1/2013 BOINC. Volunteer Computing - Scheduling in BOINC 5 BOINC. Challenges of Volunteer Computing. BOINC Challenge: Resource availability

Volunteer Computing - Scheduling in BOINC BOINC The Berkley Open Infrastructure for Network Computing Ryan Stern stern@cs.colostate.edu Department of Computer Science Colorado State University A middleware

### Balancing Risk and Economics for Chemical Supply Chain Optimization under Uncertainty

Balancing Risk and Economics for Chemical Supply Chain Optimization under Uncertainty Fengqi You and Ignacio E. Grossmann Dept. of Chemical Engineering, Carnegie Mellon University John M. Wassick The Dow

### Ferry Rusgiyarto S3-Student at Civil Engineering Post Graduate Department, ITB, Bandung 40132, Indonesia

International Journal of Civil Engineering and Technology (IJCIET) Volume 8, Issue 10, October 2017, pp. 1085 1095, Article ID: IJCIET_08_10_112 Available online at http://http://www.iaeme.com/ijciet/issues.asp?jtype=ijciet&vtype=8&itype=10

### Uniprocessor Scheduling

Chapter 9 Uniprocessor Scheduling In a multiprogramming system, multiple processes are kept in the main memory. Each process alternates between using the processor, and waiting for an I/O device or another

### Chapter 13. Waiting Lines and Queuing Theory Models

Chapter 13 Waiting Lines and Queuing Theory Models To accompany Quantitative Analysis for Management, Eleventh Edition, by Render, Stair, and Hanna Power Point slides created by Brian Peterson Learning

### Addressing UNIX and NT server performance

IBM Global Services Addressing UNIX and NT server performance Key Topics Evaluating server performance Determining responsibilities and skills Resolving existing performance problems Assessing data for

### Lecture Note #4: Task Scheduling (1) EECS 571 Principles of Real-Time Embedded Systems. Kang G. Shin EECS Department University of Michigan

Lecture Note #4: Task Scheduling (1) EECS 571 Principles of Real-Time Embedded Systems Kang G. Shin EECS Department University of Michigan 1 Reading Assignment Liu and Layland s paper Chapter 3 of the

### A COMPARATIVE ANALYSIS OF SCHEDULING POLICIES IN A DISTRIBUTED SYSTEM USING SIMULATION

H. KARATZA: COMPARATIVE AALYSIS A COMPARATIVE AALYSIS OF SCHEDULIG POLICIES I A DISTRIBUTED SYSTEM USIG SIMULATIO HELE D. KARATZA Department of Informatics Aristotle University of Thessaloniki 46 Thessaloniki,

### Allocating work in process in a multiple-product CONWIP system with lost sales

Industrial and Manufacturing Systems Engineering Publications Industrial and Manufacturing Systems Engineering 2005 Allocating work in process in a multiple-product CONWIP system with lost sales Sarah

### TimeNet - Examples of Extended Deterministic and Stochastic Petri Nets

TimeNet - Examples of Extended Deterministic and Stochastic Petri Nets Christoph Hellfritsch February 2, 2009 Abstract TimeNet is a toolkit for the performability evaluation of Petri nets. Performability

### Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds

Proceedings of the 0 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds OPTIMAL BATCH PROCESS ADMISSION CONTROL IN TANDEM QUEUEING SYSTEMS WITH QUEUE

### A Paper on Modified Round Robin Algorithm

A Paper on Modified Round Robin Algorithm Neha Mittal 1, Khushbu Garg 2, Ashish Ameria 3 1,2 Arya College of Engineering & I.T, Jaipur, Rajasthan 3 JECRC UDML College of Engineering, Jaipur, Rajasthan

### Allocating work in process in a multiple-product CONWIP system with lost sales

Allocating work in process in a multiple-product CONWIP system with lost sales S. M. Ryan* and J. Vorasayan Department of Industrial & Manufacturing Systems Engineering Iowa State University *Corresponding

### Asymptotic Analysis of Real-Time Queues

Asymptotic Analysis of John Lehoczky Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 Co-authors: Steve Shreve, Kavita Ramanan, Lukasz Kruk, Bogdan Doytchinov, Calvin Yeung, and

### Midterm for CpE/EE/PEP 345 Modeling and Simulation Stevens Institute of Technology Fall 2003

Midterm for CpE/EE/PEP 345 Modeling and Simulation Stevens Institute of Technology Fall 003 The midterm is open book/open notes. Total value is 100 points (30% of course grade). All questions are equally

### PERFORMANCE EVALUATION OF DEPENDENT TWO-STAGE SERVICES

PERFORMANCE EVALUATION OF DEPENDENT TWO-STAGE SERVICES Werner Sandmann Department of Information Systems and Applied Computer Science University of Bamberg Feldkirchenstr. 21 D-96045, Bamberg, Germany

### Utilization vs. Throughput: Bottleneck Detection in AGV Systems

Utilization vs. Throughput: Bottleneck Detection in AGV Systems Christoph Roser Masaru Nakano Minoru Tanaka Toyota Central Research and Development Laboratories Nagakute, Aichi 480-1192, JAPAN ABSTRACT

### Hamdy A. Taha, OPERATIONS RESEARCH, AN INTRODUCTION, 5 th edition, Maxwell Macmillan International, 1992

Reference books: Anderson, Sweeney, and Williams, AN INTRODUCTION TO MANAGEMENT SCIENCE, QUANTITATIVE APPROACHES TO DECISION MAKING, 7 th edition, West Publishing Company,1994 Hamdy A. Taha, OPERATIONS

### Operations and Supply Chain Simulation with AnyLogic

Operations and Supply Chain Simulation with AnyLogic Decision-oriented introductory notes for management students in bachelor and master programs Prof. Dr. Dmitry Ivanov Berlin School of Economics and

### Ph.D. Defense: Resource Allocation Optimization in the Smart Grid and High-performance Computing Tim Hansen

Ph.D. Defense: Resource Allocation Optimization in the Smart Grid and High-performance Computing Tim Hansen Department of Electrical and Computer Engineering Colorado State University Fort Collins, Colorado,

### Mathematical Modeling and Analysis of Finite Queueing System with Unreliable Single Server

IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 12, Issue 3 Ver. VII (May. - Jun. 2016), PP 08-14 www.iosrjournals.org Mathematical Modeling and Analysis of Finite Queueing

### CS 471 Operating Systems. Yue Cheng. George Mason University Fall 2017

CS 471 Operating Systems Yue Cheng George Mason University Fall 2017 Page Replacement Policies 2 Review: Page-Fault Handler (OS) (cheap) (cheap) (depends) (expensive) (cheap) (cheap) (cheap) PFN = FindFreePage()

### Use of Queuing Models in Health Care - PPT

University of Wisconsin-Madison From the SelectedWorks of Vikas Singh December, 2006 Use of Queuing Models in Health Care - PPT Vikas Singh, University of Arkansas for Medical Sciences Available at: https://works.bepress.com/vikas_singh/13/

### Chapter C Waiting Lines

Supplement C Waiting Lines Chapter C Waiting Lines TRUE/FALSE 1. Waiting lines cannot develop if the time to process a customer is constant. Answer: False Reference: Why Waiting Lines Form Keywords: waiting,

### Towards Modelling-Based Self-adaptive Resource Allocation in Multi-tiers Cloud Systems

Towards Modelling-Based Self-adaptive Resource Allocation in Multi-tiers Cloud Systems Mehdi Sliem 1(B), Nabila Salmi 1,2, and Malika Ioualalen 1 1 MOVEP Laboratory, USTHB, Algiers, Algeria {msliem,nsalmi,mioualalen}@usthb.dz

### Chapter 14. Waiting Lines and Queuing Theory Models

Chapter 4 Waiting Lines and Queuing Theory Models To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created by Jeff Heyl 2008 Prentice-Hall,

### CELLULAR BASED DISPATCH POLICIES FOR REAL-TIME VEHICLE ROUTING. February 22, Randolph Hall Boontariga Kaseemson

CELLULAR BASED DISPATCH POLICIES FOR REAL-TIME VEHICLE ROUTING February 22, 2005 Randolph Hall Boontariga Kaseemson Department of Industrial and Systems Engineering University of Southern California Los

### Application of queuing theory in construction industry

Application of queuing theory in construction industry Vjacheslav Usmanov 1 *, Čeněk Jarský 1 1 Department of Construction Technology, FCE, CTU Prague, Czech Republic * Corresponding author (usmanov@seznam.cz)

### BERTHING PROBLEM OF SHIPS IN CHITTAGONG PORT AND PROPOSAL FOR ITS SOLUTION

66 BERTHING PROBLEM OF SHIPS IN CHITTAGONG PORT AND PROPOSAL FOR ITS SOLUTION A. K. M. Solayman Hoque Additional Chief Engineer, Chittagong Dry Dock Limited, Patenga, Chittagong, Bnagladesh S. K. Biswas

### Dynamic Fractional Resource Scheduling for HPC Workloads

Dynamic Fractional Resource Scheduling for HPC Workloads Mark Stillwell 1 Frédéric Vivien 2 Henri Casanova 1 1 Department of Information and Computer Sciences University of Hawai i at Mānoa 2 INRIA, France

### Clock-Driven Scheduling

Integre Technical Publishing Co., Inc. Liu January 13, 2000 8:49 a.m. chap5 page 85 C H A P T E R 5 Clock-Driven Scheduling The previous chapter gave a skeletal description of clock-driven scheduling.

### Introduction to Real-Time Systems. Note: Slides are adopted from Lui Sha and Marco Caccamo

Introduction to Real-Time Systems Note: Slides are adopted from Lui Sha and Marco Caccamo 1 Overview Today: this lecture introduces real-time scheduling theory To learn more on real-time scheduling terminology:

### Real-Time Scheduling Theory and Ada

Technical Report CMU/SEI-88-TR-033 ESD-TR-88-034 Real-Time Scheduling Theory and Ada Lui Sha John B. Goodenough November 1988 Technical Report CMU/SEI-88-TR-033 ESD-TR-88-034 November 1988 Real-Time Scheduling

### Preface. Skill-based routing in multi-skill call centers

Nancy Marengo nmarengo@fewvunl BMI-paper Vrije Universiteit Faculty of Sciences Business Mathematics and Informatics 1081 HV Amsterdam The Netherlands November 2004 Supervisor: Sandjai Bhulai Sbhulai@fewvunl

### MIT Manufacturing Systems Analysis Lecture 1: Overview

2.852 Manufacturing Systems Analysis 1/44 Copyright 2010 c Stanley B. Gershwin. MIT 2.852 Manufacturing Systems Analysis Lecture 1: Overview Stanley B. Gershwin http://web.mit.edu/manuf-sys Massachusetts

Planning the Capacity of a Web Server: An Experience Report Daniel A. Menascé George Mason University menasce@cs.gmu.edu Nikki Dinh SRA International, Inc. nikki_dinh@sra.com Robert Peraino George Mason

### Application the Queuing Theory in the Warehouse Optimization Jaroslav Masek, Juraj Camaj, Eva Nedeliakova

Application the Queuing Theory in the Warehouse Optimization Jaroslav Masek, Juraj Camaj, Eva Nedeliakova Abstract The aim of optimization of store management is not only designing the situation of store

### STATISTICAL TECHNIQUES. Data Analysis and Modelling

STATISTICAL TECHNIQUES Data Analysis and Modelling DATA ANALYSIS & MODELLING Data collection and presentation Many of us probably some of the methods involved in collecting raw data. Once the data has

### Production Scheduling

Production Scheduling MRP, TOC & Lean Arthur Greef Software Architect Dynamics AX Production Microsoft Corporation Outline 2 Product & production classification MRP, CRP and job dispatching TOC scheduling

### Scheduling II. To do. q Proportional-share scheduling q Multilevel-feedback queue q Multiprocessor scheduling q Next Time: Memory management

Scheduling II To do q Proportional-share scheduling q Multilevel-feedback queue q Multiprocessor scheduling q Next Time: Memory management Scheduling with multiple goals What if you want both good turnaround

### Bottleneck Detection of Manufacturing Systems Using Data Driven Method

Proceedings of the 2007 IEEE International Symposium on Assembly and Manufacturing Ann Arbor, Michigan, USA, July 22-25, 2007 MoB2.1 Bottleneck Detection of Manufacturing Systems Using Data Driven Method

### CHAPTER 1. Basic Concepts on Planning and Scheduling

CHAPTER 1 Basic Concepts on Planning and Scheduling Eugénio Oliveira Scheduling, FEUP/PRODEI /MIEIC 1 Planning and Scheduling: Processes of Decision Making regarding the and ordering of activities as well

### z/vm Capacity Planning Overview

Making systems practical and profitable for customers through virtualization and its exploitation. - z/vm z/vm Capacity Planning Overview Bill Bitner z/vm Customer Care and Focus bitnerb@us.ibm.com Trademarks

### Matching Supply with Demand

Matching Supply with Demand An Introduction to Operations Management Third Edition Gerard Cachon The Wharton School, University of Pennsylvania Christian Terwiesch The Wharton School, University of Pennsylvania

### Real-Time and Embedded Systems (M) Lecture 4

Clock-Driven Scheduling Real-Time and Embedded Systems (M) Lecture 4 Lecture Outline Assumptions and notation for clock-driven scheduling Handling periodic jobs Static, clock-driven schedules and the cyclic

### Optimizing Capacity Utilization in Queuing Systems: Parallels with the EOQ Model

Optimizing Capacity Utilization in Queuing Systems: Parallels with the EOQ Model V. Udayabhanu San Francisco State University, San Francisco, CA Sunder Kekre Kannan Srinivasan Carnegie-Mellon University,

### A Reference Model of Real-Time Systems

Integre Technical Publishing Co., Inc. Liu January 10, 2000 10:48 a.m. chap3 page 34 C H A P T E R 3 A Reference Model of Real-Time Systems When we study how given applications should be scheduled on a

### SS3751 Soo Hyun Shin SY2513 Sung Woo Yoo JK3362 Jae Yoon Kim XZ2345 Xixi Zhao JL4126 Jun Li

Queuing Theory Application: Improve Food Distribution Efficiency of City Harvest s Washington Height Mobile Market by at least 20% with Multiple Suggestions SS3751 Soo Hyun Shin SY2513 Sung Woo Yoo JK3362

### Operating Systems Process Scheduling Prof. Dr. Armin Lehmann

Operating Systems Process Scheduling Prof. Dr. Armin Lehmann lehmann@e-technik.org Fachbereich 2 Informatik und Ingenieurwissenschaften Wissen durch Praxis stärkt Seite 1 Datum 11.04.2017 Process Scheduling

### Integrated Scheduling: The Best of Both Worlds

Integrated Scheduling: The Best of Both Worlds Jon B. Weissman, Lakshman Rao Abburi, and Darin England Department of Computer Science and Engineering University of Minnesota, Twin Cities Minneapolis, MN

### APPLICABILITY OF INFORMATION TECHNOLOGIES IN PARKING AREA CAPACITY OPTIMIZATION

APPLICABILITY OF INFORMATION TECHNOLOGIES IN PARKING AREA CAPACITY OPTIMIZATION 43 APPLICABILITY OF INFORMATION TECHNOLOGIES IN PARKING AREA CAPACITY OPTIMIZATION Maršanić Robert, Phd Rijeka Promet d.d.

### Decentralized Scheduling of Bursty Workload on Computing Grids

Decentralized Scheduling of Bursty Workload on Computing Grids Juemin Zhang, Ningfang Mi, Jianzhe Tai and Waleed Meleis Department of Electrical and Computer Engineering Northeastern University, Boston,

### Roadmap. Tevfik Ko!ar. CSC Operating Systems Spring Lecture - V CPU Scheduling - I. Louisiana State University.

CSC 4103 - Operating Systems Spring 2008 Lecture - V CPU Scheduling - I Tevfik Ko!ar Louisiana State University January 29 th, 2008 1 Roadmap CPU Scheduling Basic Concepts Scheduling Criteria Different

### 1. For s, a, initialize Q ( s,

Proceedings of the 2006 Winter Simulation Conference L. F. Perrone, F. P. Wieland, J. Liu, B. G. Lawson, D. M. Nicol, and R. M. Fujimoto, eds. A REINFORCEMENT LEARNING ALGORITHM TO MINIMIZE THE MEAN TARDINESS

### A Dynamic inventory optimization method applied to printer fleet management

Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 9-1-2011 A Dynamic inventory optimization method applied to printer fleet management Surya Saripalli Follow this

### Modeling And Optimization Of Non-Profit Hospital Call Centers With Service Blending

Wayne State University Wayne State University Dissertations 1-1-2015 Modeling And Optimization Of Non-Profit Hospital Call Centers With Service Blending Yanli Zhao Wayne State University, Follow this and

### Recall: FCFS Scheduling (Cont.) Example continued: Suppose that processes arrive in order: P 2, P 3, P 1 Now, the Gantt chart for the schedule is:

CS162 Operating Systems and Systems Programming Lecture 10 Scheduling October 3 rd, 2016 Prof. Anthony D. Joseph http://cs162.eecs.berkeley.edu Recall: Scheduling Policy Goals/Criteria Minimize Response

### WE consider the dynamic pickup and delivery problem

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 53, NO. 6, JULY 2008 1419 A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints Holly A. Waisanen, Devavrat Shah, and Munther

### Dual Priority Scheduling: A Means of Providing Flexibility in Hard Real-time Systems.

Dual Priority Scheduling: A Means of Providing Flexibility in Hard Real-time Systems Robert Davis Real-Time Systems Research Group, Department of Computer Science, University of York, Y1 5DD, England Email:

### CPU Scheduling. Disclaimer: some slides are adopted from book authors and Dr. Kulkarni s slides with permission

CPU Scheduling Disclaimer: some slides are adopted from book authors and Dr. Kulkarni s slides with permission 1 Recap Deadlock prevention Break any of four deadlock conditions Mutual exclusion, no preemption,

### Model-Driven Design-Space Exploration for Software-Intensive Embedded Systems

Model-Driven Design-Space Exploration for Software-Intensive Embedded Systems (extended abstract) Twan Basten 1,2, Martijn Hendriks 1, Lou Somers 2,3, and Nikola Trčka 4 1 Embedded Systems Institute, Eindhoven,

### MOF Service Management Function Job Scheduling

MOF Service Management Function Job Scheduling Release Approved Review SLA Review MOF Release Readiness Review Operations Review Microsoft Solutions for Management The information contained in this document

### A Case Study of Profile Driven Scheduling for a Heterogeneous Cluster of Workstations

A Case Study of Profile Driven Scheduling for a Heterogeneous Cluster of Workstations Leonidas Kontothanassis, David Goddeau Cambridge Research Laboratory HP Laboratories Cambridge HPL-24-192 October 27,

### Cross Training - Is it a Panacea for all Call Center Ills?

Cross Training - Is it a Panacea for all Call Center Ills? Benny Mathew and Manoj K. Nambiar Abstract Arriving at an optimal schedule for the staff and determining their required skills in a call center

### System performance analysis Introduction and motivation

LCD-Pro Esc ~ ` MENU SELECT - + Num CapsLock Scroll Lock Lock Num Lock /! Tab @ # \$ % ^ & Ctrl Alt * ( ) _ - + = { Scrn Print < \ SysRq Scroll Lock : " ' > Pause? Break Insert Home Delete Page Up End Page

### QUEUING THEORY 4.1 INTRODUCTION

C h a p t e r QUEUING THEORY 4.1 INTRODUCTION Queuing theory, which deals with the study of queues or waiting lines, is one of the most important areas of operation management. In organizations or in personal

### CONTENTS CHAPTER TOPIC PAGE NUMBER

CONTENTS CHAPTER TOPIC PAGE NUMBER 1 Introduction to Simulation 1 1.1 Introduction 1 1.1.1 What is Simulation? 2 1.2 Decision and Decision Models 2 1.3 Definition of Simulation 7 1.4 Applications of Simulation

### Business Process Management - Quantitative

Business Process Management - Quantitative November 2013 Alberto Abelló & Oscar Romero 1 Knowledge objectives 1. Recognize the importance of measuring processes 2. Enumerate the four performance measures

### as the algorithm that will be implemented in Asynchronous Transfer Mode ( ATM ) networks.

ON SIMPLIFIED MODELLING OF THE LEAKY BUCKET M Jennings, R J McEliece, J Murphy andzyu Abstract The Generic Cell Rate Algorithm, or more commonly the leaky bucket, has been standardised as the algorithm

### COMPARISON OF BOTTLENECK DETECTION METHODS FOR AGV SYSTEMS. Christoph Roser Masaru Nakano Minoru Tanaka

Roser, Christoph, Masaru Nakano, and Minoru Tanaka. Comparison of Bottleneck Detection Methods for AGV Systems. In Winter Simulation Conference, edited by S. Chick, Paul J Sanchez, David Ferrin, and Douglas

Advances in Production Engineering & Management 4 (2009) 3, 127-138 ISSN 1854-6250 Scientific paper LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS Ahmad, I. * & Al-aney, K.I.M. ** *Department

### Chapter 12. Sample Surveys. Copyright 2010 Pearson Education, Inc.

Chapter 12 Sample Surveys Copyright 2010 Pearson Education, Inc. Background We have learned ways to display, describe, and summarize data, but have been limited to examining the particular batch of data

### OPTIMIZATION AND OPERATIONS RESEARCH Vol. IV - Inventory Models - Waldmann K.-H

INVENTORY MODELS Waldmann K.-H. Universität Karlsruhe, Germany Keywords: inventory control, periodic review, continuous review, economic order quantity, (s, S) policy, multi-level inventory systems, Markov

### Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness

Evaluation of Task Assignment Policies for Supercomputing Servers: The Case for Load Unbalancing and Fairness Bianca Schroeder Mor Harchol-Balter School of Computer Science Carnegie Mellon University Pittsburgh,

### Chapter 1 INTRODUCTION TO SIMULATION

Chapter 1 INTRODUCTION TO SIMULATION Many problems addressed by current analysts have such a broad scope or are so complicated that they resist a purely analytical model and solution. One technique for