de Computação ``E business: banking services Virgilio A. F. Almeida
|
|
|
- Carmel Gordon
- 5 years ago
- Views:
Transcription
1 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 Brazil
2 E business services 2
3 Banking services in Brazil Menascé and Almeida. All Rights Reserved.
4 Banking services in Brazil Menascé and Almeida. All Rights Reserved.
5 Banking services in Brazil Menascé and Almeida. All Rights Reserved.
6 Banking services in Brazil Menascé and Almeida. All Rights Reserved.
7 Banking services in Brazil Menascé and Almeida. All Rights Reserved.
8 Case Study I: An E-Business Service 8
9 Copyright Notice Most of the figures in this set of slides come from the book Performance by Design: computer capacity planning by example, by Menascé, Almeida, and Dowdy, Prentice Hall, It is strictly forbidden to copy, post on a Web site, or distribute electronically, in part or entirely, any of the slides in this file. 9
10 The E-Business Service Online auction site. One Web Server, one Application Server, and one Database Server. Each server has one CPU and one disk. Services offered by the site: Create and broker auctions Search for auctions based on categories and keywords Monitor existing bids on open auctions Place bids on open auctions. Login 10
11 Auction Site s Architecture 11
12 The Customer Behavior Model Graph (CBMG) 12
13 Matrix of Transition Probabilities for Type A Sessions Entry (e) Home (h) Search (s) iew Bids (v) Create Login (g) Auction (c) Place Bid (b) Exit (x) Entry (e) Home (h) Search (s) iew Bids (v) Login (g) Create Auction (c) Place Bid (b) Exit (x)
14 Matrix of Transition Probabilities for Type B Sessions Entry (e) Home (h) Search (s) iew Bids (v) Login (g) Create Auction (c) Place Bid (b) Exit (x) Entry y( (e) Home (h) Search (s) iew Bids (v) Login (g) Create Auction (c) Place Bid (b) Exit (x)
15 Computing isit Ratios from the CBMG eh e h e p = = = 1 1 ss s hs h s eh e h p p p p = + = vg v sg s hg h g sv s v p p p p + + = = 15 gb g c p =
16 isit Ratios for Both Session Types A B e h s v g c b
17 Workload Characterization Multiscale Analysis of Number of Auctions Time slot = 1 day 10/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 Numeber of Auctions Time slot = 1 hour on each day. Number of Auctions 17 10/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
18 Workload Characterization Multiscale Analysis of Number of Auctions umber of Au uctions N Sum of no. auctions per hour on all days. Average arrival rate during peak hour is 11 times the average for the rest of the day. 0:0 00 2:0 00 4:0 00 6:0 00 8: : :0 00 Time of Day 14: : : : :
19 Workload Characterization Multiscale Analysis on Number of Bids Time slot = 1 day Number of Bids / /26 10/ /27 10/ /28 10/ /29 10/ /30 10/ /31 11/ Number of Bids 50 0 Time slot = 1 hour on each day. 10/26 AM 10/ /26 PM 10/27 AM 10/ /27 PM 10/28 AM 10/ /28 PM 10/29 AM 10/ /29 PM 10/30 AM 10/ /30 PM 10/31 AM 10/ /31 PM 11/01 AM 11/ /01 PM 19
20 Workload Characterization Multiscale Analysis on Number of Bids 2000 Numbe er of Bi ds :00 0 2:00 0 4:00 0 6:00 0 8: : : : : : : :00 0 Total Human Proxy 20
21 Performance Issues A surge in the number of auctions created and bids placed was observed between 8 p.m. and 11 p.m. What is the response time of the various types of requests (home page hits, search executions, ecut bid viewings, logins, auction creations, and bid placements)? The response time SLA for create auctions and bid placement is 4 seconds. 21
22 Workload Intensity Workload Intensity B A γ: total rate at which sessions are started. ) ( ) ( home B A B h B A h A f f f f + = + = γ λ γ λ ) ( ) ( view search B v B A v A s B s A f f f f + = + = γ λ γ λ ) ( login B A B g B A g A f f + = γ λ ) ( ) ( bid create B b B A b A B c B A c A f f f f + = + = γ λ γ λ 22 ) ( bid b B b A f f + γ λ
23 Workload Intensity Total Session Arrival Rate (sessions/sec) Percent of Type A Sessions 0.25 Percent of Type B Sessions 0.75 Arrival of requests (requests/sec) Home (h) Search (s) iew bids (v) Login (g) Create Auction (c) Place Bids (b)
24 Performance Model Multiclass Open Queuing Network Model 24
25 Original Configuration Open Multiclass Queuing Networks This wokbook comes with the books "Capacity Planning for Web Services" and "Scaling for E-Business" by D. A. Menascé and. A. F. Almeida, Prentice Hall, 2002 and No. Queues: 6 No. of Classes: 6 Classes Arrival Rates: Service Demand Matrix Classes Type iew bids Create Auction Place Bids Queues (LI/D/MPn) Home (h) Search (s) (v) Login (g) (c) (b) WS-CPU LI WS-disk LI AS-CPU LI AS-disk LI DS-CPU LI DS-disk LI
26 Response Times per Class 8.0 Time (sec c) Average Request Response place bids SLA for create auction and place bids create auctions Session Starts/sec Home Search Login Create Bid iew 26
27 Open Multiclass Queuing Networks - Residence Times This wokbook comes with the books "Capacity Planning for Web Services" and "Scaling for E-Business" by D. A. Menascé and. A. F. Almeida, Prentice Hall, 2002 and Classes iew bids Create Auction Place Bids Queues Home (h) Search (s) (v) Login (g) (c) (b) WS-CPU WS-disk AS-CPU AS-disk DS-CPU DS-disk Response Time The disk at the database server is the bottleneck 27
28 Upgraded Configuration Open Multiclass Queuing Networks This wokbook comes with the books "Capacity Planning for Web Services" and "Scaling for E-Business" by D. A. Menascé and. A. F. Almeida, Prentice Hall, 2002 and No. Queues: 7 No. of Classes: 6 Classes Arrival Rates: Service Demand Matrix Classes Type iew bids Create Place Bids Queues (LI/D/MPn) Home (h) Search (s) (v) Login (g) Auction (c) (b) WS-CPU LI WS-disk LI AS-CPU LI AS-disk LI DS-CPU LI DS-disk1 LI DS-disk2 LI
29 Results with Two Disks at the DB Server Open Multiclass Queuing Networks - Residence Times This wokbook comes with the books "Capacity Planning for Web Services" and "Scaling for E-Business" by D. A. Menascé and. A. F. Almeida, Prentice Hall, 2002 and Classes Queues Home (h) Search (s) iew bids () (v) Login (g) Create Auction (c) Place Bids (b) WS-CPU WS-disk AS-CPU AS-disk DS-CPU DS-disk DS-disk Response Time
30 Improvements due to New Configuration Response Times (sec) iew bids Create Place Bids Home (h) Search (s) (v) Login (g) Auction (c) (b) Arrival Rates (req/sec) Original Configuration New Configuration % Reduction 0.0% 97.9% 94.5% 97.8% 98.2% 98.5% 30
31 Adding More Identical Servers 31
32 Adding More Identical Servers Response time at the single equivalent server: R = K Di 1 ( λ / N i= 1 ws ) D i 32
Case Study IV: An E-Business Service
Case Study I: n E-usiness Service Pro. Daniel. Menascé Department o Computer Science George Mason University www.cs.gmu.edu/aculty/menasce.html 1 Copyright Notice Most o the igures in this set o slides
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
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
λ λ λ 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
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
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
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;
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
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 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
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
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
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
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:
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,
I N T R O D U C T I O N : G R O W I N G I T C O M P L E X I T Y
Global Headquarters: 5 Speen Street Framingham, MA 01701 USA P.508.872.8200 F.508.935.4015 www.idc.com W H I T E P A P E R I n v a r i a n t A n a l y z e r : A n A u t o m a t e d A p p r o a c h t o
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
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
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
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,
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
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
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
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
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
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),
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
On the Response Time of Large-scale Composite Web Services
On the Response Time of Large-scale Composite Web Services Michael Scharf Institute of Communication Networks and Computer Engineering (IKR) University of Stuttgart, Pfaffenwaldring 47, 70569 Stuttgart,
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/
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)
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
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
ArcGIS Deployment Pattern. Azlina Mahad
ArcGIS Deployment Pattern Azlina Mahad Agenda Deployment Options Cloud Portal ArcGIS Server Data Publication Mobile System Management Desktop Web Device ArcGIS An Integrated Web GIS Platform Portal Providing
A Hysteresis-Based Energy-Saving Mechanism for Data Centers Christian Schwartz, Rastin Pries, Phuoc Tran-Gia www3.informatik.uni-wuerzburg.
Institute of Computer Science Chair of Communication Networks Prof. Dr.-Ing. P. Tran-Gia A Hysteresis-Based Energy-Saving Mechanism for Data Centers Christian Schwartz, Rastin Pries, Phuoc Tran-Gia www3.informatik.uni-wuerzburg.de
Why GIS & Why Internet GIS?
Why GIS & Why Internet GIS? The Internet bandwagon Internet mapping (e.g., MapQuest) Location-based services Real-time navigation (e.g., traffic) Real-time service dispatch Business Intelligence Spatial
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)
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.
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
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
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
Fuzzy Optimization and Normal Simulation for Solving Fuzzy Web Queuing System Problems
Fuzzy Optimization and Normal Simulation for Solving Fuzzy Web Queuing System Problems Xidong Zheng, Kevin Reilly Dept. of Computer and Information Sciences University of Alabama at Birmingham Birmingham,
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
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.
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
Introduction to queuing theory
Introduction to queuing theory Queu(e)ing theory Queu(e)ing theory is the branch of mathematics devoted to how objects (packets in a network, people in a bank, processes in a CPU etc etc) join and leave
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
Hurricanes Katrina and Rita created the largest natural disaster in American history
Overview of the Road Home Program Hurricanes Katrina and Rita created the largest natural disaster in American history In Louisiana: 123,000 homes suffered major damage 82,000 rental properties suffered
5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.
The objective of queuing analysis is to offer a reasonably satisfactory service to waiting customers. Unlike the other tools of OR, queuing theory is not an optimization technique. Rather, it determines
Web GIS Administration: Tips and Tricks
EdUC 2017 July 8 th, 2017 Web GIS Administration: Tips and Tricks Geri Miller Agenda Concerns Acknowledged User Management Content Management Monitoring Licensing and logins Sophistication of IT support
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
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
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,
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
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
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
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
Web GIS: Architectural Patterns and Practices. Shannon Kalisky Philip Heede
Web GIS: Architectural Patterns and Practices Shannon Kalisky Philip Heede Web GIS Transformation of the ArcGIS Platform Desktop Apps Server GIS Web Maps Web Scenes Layers Web GIS Transformation of the
ArcGIS Enterprise: Administration Workflows STUDENT EDITION
ArcGIS Enterprise: Administration Workflows STUDENT EDITION Copyright 2019 Esri All rights reserved. Course version 1.1. Version release date April 2019. Printed in the United States of America. The information
Queuing Theory. 3. Birth-Death Process. Law of Motion Flow balance equations Steady-state probabilities: , if
1 Queuing Theory 3. Birth-Death Process Law of Motion Flow balance equations Steady-state probabilities: c j = λ 0λ 1...λ j 1 µ 1 µ 2...µ j π 0 = 1 1+ j=1 c j, if j=1 c j is finite. π j = c j π 0 Example
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
Answers to selected exercises
Answers to selected exercises A First Course in Stochastic Models, Henk C. Tijms 1.1 ( ) 1.2 (a) Let waiting time if passengers already arrived,. Then,, (b) { (c) Long-run fraction for is (d) Let waiting
Queuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall
Queuing Analysis Chapter 13 13-1 Chapter Topics Elements of Waiting Line Analysis The Single-Server Waiting Line System Undefined and Constant Service Times Finite Queue Length Finite Calling Problem The
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
Introduction to Portal for ArcGIS
Introduction to Portal for ArcGIS Derek Law Product Management March 10 th, 2015 Esri Developer Summit 2015 Agenda Web GIS pattern Product overview Installation and deployment Security and groups Configuration
Production Line Tool Sets
Production Line Tool Sets Tools for high-quality database production and cartographic output Production Line Tool Sets Production Line Tool Sets (PLTS) by ESRI are a collection of software applications
Data Aggregation with InfraWorks and ArcGIS for Visualization, Analysis, and Planning
Data Aggregation with InfraWorks and ArcGIS for Visualization, Analysis, and Planning Stephen Brockwell President, Brockwell IT Consulting, Inc. Join the conversation #AU2017 KEYWORD Class Summary Silos
CS/ECE 715 Spring 2004 Homework 5 (Due date: March 16)
CS/ECE 75 Sprig 004 Homework 5 (Due date: March 6) Problem 0 (For fu). M/G/ Queue with Radom-Sized Batch Arrivals. Cosider the M/G/ system with the differece that customers are arrivig i batches accordig
TDDI04, K. Arvidsson, IDA, Linköpings universitet CPU Scheduling. Overview: CPU Scheduling. [SGG7] Chapter 5. Basic Concepts.
![TDDI04, K. Arvidsson, IDA, Linköpings universitet CPU Scheduling. Overview: CPU Scheduling. [SGG7] Chapter 5. Basic Concepts.](/thumbs/79/80204297.jpg "TDDI04, K. Arvidsson, IDA, Linköpings universitet CPU Scheduling. Overview: CPU Scheduling. [SGG7] Chapter 5. Basic Concepts.")
TDDI4 Concurrent Programming, Operating Systems, and Real-time Operating Systems CPU Scheduling Overview: CPU Scheduling CPU bursts and I/O bursts Scheduling Criteria Scheduling Algorithms Multiprocessor
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
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
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
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
TDDB68 Concurrent programming and operating systems. Lecture: CPU Scheduling II
TDDB68 Concurrent programming and operating systems Lecture: CPU Scheduling II Mikael Asplund, Senior Lecturer Real-time Systems Laboratory Department of Computer and Information Science Copyright Notice:
Fernando Chiyoshi 1, Ana Paula Iannoni 2 and Reinaldo Morabito 3*
Pesquisa Operacional (0) (): 7-99 0 Brazilian Operations Research Society Printed version ISSN 00-748 / Online version ISSN 678-54 www.scielo.br/pope A TUTORIAL ON HYPERCUBE QUEUEING MODELS AND SOME PRACTICAL
Web GIS Patterns and Practices
FedGIS Conference February 24 25, 2016 Washington, DC Web GIS Patterns and Practices Philip Heede Jay Theodore Witt Mathot Web GIS Transformation of the ArcGIS Platform Desktop Apps Web Maps Web Scenes
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
Introduction to ArcGIS Server - Creating and Using GIS Services. Mark Ho Instructor Washington, DC
Introduction to ArcGIS Server - Creating and Using GIS Services Mark Ho Instructor Washington, DC Technical Workshop Road Map Product overview Building server applications GIS services Developer Help resources
Enabling Web GIS. Dal Hunter Jeff Shaner
Enabling Web GIS Dal Hunter Jeff Shaner Enabling Web GIS In Your Infrastructure Agenda Quick Overview Web GIS Deployment Server GIS Deployment Security and Identity Management Web GIS Operations Web GIS
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
Geo-enabling a Transactional Real Estate Management System A case study from the Minnesota Dept. of Transportation
Geo-enabling a Transactional Real Estate Management System A case study from the Minnesota Dept. of Transportation Michael Terner Executive Vice President Co-author and Project Manager Andy Buck Overview
Tracey Farrigan Research Geographer USDA-Economic Research Service
Rural Poverty Symposium Federal Reserve Bank of Atlanta December 2-3, 2013 Tracey Farrigan Research Geographer USDA-Economic Research Service Justification Increasing demand for sub-county analysis Policy
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,
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
Portal for ArcGIS: An Introduction
Portal for ArcGIS: An Introduction Derek Law Esri Product Management Esri UC 2014 Technical Workshop Agenda Web GIS pattern Product overview Installation and deployment Security and groups Configuration
MapOSMatic, free city maps for everyone!
MapOSMatic, free city maps for everyone! Thomas Petazzoni thomas.petazzoni@enix.org Libre Software Meeting 2012 http://www.maposmatic.org Thomas Petazzoni () MapOSMatic: free city maps for everyone! July
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
Introduction to Queueing Theory
Introduction to Queueing Theory 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
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
An M/M/1/N Queuing system with Encouraged Arrivals
Global Journal of Pure and Applied Mathematics. ISS 0973-1768 Volume 13, umber 7 (2017), pp. 3443-3453 Research India Publications http://www.ripublication.com An M/M/1/ Queuing system with Encouraged
Networking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013
Networking = Plumbing TELE302 Lecture 7 Queueing Analysis: I Jeremiah Deng University of Otago 29 July 2013 Jeremiah Deng (University of Otago) TELE302 Lecture 7 29 July 2013 1 / 33 Lecture Outline Jeremiah
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
The Passport Control Problem or How to Keep an Unstable Service System Load Balanced?
The Passport Control Problem or How to Keep an Unstable Service System Load Balanced? A. ITAI Computer Science Department, Technion M. RODEH Computer Science Department, Technion H. SHACHNAI Computer Science
Portal for ArcGIS: An Introduction. Catherine Hynes and Derek Law
Portal for ArcGIS: An Introduction Catherine Hynes and Derek Law Agenda Web GIS pattern Product overview Installation and deployment Configuration options Security options and groups Portal for ArcGIS