Case Study IV: An E-Business Service
|
|
|
- Mercy Thornton
- 5 years ago
- Views:
Transcription
1 Case Study I: n E-usiness Service Pro. Daniel. Menascé Department o Computer Science George Mason University 1 Copyright Notice Most o the igures in this set o slides come rom the book Perormance by Design: computer capacity planning by example, by Menascé, lmeida, and Dowdy, Prentice Hall, It is strictly orbidden to copy, post on a Web site, or distribute electronically, in part or entirely, any o the slides in this ile. 2 1
2 The E-usiness Service Online auction site. One Web Server, one pplication Server, and one Database Server. Each server has one CPU and one disk. Services oered by the site: and broker auctions Search or auctions based on categories and keywords Monitor existing bids on open auctions Place bids on open auctions. Login 3 uction Site s rchitecture 4 2
3 The Customer ehavior Model Graph (CMG 5 Matrix o Transition Probabilities or Type Sessions Entry (e Home (h Search (s iew ids (v Login (g uction (c Place id (b Exit (x Entry (e Home (h Search (s iew ids (v Login (g uction (c Place id (b Exit (x
4 Matrix o Transition Probabilities or Type Sessions Entry (e Home (h Search (s iew ids (v Login (g uction (c Place id (b Exit (x Entry (e Home (h Search (s iew ids (v Login (g uction (c Place id (b Exit (x Computing isit Ratios rom the CMG e h s v g c = 1 = p e h s = h g p eh = p = p hs sv = p hg gb = 1 + p s s ss + p sg + p v vg 8 4
5 isit Ratios or oth Session Types e h s v g c b Workload Characterization Multiscale nalysis o Number o uctions Numeber o uctions /16 10/17 10/18 10/19 10/20 10/21 10/22 10/23 10/24 10/25 10/26 10/27 10/28 10/29 10/30 10/31 Time slot = 1 day Number o uctions /16 10/17 10/18 10/19 10/20 10/21 10/22 10/23 10/24 10/25 10/26 10/27 10/28 10/29 10/30 10/31 Time slot = 1 hour on each day. 10 5
6 Workload Characterization Multiscale nalysis o Number o uctions Number o uctions :00 Sum o no. auctions per hour on all days. verage arrival rate during peak hour is 11 times the average or the rest o the day. 2:00 4:00 6:00 8:00 10:00 12:00 Time o Day 14:00 16:00 18:00 20:00 22:00 11 Workload Characterization Multiscale nalysis on Number o ids Number o ids Number o ids /26 M 10/26 10/26 PM 10/27 M 10/27 10/27 PM 10/28 10/28 M 10/28 PM 10/29 10/29 M 10/29 PM 10/30 M 10/30 10/30 PM 10/31 M 10/31 10/31 PM 11/01 M 11/1 11/01 PM Time slot = 1 day Time slot = 1 hour on each day. 12 6
7 Workload Characterization Multiscale nalysis on Number o ids 2000 Number o ids :00 2:00 4:00 6:00 8:00 10:00 12:00 14:00 16:00 18:00 20:00 22:00 Total Human Proxy 13 Perormance Issues surge in the number o auctions created and bids placed was observed between 8 p.m. and 11 p.m. What is the response time o the various types o requests (home page hits, search executions, bid viewings, logins, auction creations, and bid placements? The response time SL or create auctions and bid placement is 4 seconds. 14 7
8 8 15 Workload Intensity ( ( ( ( ( ( bid create login view search home b b c c g g v v s s h h + = + = + = + = + = + = γ λ γ λ γ λ γ λ γ λ γ λ γ: total rate at which sessions are started. 16 Workload Intensity Total Session rrival Rate (sessions/sec Percent o Type Sessions 0.25 Percent o Type Sessions 0.75 rrival o requests (requests/sec Home (h Search (s iew bids (v Login (g uction (c Place ids (b 2.074
9 Perormance Model Multiclass Open Queuing Network Model 17 Original Coniguration Open Multiclass Queuing Networks This wokbook comes with the books "Capacity Planning or Web Services" and "Scaling or E-usiness" by D.. Menascé and.. F. lmeida, Prentice Hall, 2002 and No. Queues: 6 No. o Classes: 6 Classes i rrival Rates: Service Demand Matrix Classes i Queues l Type l (LI/D/MPn Home (h Search (s iew bids (v Login (g uction (c Place ids (b WS-CPU LI WS-disk LI S-CPU LI S-disk LI DS-CPU LI DS-disk LI
10 verage Request Response Time (sec Response Times per Class place bids SL or create auction and place bids create auctions Session Starts/sec Home Search Login id iew 19 Open Multiclass Queuing Networks - Residence Times This wokbook comes with the books "Capacity Planning or Web Services" and "Scaling or E-usiness" by D.. Menascé and.. F. lmeida, Prentice Hall, 2002 and Classes i iew bids uction Place ids Queues l Home (h Search (s (v Login (g (c (b WS-CPU WS-disk S-CPU S-disk DS-CPU DS-disk Response Time The disk at the database server is the bottleneck 20 10
11 Upgraded Coniguration Open Multiclass Queuing Networks This wokbook comes with the books "Capacity Planning or Web Services" and "Scaling or E-usiness" by D.. Menascé and.. F. lmeida, Prentice Hall, 2002 and No. Queues: 7 No. o Classes: 6 Classes i rrival Rates: Service Demand Matrix Classes i Queues l Type l (LI/D/MPn Home (h Search (s iew bids (v Login (g uction (c Place ids (b WS-CPU LI WS-disk LI S-CPU LI S-disk LI DS-CPU LI DS-disk1 LI DS-disk2 LI Results with Two Disks at the D Server Open Multiclass Queuing Networks - Residence Times This wokbook comes with the books "Capacity Planning or Web Services" and "Scaling or E-usiness" by D.. Menascé and.. F. lmeida, Prentice Hall, 2002 and Classes i iew bids uction Place ids Queues l Home (h Search (s (v Login (g (c (b WS-CPU WS-disk S-CPU S-disk DS-CPU DS-disk DS-disk Response Time
12 Improvements due to New Coniguration Home (h Search (s Response Times (sec iew bids (v Login (g uction (c Place ids (b rrival Rates (req/sec Original Coniguration New Coniguration % Reduction 0.0% 97.9% 94.5% 97.8% 98.2% 98.5% 23 dding More Identical Servers 24 12
13 dding More Identical Servers Response time at the single equivalent server: R D = K i i= 1 1 ( λ / N ws D i 25 13
de Computação ``E business: banking services Virgilio A. F. Almeida
Análise e Modelagem de Desempenho de Sistemas de Computação ``E business: banking services irgilio A. F. Almeida 1st semester 2009 Week #9 Computer Science Department Federal University of Minas Gerais
Prof. Daniel A. Menascé Department of Computer Science George Mason University
Pro. Daniel. Menascé Deartment o Comuter Science George Mason University www.cs.gmu.edu/aculty/menasce.html 2004 D.. Menascé. ll Rights Reserved. 1 Most o the igures in this set o slides come rom the book
Análise e Modelagem de Desempenho de Sistemas de Computação
Análise e Modelagem de Desempenho de Sistemas de Computação ``Performance Models Virgilio A. F. Almeida 1 o Semestre de 2009 Introdução: Semana #4 Computer Science Department Federal University of Minas
Queuing Networks. - Outline of queuing networks. - Mean Value Analisys (MVA) for open and closed queuing networks
Queuing Networks - Outline of queuing networks - Mean Value Analisys (MVA) for open and closed queuing networks 1 incoming requests Open queuing networks DISK CPU CD outgoing requests Closed queuing networks
Operational Laws. Operational Laws. Overview. Operational Quantities
Operational Laws Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu Mini-Course offered at UC erkeley, Sept-Oct 2012 These slides and audio/video recordings are available
COMP9334: Capacity Planning of Computer Systems and Networks
COMP9334: Capacity Planning of Computer Systems and Networks Week 2: Operational analysis Lecturer: Prof. Sanjay Jha NETWORKS RESEARCH GROUP, CSE, UNSW Operational analysis Operational: Collect performance
COMP9334 Capacity Planning for Computer Systems and Networks
COMP9334 Capacity Planning for Computer Systems and Networks Week 2: Operational Analysis and Workload Characterisation COMP9334 1 Last lecture Modelling of computer systems using Queueing Networks Open
Analysis of Software Artifacts
Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University
CSM: Operational Analysis
CSM: Operational Analysis 2016-17 Computer Science Tripos Part II Computer Systems Modelling: Operational Analysis by Ian Leslie Richard Gibbens, Ian Leslie Operational Analysis Based on the idea of observation
Operational Laws Raj Jain
Operational Laws 33-1 Overview What is an Operational Law? 1. Utilization Law 2. Forced Flow Law 3. Little s Law 4. General Response Time Law 5. Interactive Response Time Law 6. Bottleneck Analysis 33-2
λ λ λ In-class problems
In-class problems 1. Customers arrive at a single-service facility at a Poisson rate of 40 per hour. When two or fewer customers are present, a single attendant operates the facility, and the service time
CPU Scheduling. CPU Scheduler
CPU Scheduling These slides are created by Dr. Huang of George Mason University. Students registered in Dr. Huang s courses at GMU can make a single machine readable copy and print a single copy of each
Operational Laws 33-1
Operational Laws Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu A Mini-Course offered at UC Berkeley, Sept-Oct 2012 These slides and audio/video recordings are available
Bernoulli Counting Process with p=0.1
Stat 28 October 29, 21 Today: More Ch 7 (Sections 7.4 and part of 7.) Midterm will cover Ch 7 to section 7.4 Review session will be Nov. Exercises to try (answers in book): 7.1-, 7.2-3, 7.3-3, 7.4-7 Where
FDST Markov Chain Models
FDST Markov Chain Models Tuesday, February 11, 2014 2:01 PM Homework 1 due Friday, February 21 at 2 PM. Reading: Karlin and Taylor, Sections 2.1-2.3 Almost all of our Markov chain models will be time-homogenous,
Ways to study a system System
Simulation What is simulation? Simple synonym: imitation We are interested in studying a system Instead of experimenting with the system itself we experiment with a model of the system Ways to study a
QUEUING MODELS AND MARKOV PROCESSES
QUEUING MODELS AND MARKOV ROCESSES Queues form when customer demand for a service cannot be met immediately. They occur because of fluctuations in demand levels so that models of queuing are intrinsically
1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)
1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) Student Name: Alias: Instructions: 1. This exam is open-book 2. No cooperation is permitted 3. Please write down your name
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
QUEUING SYSTEM. Yetunde Folajimi, PhD
QUEUING SYSTEM Yetunde Folajimi, PhD Part 2 Queuing Models Queueing models are constructed so that queue lengths and waiting times can be predicted They help us to understand and quantify the effect of
A POPULATION-MIX DRIVEN APPROXIMATION FOR QUEUEING NETWORKS WITH FINITE CAPACITY REGIONS
A POPULATION-MIX DRIVEN APPROXIMATION FOR QUEUEING NETWORKS WITH FINITE CAPACITY REGIONS J. Anselmi 1, G. Casale 2, P. Cremonesi 1 1 Politecnico di Milano, Via Ponzio 34/5, I-20133 Milan, Italy 2 Neptuny
Queuing Theory and Stochas St t ochas ic Service Syste y ms Li Xia
Queuing Theory and Stochastic Service Systems Li Xia Syllabus Instructor Li Xia 夏俐, FIT 3 618, 62793029, xial@tsinghua.edu.cn Text book D. Gross, J.F. Shortle, J.M. Thompson, and C.M. Harris, Fundamentals
Note special lecture series by Emmanuel Candes on compressed sensing Monday and Tuesday 4-5 PM (room information on rpinfo)
Formulation of Finite State Markov Chains Friday, September 23, 2011 2:04 PM Note special lecture series by Emmanuel Candes on compressed sensing Monday and Tuesday 4-5 PM (room information on rpinfo)
Queueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements
Queueing Systems: Lecture 3 Amedeo R. Odoni October 18, 006 Announcements PS #3 due tomorrow by 3 PM Office hours Odoni: Wed, 10/18, :30-4:30; next week: Tue, 10/4 Quiz #1: October 5, open book, in class;
One Optimized I/O Configuration per HPC Application
One Optimized I/O Configuration per HPC Application Leveraging I/O Configurability of Amazon EC2 Cloud Mingliang Liu, Jidong Zhai, Yan Zhai Tsinghua University Xiaosong Ma North Carolina State University
Scheduling I. Today Introduction to scheduling Classical algorithms. Next Time 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 the
Dynamic Service Placement in Geographically Distributed Clouds
Dynamic Service Placement in Geographically Distributed Clouds Qi Zhang 1 Quanyan Zhu 2 M. Faten Zhani 1 Raouf Boutaba 1 1 School of Computer Science University of Waterloo 2 Department of Electrical and
CEE 320 Midterm Examination (50 minutes)
CEE 320 Midterm Examination (50 minutes) Fall 2009 Please write your name on this cover. Please write your last name on all other exam pages This exam is NOT open book, but you are allowed to use one 8.5x11
Revenue Maximization in a Cloud Federation
Revenue Maximization in a Cloud Federation Makhlouf Hadji and Djamal Zeghlache September 14th, 2015 IRT SystemX/ Telecom SudParis Makhlouf Hadji Outline of the presentation 01 Introduction 02 03 04 05
Operations Research Letters. Instability of FIFO in a simple queueing system with arbitrarily low loads
Operations Research Letters 37 (2009) 312 316 Contents lists available at ScienceDirect Operations Research Letters journal homepage: www.elsevier.com/locate/orl Instability of FIFO in a simple queueing
Towards VM Consolidation Using Idle States
Towards Consolidation Using Idle States Rayman Preet Singh, Tim Brecht, S. Keshav University of Waterloo @AC EE 15 1 Traditional Consolidation Hypervisor Hardware Hypervisor Hardware Hypervisor Hardware
Solutions to COMP9334 Week 8 Sample Problems
Solutions to COMP9334 Week 8 Sample Problems Problem 1: Customers arrive at a grocery store s checkout counter according to a Poisson process with rate 1 per minute. Each customer carries a number of items
ON SITE SYSTEMS Chemical Safety Assistant
ON SITE SYSTEMS Chemical Safety Assistant CS ASSISTANT WEB USERS MANUAL On Site Systems 23 N. Gore Ave. Suite 200 St. Louis, MO 63119 Phone 314-963-9934 Fax 314-963-9281 Table of Contents INTRODUCTION
CS418 Operating Systems
CS418 Operating Systems Lecture 14 Queuing Analysis Textbook: Operating Systems by William Stallings 1 1. Why Queuing Analysis? If the system environment changes (like the number of users is doubled),
YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS MATH , YEAR APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS)
YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS Instructor : Dr. Igor Poliakov MATH 4570 6.0, YEAR 2006-07 APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS) March 29, 2007 Name (print)
Convolution Algorithm
Convolution Algorithm Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-08/
Prediction Experience and New Model
Prediction Experience and New Model Serg Mescheryakov, D.Sc., Professor St. Petersburg Polytechnic University, Russia Genesys Telecommunications Laboratories, USA Dmitry Shchemelinin, Ph.D. RingCentral,
Computer Networks More general queuing systems
Computer Networks More general queuing systems Saad Mneimneh Computer Science Hunter College of CUNY New York M/G/ Introduction We now consider a queuing system where the customer service times have a
CS 700: Quantitative Methods & Experimental Design in Computer Science
CS 700: Quantitative Methods & Experimental Design in Computer Science Sanjeev Setia Dept of Computer Science George Mason University Logistics Grade: 35% project, 25% Homework assignments 20% midterm,
UNIVERSITY OF YORK. MSc Examinations 2004 MATHEMATICS Networks. Time Allowed: 3 hours.
UNIVERSITY OF YORK MSc Examinations 2004 MATHEMATICS Networks Time Allowed: 3 hours. Answer 4 questions. Standard calculators will be provided but should be unnecessary. 1 Turn over 2 continued on next
Chapter 3: Markov Processes First hitting times
Chapter 3: Markov Processes First hitting times L. Breuer University of Kent, UK November 3, 2010 Example: M/M/c/c queue Arrivals: Poisson process with rate λ > 0 Example: M/M/c/c queue Arrivals: Poisson
CHAPTER 4. Networks of queues. 1. Open networks Suppose that we have a network of queues as given in Figure 4.1. Arrivals
CHAPTER 4 Networks of queues. Open networks Suppose that we have a network of queues as given in Figure 4.. Arrivals Figure 4.. An open network can occur from outside of the network to any subset of nodes.
CHEMICAL INVENTORY ENTRY GUIDE
CHEMICAL INVENTORY ENTRY GUIDE Version Date Comments 1 October 2013 Initial A. SUMMARY All chemicals located in research and instructional laboratories at George Mason University are required to be input
Leveraging ArcGIS Online Elevation and Hydrology Services. Steve Kopp, Jian Lange
Leveraging ArcGIS Online Elevation and Hydrology Services Steve Kopp, Jian Lange Topics An overview of ArcGIS Online Elevation Analysis Using Elevation Analysis Services in ArcGIS for Desktop Using Elevation
The Applicability of Adaptive Control Theory to QoS Design: Limitations and Solutions
The Applicability of Adaptive Control Theory to QoS Design: Limitations and Solutions Keqiang Wu David J. Lilja Haowei Bai Electrical and Computer Engineering University of Minnesota Minneapolis, MN 55455,
Module 5: CPU Scheduling
Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 5.1 Basic Concepts Maximum CPU utilization obtained
Performance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
Integration of ArcFM UT with SCADA, SAP, MAXIMO and Network Calculation
Integration of ArcFM UT with SCADA, SAP, MAXIMO and Network Calculation Peter Harabin (VSE) Martin Mydliar (ArcGEO) July 9, 2013 Esri International User Conference Agenda > Business/process part = WHAT
Markov Chain Model for ALOHA protocol
Markov Chain Model for ALOHA protocol Laila Daniel and Krishnan Narayanan April 22, 2012 Outline of the talk A Markov chain (MC) model for Slotted ALOHA Basic properties of Discrete-time Markov Chain Stability
Parijat Dube Jian Tan Li Zhang. IBM T. J. Watson Research Center 19, Skyline Drive Hawthorne NY 10532, USA
Proceedings of the 2011 Winter Simulation Conference S. ain, R. R. Creasey,. Himmelspach,. P. White, and M. u, eds. IDENTIICATION AND APPROXIMATIONS OR SYSTEMS WITH MULTI-STAGE WORLOWS Parijat Dube ian
Geography for the 2020 Round of Census
Boundaries Key Census Data EA Id Population Male Female EA Id Area EA Id Num HH Avg HH size Geography for the 2020 Round of Census Linda Peters, Esri lpeters@esri.com Integration of Statistical and Geospatial
Development of a GIS Interface for WEPP Model Application to Great Lakes Forested Watersheds
Development of a GIS Interface for WEPP Model Application to Great Lakes Forested Watersheds J.R. Frankenberger 1, S. Dun 2, D.C. Flanagan 1, J.Q. Wu 2, W.J. Elliot 3 1 USDA-ARS, West Lafayette, IN 2 Washington
CENGAGE CHEMISTRY PDF
CENGAGE CHEMISTRY PDF ==> Download: CENGAGE CHEMISTRY PDF CENGAGE CHEMISTRY PDF - Are you searching for Cengage Chemistry Books? Now, you will be happy that at this time Cengage Chemistry PDF is available
TIMBERLAKE BASIC CHEMISTRY PDF
TIMBERLAKE BASIC CHEMISTRY PDF ==> Download: TIMBERLAKE BASIC CHEMISTRY PDF TIMBERLAKE BASIC CHEMISTRY PDF - Are you searching for Timberlake Basic Chemistry Books? Now, you will be happy that at this
A Quantitative View: Delay, Throughput, Loss
A Quantitative View: Delay, Throughput, Loss Antonio Carzaniga Faculty of Informatics University of Lugano September 27, 2017 Outline Quantitative analysis of data transfer concepts for network applications
Readings: Finish Section 5.2
LECTURE 19 Readings: Finish Section 5.2 Lecture outline Markov Processes I Checkout counter example. Markov process: definition. -step transition probabilities. Classification of states. Example: Checkout
Multi-Approximate-Keyword Routing Query
Bin Yao 1, Mingwang Tang 2, Feifei Li 2 1 Department of Computer Science and Engineering Shanghai Jiao Tong University, P. R. China 2 School of Computing University of Utah, USA Outline 1 Introduction
NEC PerforCache. Influence on M-Series Disk Array Behavior and Performance. Version 1.0
NEC PerforCache Influence on M-Series Disk Array Behavior and Performance. Version 1.0 Preface This document describes L2 (Level 2) Cache Technology which is a feature of NEC M-Series Disk Array implemented
Queueing Networks G. Rubino INRIA / IRISA, Rennes, France
Queueing Networks G. Rubino INRIA / IRISA, Rennes, France February 2006 Index 1. Open nets: Basic Jackson result 2 2. Open nets: Internet performance evaluation 18 3. Closed nets: Basic Gordon-Newell result
CPU Scheduling. Heechul Yun
CPU Scheduling Heechul Yun 1 Recap Four deadlock conditions: Mutual exclusion No preemption Hold and wait Circular wait Detection Avoidance Banker s algorithm 2 Recap: Banker s Algorithm 1. Initialize
Table of Contents. Amy Harrison,
Table of Contents Cover Snowflake Mystery Picture / Table of Contents 1 Ad 2 Student WS: Graphing and Reflecting Mystery Picture 3 Partial Answer Key: Mystery Picture (1 Quadrant) 4 Partial Answer Key:
Geodatabase Best Practices. Dave Crawford Erik Hoel
Geodatabase Best Practices Dave Crawford Erik Hoel Geodatabase best practices - outline Geodatabase creation Data ownership Data model Data configuration Geodatabase behaviors Data integrity and validation
A Study on M x /G/1 Queuing System with Essential, Optional Service, Modified Vacation and Setup time
A Study on M x /G/1 Queuing System with Essential, Optional Service, Modified Vacation and Setup time E. Ramesh Kumar 1, L. Poornima 2 1 Associate Professor, Department of Mathematics, CMS College of Science
PEARSON PRENTICE HALL CHEMISTRY GUIDED ANSWER KEY PDF
PEARSON PRENTICE HALL CHEMISTRY GUIDED ANSWER KEY PDF ==> Download: PEARSON PRENTICE HALL CHEMISTRY GUIDED ANSWER KEY PDF PEARSON PRENTICE HALL CHEMISTRY GUIDED ANSWER KEY PDF - Are you searching for Pearson
Esri Defense Mapping: Cartographic Production. Bo King
Esri Defense Mapping: Cartographic Production Bo King Agenda Esri Defense Mapping: Cartographic Production Solution Overview Desktop Cartographic Production Workflow - Create Rapid Graphic Product On Demand
PHYSICS 221 Fall 2013 EXAM 2: November 6, :15pm 10:15pm. Name (printed): Recitation Instructor: Section #:
PHYSICS 221 Fall 2013 EXAM 2: November 6, 2013 8:15pm 10:15pm Name (printed): Recitation Instructor: Section #: INSTRUCTIONS: This exam contains 25 multiple choice questions, plus two extra credit questions,
Administering your Enterprise Geodatabase using Python. Jill Penney
Administering your Enterprise Geodatabase using Python Jill Penney Assumptions Basic knowledge of python Basic knowledge enterprise geodatabases and workflows You want code Please turn off or silence cell
STEADY-STATE PROBABILITIES FOR SOME QUEUEING SYSTEMS: Part II
STEADY-STATE PROBABILITIES FOR SOME QUEUEING SYSTEMS: Part II Mahmoud Abdel Moety Hussain Faculty of Computers and Informatics Zagazig University Abstract This paper applies the theoretical results presented
IS 709/809: Computational Methods in IS Research Fall Exam Review
IS 709/809: Computational Methods in IS Research Fall 2017 Exam Review Nirmalya Roy Department of Information Systems University of Maryland Baltimore County www.umbc.edu Exam When: Tuesday (11/28) 7:10pm
T R A I N I N G M A N U A L 1. 9 G H Z C D M A P C S 80 0 M H Z C D M A /A M P S ( T R I - M O D E ) PM325
T R A I N I N G M A N U A L 1. 9 G H Z C D M A P C S 80 0 M H Z C D M A /A M P S ( T R I - M O D E ) PM325 Slide. Click. Send the pic O P E R AT I N G I N S T RU C T I O N S H e a d s e t Ja c k S e l
Generation of Discrete Random variables
Simulation Simulation is the imitation of the operation of a realworld process or system over time. The act of simulating something first requires that a model be developed; this model represents the key
Utility Maximizing Routing to Data Centers
0-0 Utility Maximizing Routing to Data Centers M. Sarwat, J. Shin and S. Kapoor (Presented by J. Shin) Sep 26, 2011 Sep 26, 2011 1 Outline 1. Problem Definition - Data Center Allocation 2. How to construct
AstroPortal: A Science Gateway for Large-scale Astronomy Data Analysis
AstroPortal: A Science Gateway for Large-scale Astronomy Data Analysis Ioan Raicu Distributed Systems Laboratory Computer Science Department University of Chicago Joint work with: Ian Foster: Univ. of
Embedded Systems 23 BF - ES
Embedded Systems 23-1 - Measurement vs. Analysis REVIEW Probability Best Case Execution Time Unsafe: Execution Time Measurement Worst Case Execution Time Upper bound Execution Time typically huge variations
Esri Production Mapping: An Introduction
Esri Production Mapping: An Introduction Amber Bethell & Joseph Sheffield Esri UC 2014 Technical Workshop Your organization s processes Collect Share Manage Produce Your organization s needs Standardization
A TANDEM QUEUEING SYSTEM WITH APPLICATIONS TO PRICING STRATEGY. Wai-Ki Ching. Tang Li. Sin-Man Choi. Issic K.C. Leung
Manuscript submitted to AIMS Journals Volume X, Number 0X, XX 00X Website: http://aimsciences.org pp. X XX A TANDEM QUEUEING SYSTEM WITH APPLICATIONS TO PRICING STRATEGY WAI-KI CHING SIN-MAN CHOI TANG
Advanced Computer Networks Lecture 3. Models of Queuing
Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of
Classification of Queuing Models
Classification of Queuing Models Generally Queuing models may be completely specified in the following symbol form:(a/b/c):(d/e)where a = Probability law for the arrival(or inter arrival)time, b = Probability
SOFTWARE ARCHITECTURE DESIGN OF GIS WEB SERVICE AGGREGATION BASED ON SERVICE GROUP
SOFTWARE ARCHITECTURE DESIGN OF GIS WEB SERVICE AGGREGATION BASED ON SERVICE GROUP LIU Jian-chuan*, YANG Jun, TAN Ming-jian, GAN Quan Sichuan Geomatics Center, Chengdu 610041, China Keywords: GIS; Web;
Safety and Liveness. Thread Synchronization: Too Much Milk. Critical Sections. A Really Cool Theorem
Safety and Liveness Properties defined over an execution of a program Thread Synchronization: Too Much Milk Safety: nothing bad happens holds in every finite execution prefix Windows never crashes No patient
A.C.R.E and. C3S Data Rescue Capacity Building Workshops. December 4-8, 2017 Auckland, New Zealand. Session 3: Rescue of Large Format and Analog Data
A.C.R.E and C3S Data Rescue Capacity Building Workshops December 4-8, 2017 Auckland, New Zealand Dr. Rick Crouthamel, D.Sc. Executive Director Session 3: Rescue of Large Format and Analog Data 4 December
Multiaccess Problem. How to let distributed users (efficiently) share a single broadcast channel? How to form a queue for distributed users?
Multiaccess Problem How to let distributed users (efficiently) share a single broadcast channel? How to form a queue for distributed users? z The protocols we used to solve this multiaccess problem are
Discrete Event Simulation. Motive
Discrete Event Simulation These slides are created by Dr. Yih Huang of George Mason University. Students registered in Dr. Huang's courses at GMU can make a single machine-readable copy and print a single
Scheduling. Uwe R. Zimmer & Alistair Rendell The Australian National University
6 Scheduling Uwe R. Zimmer & Alistair Rendell The Australian National University References for this chapter [Bacon98] J. Bacon Concurrent Systems 1998 (2nd Edition) Addison Wesley Longman Ltd, ISBN 0-201-17767-6
Esri UC2013. Technical Workshop.
Esri International User Conference San Diego, California Technical Workshops July 9, 2013 CAD: Introduction to using CAD Data in ArcGIS Jeff Reinhart & Phil Sanchez Agenda Overview of ArcGIS CAD Support
Modeling Parallel and Distributed Systems with Finite Workloads
Modeling Parallel and Distributed Systems with Finite Workloads Ahmed M. Mohamed, Lester Lipsky and Reda Ammar {ahmed, lester, reda@engr.uconn.edu} Dept. of Computer Science and Engineering University
ISyE 6650 Test 2 Solutions
1 NAME ISyE 665 Test 2 Solutions Summer 2 This test is open notes, open books. The test is two hours long. 1. Consider an M/M/3/4 queueing system in steady state with arrival rate λ = 3 and individual
Session-Based Queueing Systems
Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the
CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Quote of the Day A person with one watch knows what time it is. A person with two
arxiv: v1 [cs.ni] 18 Apr 2017
![arxiv: v1 [cs.ni] 18 Apr 2017](/thumbs/95/123668315.jpg "arxiv: v1 [cs.ni] 18 Apr 2017")
Zijun Zhang Dept. of Computer Science University of Calgary zijun.zhang@ucalgary.ca Zongpeng Li Dept. of Computer Science University of Calgary zongpeng@ucalgary.ca Chuan Wu Dept. of Computer Science The
PROPHECY HEALTH TEST STUDY GUIDE PDF
PROPHECY HEALTH TEST STUDY GUIDE PDF ==> Download: PROPHECY HEALTH TEST STUDY GUIDE PDF PROPHECY HEALTH TEST STUDY GUIDE PDF - Are you searching for Prophecy Health Test Study Guide Books? Now, you will
Last class: Today: Threads. CPU Scheduling
1 Last class: Threads Today: CPU Scheduling 2 Resource Allocation In a multiprogramming system, we need to share resources among the running processes What are the types of OS resources? Question: Which
EP2200 Course Project 2017 Project II - Mobile Computation Offloading
EP2200 Course Project 2017 Project II - Mobile Computation Offloading 1 Introduction Queuing theory provides us a very useful mathematic tool that can be used to analytically evaluate the performance of
2018 Annual Review of Availability Assessment Hours
2018 Annual Review of Availability Assessment Hours Amber Motley Manager, Short Term Forecasting Clyde Loutan Principal, Renewable Energy Integration Karl Meeusen Senior Advisor, Infrastructure & Regulatory
Che-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University
Che-Wei Chang chewei@mail.cgu.edu.tw Department of Computer Science and Information Engineering, Chang Gung University } 2017/11/15 Midterm } 2017/11/22 Final Project Announcement 2 1. Introduction 2.
Counting Strategies: Inclusion/Exclusion, Categories
Counting Strategies: Inclusion/Exclusion, Categories CSE21 Winter 2017, Day 16 (B00), Day 11 (A00) February 17, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Sum rule For any disjoint sets, A and B: A
Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems
Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems Vishnu Swaminathan and Krishnendu Chakrabarty Department of Electrical & Computer Engineering Duke University Durham,
Dynamic Matching Models
Dynamic Matching Models Ana Bušić Inria Paris - Rocquencourt CS Department of École normale supérieure joint work with Varun Gupta, Jean Mairesse and Sean Meyn 3rd Workshop on Cognition and Control January
Stochastic Optimization for Undergraduate Computer Science Students
Stochastic Optimization for Undergraduate Computer Science Students Professor Joongheon Kim School of Computer Science and Engineering, Chung-Ang University, Seoul, Republic of Korea 1 Reference 2 Outline
UTAH S STATEWIDE GEOGRAPHIC INFORMATION DATABASE
UTAH S STATEWIDE GEOGRAPHIC INFORMATION DATABASE Data Information and Knowledge Management NASCIO Awards 2009 STATE GEOGRAPHIC INFORMATION DATABASE B. EXECUTIVE SUMMARY Utah has developed one of the most