Analysis of execution time for parallel algorithm to dertmine if it is worth the effort to code and debug in parallel
|
|
- Julian Reed
- 6 years ago
- Views:
Transcription
1 Performance Analysis Introduction Analysis of execution time for arallel algorithm to dertmine if it is worth the effort to code and debug in arallel Understanding barriers to high erformance and redict imrovement Goal: to figure out whether a rogram merits arallelization Seedu and efficiency Seedu Exectation is for the arallel code to run faster than the sequential counterart Ratio of sequential execution time to arallel execution time Execution time comonents Inherently sequential comutations: σ(n) Potentially arallel comutations: ϕ(n) Communication oerations and other reeat comutations: κ(n, ) Seedu ψ(n, ) solving a roblem of size n on rocessors On sequential comuter Only one comutation at a time No interrocess communication and other overheads Time required is given by On arallel comuter Cannot do anything about inherently sequential comutation In best case, comutation is equally divided between PEs Also need to add time for interrocess communication among PEs Time required is given by + κ(n, ) Parallel execution time will be larger if it cannot be erfectly divided among rocessors, leading to smaller seedu Actual seedu will be limited by ψ(n, ) + κ(n, ) Adding rocessors reduces comutation time but increases communication time At some oint, communication time increase is larger than decrease in comutation time Elbow out oint The seedu begins to decline with additional PEs
2 Performance Analysis 2 Comutation time Communication time Efficiency Measure of rocessor utilization Ratio of seedu to number of rocessors used Efficiency ε(n, ) for a roblem of size n on rocessors is given by ε(n, ) ε(n, ) σ(n)+ϕ(n) ) (σ(n)+ ϕ(n) +κ(n,) σ(n)+ϕ(n) σ(n)+ϕ(n)+κ(n,)) It is easy to see that 0 ε(n, ) Amdahl s law Consider the exression for seedu ψ(n, ) above Since κ(n, ) > 0 ψ(n, ) + κ(n, ) This gives us the maximum ossible seedu in the absence of communication overhead Let f denote the inherently sequential fraction of the comutation f = σ(n)
3 Performance Analysis 3 Then, we have ψ(n, ) σ(n)/f σ(n) + σ(n)(/f )/ /f + (/f )/ f + ( f)/ Definition Let f be the fraction of oerations in a comutation that must be erformed sequentially, where 0 f. The maximum seedu ψ achievable by a arallel comuter with rocessors erforming the comutation is ψ f + ( f)/ Based on the assumtion that we are trying to solve a roblem of fixed size as quickly as ossible Provides an uer bound on the seedu achievable with a given number of rocessors, trying to solve the roblem in arallel Also useful to determine the asymtotic seedu as the number of rocessors increases Examle Determine whether it is worthwhile to develo a arallel version of a rogram to solve a articular roblem 95% of rogram s execution occurs inside a loo that can be executed in arallel Maximum seedu exected from a arallel version of rogram executing on 8 CPUs Exect a seedu of 5.9 or less Examle 2 ψ ( 0.05)/ % of a rogram s execution time is sent within inherently sequential code Limit to the seedu achieveable by a arallel version of the rogram Examle 3 ψ = lim ( 0.2)/ = 0.2 = 5 Parallel version of a sequential rogram with time comlexity Θ(n 2 ), n being the size of dataset Time needed to inut dataset and outut result (sequential ortion of code): ( n) µs Comutational ortion can be executed in arallel in time (n 2 /00) µs Maximum seedu on a roblem of size 0,000 ψ /
4 Performance Analysis 4 Limitations of Amdahl s law Ignores communication overhead κ(n, ) Assume that the arallel version of rogram in Examle 3 has log n communication oints Communication time at each of these oints: 0000 log + (n/0) µs For a roblem with n = 0000, the total communication time is 4(0000 log + 000)µs The communication time takes into account lg 0000 = 4 for transmission across the net Now, the seedu is given by ψ / log Ignoring communication time results in overestimation of seedu The Amdahl effect Tyically, κ(n, ) has lower comlexity than ϕ(n) In the hyothetical case of Examle 3 As n increases, ϕ(n)/ dominates κ(n, ) For a fixed, as n increases, seedu increases Review of Amdahl s law Treats roblem size as a constant κ(n, ) = Θ(n log n + n log ) ϕ(n) = Θ(n 2 ) Shows how execution time decreases as number of rocessors increase Another ersective We often use faster comuters to solve larger roblem instances Treat time as a constant and allow roblem size to increase with number of CPUs Gustafson-Barsis s law Assumtion in Amdahl s Law: Minimizing execution time is the focus of arallel comuting Assumes constant roblem size and demonstrates how increasing PEs can reduce time User may want to use arallelism to imrove the accuracy of the result Treat time as a constant and let the roblem size increase with number of rocessors Solve a roblem to higher accuracy within the available time by increasing the number of PEs Sequential fraction of comutation may decrease with increase in roblem size (Amdahl effect) Increasing number of PEs allows for increase in roblem size, decreasing inherently sequential fraction of a comutation, and increasing the quotient between serial and arallel execution times Consider seedu exression again (κ(n, ) 0) ψ(n, )
5 Performance Analysis 5 Let s be the fraction sent in arallel comutation erforming inherently sequential oerations Pure arallel comutations can be given as s s = s = σ(n) ϕ(n)/ This leads to Now, seedu is given by σ(n) = ϕ(n) = ψ(n, ) ( ) s ( ) ( s) ( s + ( s) + ( )s ) (s + ( s)) Definition 2 Given a arallel rogram solving a roblem of size n using rocessors, let s denote the fraction of total execution time sent in serial code. The maximum seedu ψ achievable by this rogram is Predicts scaled seedu ψ + ( )s Amdahl s law looks at serial comutation and redicts how much faster it will be on multile rocessors It does not scale the availability of comuting ower as the number of PEs increase Gustafson-Barsis s law begins with arallel comutation and estimates the seedu comared to a single rocessor In many cases,assuming a single rocessor is only times slower than rocessors is overly otimistic Solve a roblem on arallel comuter with 6 PEs, each with GB of local memory Let the dataset occuy 5GB, and aggregate memory of arallel comuter is barely large enough to hold the dataset and multile coies of rogram On a single rocessor machine, the entire dataset may not fit in the rimary memory If working set size of rocess exceeded GB, it may begin to thrash, taking more than 6 times as long to execute the arallel ortion of the code as the grou of 6 PEs Effectively, in Gustafson-Bassis s Law, seedu is the time required by arallel rogram divided into the time that would be required to solve the same roblem on a single CPU, if it had sufficient memory Seedu redicted by Gustafson-Barsis s Law is called scaled seedu Using the arallel comutation as the starting oint, rather than the sequential comutation, it allows the roblem size to be an increasing function of the number of PEs A driving metahor
6 Performance Analysis 6 Amdahl s Law: Suose a car is traveling between two cities 60 miles aart, and has already sent one hour traveling half the distance at 30 mh; no matter how fast you drive the last half, it is imossible to achieve 90 mh average before reaching the second city. Since it has already taken you one hour and you have a distance of 60 miles total, going infinitely fast you would only achieve 60 mh. Gustafson s Law: Suose a car has already beeen traveling for some time at less than 90 mh. Given enough time and distance to travel, the car s average seed can always eventually reach 90 mh, no matter how long and how slowly it has already traveled. For examle, if the car sent one hour at 30 mh, it could achieve this by driving at 20 mh for two additional hours, or at 50 mh for an hour, and so on. Examle An alication running on 0 rocessors sends 3% of its time in serial code Scaled seedu of this alication Examle 2 Desired scaled seedu of 7 on 8 rocessors ψ = 0 + ( 0)(0.03) = = 9.73 Maximum fraction of rogram s arallel execution time that can be sent in serial code Examle 3 7 = 8 + ( 8)s s 0.4 Vicki lans to justify her urchase of a $30 million Gadzooks suercomuter by demonstrating its 6,384 rocessors can achieve a scaled seedu of 5,000 on a roblem of great imortance to her emloyer. What is the maximum fraction of the arallel execution time that can be devoted to inherently sequential oerations if her alication is to achieve this goal? Alication in research ( 6384)s s 384/ Amdahl s Law assumes that the comuting requirements will stay the same, given increased rocessing ower Analysis of the same data will take less time with more comuting ower Gustafson s Law argues that more comuting ower will cause the data to be more carefully and fully analyzed at a finer scale (ixel by ixel or unit by unit) than on a larger scale Simulating imact of nuclear detonation on every building, car, and their contents Kar-Flatt metric Amdahl s law and Gustafson-Barsis s law ignore communication overhead Results in overestimation of seedu or scaled seedu Exerimentally determined serial fraction to get erformance insight Execution time of arallel rogram on rocessors T (n, ) = + κ(n, )
7 Performance Analysis 7 No communication overhead for serial rogram T (n, ) = Exerimentally determined serial fraction e of arallel comutation is the total amount of idle and overhead time scaled by two factors: the number of PEs (less one) and the sequential execution time e = ( )σ(n) + κ(n, ) ( )T (n, ) Now, we have Rewrite the arallel execution time as T (n, ) T (n, ) e = ( )T (n, ) T (n, ) = (T (n, )e + T (n, )( e)/ Use ψ as a shorthand for ψ(n, ) ψ = T (n, ) T (n, ) T (n, ) = T (n, )ψ Now, comute time for rocessors as T (n, ) = T (n, )ψe + T (n, )ψ( e)/ = ψe + ψ( e)/ ψ = e + e = e + e ( = e ) + e = ψ Definition 3 Given a arallel comutation exhibiting seedu ψ on rocessors, where >, the exerimentally determined serial fraction e is defined to be ψ e = Useful metric for two reasons. Takes into account arallel overhead (κ(n, )) 2. Detects other sources of overhead or inefficiency ignored in seedu model Process startu time Process synchronization Imbalanced workload Architectural overhead Hels to determine whether the efficiency decrease in arallel comutation is due to limited oortunities for arallelism or the increase in algorithmic/architectural overhead
8 Performance Analysis 8 Examle Look at the following seedu table with rocessors ψ What is the rimary reason for seedu of only 4.7 on 8 CPUs? Comute e e Since e is constant, the rimary reason is large serial fraction in the code; limited oortunity for arallelism Examle 2 Look at the following seedu table with rocessors ψ What is the rimary reason for seedu of only 4.7 on 8 CPUs? Comute e e Since e is steadily increasing, the rimary reason is arallel overhead; time sent in rocess startu, communication, or syncronization, or architectural constraint Isoefficiency metric Parallel system: A arallel rogram executing on a arallel comuter Scalability: A measure of arallel system s ability to increase erformance as number of rocessors increase A scalable system maintains efficiency as rocessors are added Amdahl effect Seedu and efficiency are tyically an increasing function of roblem size because of communication comlexity being lower than comutational comlexity The roblem size can be increased to maintain the same level of efficiency when rocessors are added Isoefficiency: way to measure scalability Isoefficiency derivation stes Begin with seedu formula Comute total amount of overhead Assume efficiency remains constant Determine relation between sequential execution time and overhead Deriving isoefficiency relation ψ(n, ) + κ(n, ) () + κ(n, ) () + ( )σ(n) + κ(n, )
9 Performance Analysis 9 Let T 0 (n, ) be the total time sent by all rocessors doing work not done by sequential algorithm; it includes Time sent by rocessors executing inherently sequential code Time sent by all rocessors erforming communication and redundant comutations Substituting for T 0 (n, ) in seedu equation Efficiency equals seedu divided by T 0 (n, ) = ( )σ(n) + κ(n, ) ψ(n, ) () + T 0 (n, ) ε(n, ) Substituting T (n, ) =, we have + T 0 (n, ) + T0(n,) σ(n)+ϕ(n) ε(n, ) T 0 (n, ) T (n, ) T (n, ) + T0(n,) T (n,) ε(n, ) ε(n, ) ε(n, ) ε(n, ) T 0(n, ) For constant level of efficiency, the fraction ε(n,) ε(n,) is a constant This yields the isoefficiency relation as T (n, ) CT 0 (n, ) Definition 4 Suose a arallel system exhibits efficiency ε(n, ). Define C = ε(n,) ε(n,) and T 0(n, ) = ( )σ(n) + κ(n, ). In order to maintain the same level of efficiency as the number of rocessors increases, n must be increased so that the following inequality is satisfied: Isoefficiency relation T (n, ) CT 0 (n, ) Used to determine the range of rocessors for which a given level of efficiency can be maintained Parallel overhead increases with number of rocessors Efficiency can be maintained by increasing the size of the roblem being solved Scalability function All algorithms assume that the maximum roblem size is limited by the amount of rimary memory available Treat sace as the limiting factor in the analysis Assume that the arallel system has isoefficiency relation as n f() M(n) denotes the amount of memory needed to store a roblem of size n Relation M (n) f() indicates how the amount of memory used must increase as a function of to maintain a constant level of efficiency Rewrite the relation as n M(f()) Total amount of memory available is a linear function of the number of rocessors
10 Performance Analysis 0 Amount of memory er rocessor must increase by M(f())/ to maintain the same level of efficiency Scalability function is: M(f())/ Comlexity of scalability function determines the range of rocessors for which a constant level of efficiency can be maintained If M(f())/ = Θ(), memory requirement er rocessor is constant and the system is erfectly scalable If M(f())/ = Θ(), memory requirement er rocessor increases linearly with the number of rocessors While memory is available, it is ossible to maintain same level of ε by increasing the roblem size But memory used er rocessor increases linearly with ; at some oint it may reach the memory caacity of the system Limits efficiency when the number of rocessors increase to a level Similar arguments for the cases when M(f())/ = Θ(log ) and M(f())/ = Θ( log ) In general, lower the comlexity of M(f())/, higher the scalability of the arallel system Examle Reduction Comutational comlexity of sequential reduction algorithm Θ(n) Reduction ste time comlexity in arallel algorithm Θ(log ) Since every PE articiates in this ste, T 0 (n, ) = Θ( log ) Isoefficiency relation for reduction algorithm (with a constant C) n C log Since sequential algorithm reduces n values, M(n) = n, leading to Reduction of n values on PEs M(C log )/ = C log / = C log Each PE adds about n/ values and articiates in the reduction that has log stes If we double the values of n and, each PE still adds about n/ values, but reduction time is increased to log(2) ; this dros efficiency To maintain the same level of efficiency, n has to be greater than double with twice the number of PEs Examle Floyd s algorithm Sequential algorithm has time comlexity Θ(n 3 ) Each of PEs sends Θ(n 2 log ) time in communications Isoefficiency relation n 3 C(n 2 log ) n C log Consider the memory requirements along with roblem size n Amount of storage needed to reresent a roblem of size n is n 2, or M(n) = n 2 The scalability function is Poor scalability comared to arallel reduction M(C log )/ = C 2 2 log 2 / = C 2 log 2
Speedup for Multi-Level Parallel Computing
Seedu for Multi-Level Parallel Comuting Shaniang Tang, Bu-Sung Lee,2, Bingsheng He School of Comuter Engineering 2 Service Platform Lab Nanyang Technological University HP Labs Singaore {stang5, ebslee,
More informationComputer arithmetic. Intensive Computation. Annalisa Massini 2017/2018
Comuter arithmetic Intensive Comutation Annalisa Massini 7/8 Intensive Comutation - 7/8 References Comuter Architecture - A Quantitative Aroach Hennessy Patterson Aendix J Intensive Comutation - 7/8 3
More informationA generalization of Amdahl's law and relative conditions of parallelism
A generalization of Amdahl's law and relative conditions of arallelism Author: Gianluca Argentini, New Technologies and Models, Riello Grou, Legnago (VR), Italy. E-mail: gianluca.argentini@riellogrou.com
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationOn Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm
On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm Gabriel Noriega, José Restreo, Víctor Guzmán, Maribel Giménez and José Aller Universidad Simón Bolívar Valle de Sartenejas,
More informationECE 534 Information Theory - Midterm 2
ECE 534 Information Theory - Midterm Nov.4, 009. 3:30-4:45 in LH03. You will be given the full class time: 75 minutes. Use it wisely! Many of the roblems have short answers; try to find shortcuts. You
More informationShadow Computing: An Energy-Aware Fault Tolerant Computing Model
Shadow Comuting: An Energy-Aware Fault Tolerant Comuting Model Bryan Mills, Taieb Znati, Rami Melhem Deartment of Comuter Science University of Pittsburgh (bmills, znati, melhem)@cs.itt.edu Index Terms
More informationJohn Weatherwax. Analysis of Parallel Depth First Search Algorithms
Sulementary Discussions and Solutions to Selected Problems in: Introduction to Parallel Comuting by Viin Kumar, Ananth Grama, Anshul Guta, & George Karyis John Weatherwax Chater 8 Analysis of Parallel
More informationEvaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models
Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 48109-2122 {knatel,imarkov,jhayes}@eecs.umich.edu
More informationA Parallel Algorithm for Minimization of Finite Automata
A Parallel Algorithm for Minimization of Finite Automata B. Ravikumar X. Xiong Deartment of Comuter Science University of Rhode Island Kingston, RI 02881 E-mail: fravi,xiongg@cs.uri.edu Abstract In this
More informationEigenanalysis of Finite Element 3D Flow Models by Parallel Jacobi Davidson
Eigenanalysis of Finite Element 3D Flow Models by Parallel Jacobi Davidson Luca Bergamaschi 1, Angeles Martinez 1, Giorgio Pini 1, and Flavio Sartoretto 2 1 Diartimento di Metodi e Modelli Matematici er
More informationFeedback-error control
Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller
More informationElliptic Curves and Cryptography
Ellitic Curves and Crytograhy Background in Ellitic Curves We'll now turn to the fascinating theory of ellitic curves. For simlicity, we'll restrict our discussion to ellitic curves over Z, where is a
More informationSolved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.
Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in single-neuron ercetrons with the
More informationOutline. EECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Simple Error Detection Coding
Outline EECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Error detection using arity Hamming code for error detection/correction Linear Feedback Shift
More informationPerformance Evaluation of Codes. Performance Metrics
CS6230 Performance Evaluation of Codes Performance Metrics Aim to understanding the algorithmic issues in obtaining high performance from large scale parallel computers Topics for Conisderation General
More informationTheory of Parallel Hardware May 11, 2004 Massachusetts Institute of Technology Charles Leiserson, Michael Bender, Bradley Kuszmaul
Theory of Parallel Hardware May 11, 2004 Massachusetts Institute of Technology 6.896 Charles Leiserson, Michael Bender, Bradley Kuszmaul Final Examination Final Examination ffl Do not oen this exam booklet
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More informationCombining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)
Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment
More informationEE 508 Lecture 13. Statistical Characterization of Filter Characteristics
EE 508 Lecture 3 Statistical Characterization of Filter Characteristics Comonents used to build filters are not recisely redictable L C Temerature Variations Manufacturing Variations Aging Model variations
More informationA randomized sorting algorithm on the BSP model
A randomized sorting algorithm on the BSP model Alexandros V. Gerbessiotis a, Constantinos J. Siniolakis b a CS Deartment, New Jersey Institute of Technology, Newark, NJ 07102, USA b The American College
More informationPARALLEL MATRIX MULTIPLICATION: A SYSTEMATIC JOURNEY
PARALLEL MATRIX MULTIPLICATION: A SYSTEMATIC JOURNEY MARTIN D SCHATZ, ROBERT A VAN DE GEIJN, AND JACK POULSON Abstract We exose a systematic aroach for develoing distributed memory arallel matrix matrix
More informationMulti-Operation Multi-Machine Scheduling
Multi-Oeration Multi-Machine Scheduling Weizhen Mao he College of William and Mary, Williamsburg VA 3185, USA Abstract. In the multi-oeration scheduling that arises in industrial engineering, each job
More informationLecture 17: Analytical Modeling of Parallel Programs: Scalability CSCE 569 Parallel Computing
Lecture 17: Analytical Modeling of Parallel Programs: Scalability CSCE 569 Parallel Computing Department of Computer Science and Engineering Yonghong Yan yanyh@cse.sc.edu http://cse.sc.edu/~yanyh 1 Topic
More informationChapter 7 Rational and Irrational Numbers
Chater 7 Rational and Irrational Numbers In this chater we first review the real line model for numbers, as discussed in Chater 2 of seventh grade, by recalling how the integers and then the rational numbers
More informationState Estimation with ARMarkov Models
Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,
More informationSection 0.10: Complex Numbers from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative
Section 0.0: Comlex Numbers from Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.
More informationRound-off Errors and Computer Arithmetic - (1.2)
Round-off Errors and Comuter Arithmetic - (.). Round-off Errors: Round-off errors is roduced when a calculator or comuter is used to erform real number calculations. That is because the arithmetic erformed
More informationCMSC 425: Lecture 4 Geometry and Geometric Programming
CMSC 425: Lecture 4 Geometry and Geometric Programming Geometry for Game Programming and Grahics: For the next few lectures, we will discuss some of the basic elements of geometry. There are many areas
More informationSession 5: Review of Classical Astrodynamics
Session 5: Review of Classical Astrodynamics In revious lectures we described in detail the rocess to find the otimal secific imulse for a articular situation. Among the mission requirements that serve
More informationAn Improved Calibration Method for a Chopped Pyrgeometer
96 JOURNAL OF ATMOSPHERIC AND OCEANIC TECHNOLOGY VOLUME 17 An Imroved Calibration Method for a Choed Pyrgeometer FRIEDRICH FERGG OtoLab, Ingenieurbüro, Munich, Germany PETER WENDLING Deutsches Forschungszentrum
More informationRobust Predictive Control of Input Constraints and Interference Suppression for Semi-Trailer System
Vol.7, No.7 (4),.37-38 htt://dx.doi.org/.457/ica.4.7.7.3 Robust Predictive Control of Inut Constraints and Interference Suression for Semi-Trailer System Zhao, Yang Electronic and Information Technology
More informationDistributed Rule-Based Inference in the Presence of Redundant Information
istribution Statement : roved for ublic release; distribution is unlimited. istributed Rule-ased Inference in the Presence of Redundant Information June 8, 004 William J. Farrell III Lockheed Martin dvanced
More informationInformation collection on a graph
Information collection on a grah Ilya O. Ryzhov Warren Powell February 10, 2010 Abstract We derive a knowledge gradient olicy for an otimal learning roblem on a grah, in which we use sequential measurements
More informationarxiv: v1 [physics.data-an] 26 Oct 2012
Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules
More informationThe Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule
The Grah Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule STEFAN D. BRUDA Deartment of Comuter Science Bisho s University Lennoxville, Quebec J1M 1Z7 CANADA bruda@cs.ubishos.ca
More informationA Qualitative Event-based Approach to Multiple Fault Diagnosis in Continuous Systems using Structural Model Decomposition
A Qualitative Event-based Aroach to Multile Fault Diagnosis in Continuous Systems using Structural Model Decomosition Matthew J. Daigle a,,, Anibal Bregon b,, Xenofon Koutsoukos c, Gautam Biswas c, Belarmino
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationHENSEL S LEMMA KEITH CONRAD
HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar
More informationOnline Appendix to Accompany AComparisonof Traditional and Open-Access Appointment Scheduling Policies
Online Aendix to Accomany AComarisonof Traditional and Oen-Access Aointment Scheduling Policies Lawrence W. Robinson Johnson Graduate School of Management Cornell University Ithaca, NY 14853-6201 lwr2@cornell.edu
More informationPROFIT MAXIMIZATION. π = p y Σ n i=1 w i x i (2)
PROFIT MAXIMIZATION DEFINITION OF A NEOCLASSICAL FIRM A neoclassical firm is an organization that controls the transformation of inuts (resources it owns or urchases into oututs or roducts (valued roducts
More informationOperations Management
Universidade Nova de Lisboa Faculdade de Economia Oerations Management Winter Semester 009/010 First Round Exam January, 8, 009, 8.30am Duration: h30 RULES 1. Do not searate any sheet. Write your name
More informationPARALLEL MATRIX MULTIPLICATION: A SYSTEMATIC JOURNEY
PARALLEL MATRIX MULTIPLICATION: A SYSTEMATIC JOURNEY MARTIN D SCHATZ, ROBERT A VAN DE GEIJN, AND JACK POULSON Abstract We exose a systematic aroach for develoing distributed memory arallel matrixmatrix
More informationSTABILITY ANALYSIS TOOL FOR TUNING UNCONSTRAINED DECENTRALIZED MODEL PREDICTIVE CONTROLLERS
STABILITY ANALYSIS TOOL FOR TUNING UNCONSTRAINED DECENTRALIZED MODEL PREDICTIVE CONTROLLERS Massimo Vaccarini Sauro Longhi M. Reza Katebi D.I.I.G.A., Università Politecnica delle Marche, Ancona, Italy
More information8 STOCHASTIC PROCESSES
8 STOCHASTIC PROCESSES The word stochastic is derived from the Greek στoχαστικoς, meaning to aim at a target. Stochastic rocesses involve state which changes in a random way. A Markov rocess is a articular
More informationCSE 599d - Quantum Computing When Quantum Computers Fall Apart
CSE 599d - Quantum Comuting When Quantum Comuters Fall Aart Dave Bacon Deartment of Comuter Science & Engineering, University of Washington In this lecture we are going to begin discussing what haens to
More informationImproved Capacity Bounds for the Binary Energy Harvesting Channel
Imroved Caacity Bounds for the Binary Energy Harvesting Channel Kaya Tutuncuoglu 1, Omur Ozel 2, Aylin Yener 1, and Sennur Ulukus 2 1 Deartment of Electrical Engineering, The Pennsylvania State University,
More informationUniversal Finite Memory Coding of Binary Sequences
Deartment of Electrical Engineering Systems Universal Finite Memory Coding of Binary Sequences Thesis submitted towards the degree of Master of Science in Electrical and Electronic Engineering in Tel-Aviv
More informationOn the Relationship Between Packet Size and Router Performance for Heavy-Tailed Traffic 1
On the Relationshi Between Packet Size and Router Performance for Heavy-Tailed Traffic 1 Imad Antonios antoniosi1@southernct.edu CS Deartment MO117 Southern Connecticut State University 501 Crescent St.
More informationA General Theory of Computational Scalability Based on Rational Functions
A General Theory of Comutational Scalability Based on Rational Functions Neil J. Gunther arxiv:0808.1431v1 [cs.pf] 11 Aug 2008 August 25, 2008 Abstract The universal scalability law (USL) of comutational
More informationA New Method of DDB Logical Structure Synthesis Using Distributed Tabu Search
A New Method of DDB Logical Structure Synthesis Using Distributed Tabu Search Eduard Babkin and Margarita Karunina 2, National Research University Higher School of Economics Det of nformation Systems and
More information5. PRESSURE AND VELOCITY SPRING Each component of momentum satisfies its own scalar-transport equation. For one cell:
5. PRESSURE AND VELOCITY SPRING 2019 5.1 The momentum equation 5.2 Pressure-velocity couling 5.3 Pressure-correction methods Summary References Examles 5.1 The Momentum Equation Each comonent of momentum
More informationSystem Reliability Estimation and Confidence Regions from Subsystem and Full System Tests
009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 0-, 009 FrB4. System Reliability Estimation and Confidence Regions from Subsystem and Full System Tests James C. Sall Abstract
More informationParallelism and Locality in Priority Queues. A. Ranade S. Cheng E. Deprit J. Jones S. Shih. University of California. Berkeley, CA 94720
Parallelism and Locality in Priority Queues A. Ranade S. Cheng E. Derit J. Jones S. Shih Comuter Science Division University of California Berkeley, CA 94720 Abstract We exlore two ways of incororating
More informationFinite-State Verification or Model Checking. Finite State Verification (FSV) or Model Checking
Finite-State Verification or Model Checking Finite State Verification (FSV) or Model Checking Holds the romise of roviding a cost effective way of verifying imortant roerties about a system Not all faults
More informationConvolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code.
Convolutional Codes Goals Lecture Be able to encode using a convolutional code Be able to decode a convolutional code received over a binary symmetric channel or an additive white Gaussian channel Convolutional
More informationLecture 21: Quantum Communication
CS 880: Quantum Information Processing 0/6/00 Lecture : Quantum Communication Instructor: Dieter van Melkebeek Scribe: Mark Wellons Last lecture, we introduced the EPR airs which we will use in this lecture
More informationNetwork DEA: A Modified Non-radial Approach
Network DEA: A Modified Non-radial Aroach Victor John M. Cantor Deartment of Industrial and Systems Engineering National University of Singaore (NUS), Singaore, Singaore Tel: (+65) 913 40025, Email: victorjohn.cantor@u.nus.edu
More informationCSC165H, Mathematical expression and reasoning for computer science week 12
CSC165H, Mathematical exression and reasoning for comuter science week 1 nd December 005 Gary Baumgartner and Danny Hea hea@cs.toronto.edu SF4306A 416-978-5899 htt//www.cs.toronto.edu/~hea/165/s005/index.shtml
More informationNUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION- INERT CONFINEMENT INTERACTIONS
NUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION- INERT CONFINEMENT INTERACTIONS Tariq D. Aslam and John B. Bdzil Los Alamos National Laboratory Los Alamos, NM 87545 hone: 1-55-667-1367, fax: 1-55-667-6372
More informationSIMULATED ANNEALING AND JOINT MANUFACTURING BATCH-SIZING. Ruhul SARKER. Xin YAO
Yugoslav Journal of Oerations Research 13 (003), Number, 45-59 SIMULATED ANNEALING AND JOINT MANUFACTURING BATCH-SIZING Ruhul SARKER School of Comuter Science, The University of New South Wales, ADFA,
More informationUse of Transformations and the Repeated Statement in PROC GLM in SAS Ed Stanek
Use of Transformations and the Reeated Statement in PROC GLM in SAS Ed Stanek Introduction We describe how the Reeated Statement in PROC GLM in SAS transforms the data to rovide tests of hyotheses of interest.
More informationLecture 1.2 Units, Dimensions, Estimations 1. Units To measure a quantity in physics means to compare it with a standard. Since there are many
Lecture. Units, Dimensions, Estimations. Units To measure a quantity in hysics means to comare it with a standard. Since there are many different quantities in nature, it should be many standards for those
More informationDeriving Indicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V.
Deriving ndicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V. Deutsch Centre for Comutational Geostatistics Deartment of Civil &
More informationAn Analysis of TCP over Random Access Satellite Links
An Analysis of over Random Access Satellite Links Chunmei Liu and Eytan Modiano Massachusetts Institute of Technology Cambridge, MA 0239 Email: mayliu, modiano@mit.edu Abstract This aer analyzes the erformance
More informationNotes on Instrumental Variables Methods
Notes on Instrumental Variables Methods Michele Pellizzari IGIER-Bocconi, IZA and frdb 1 The Instrumental Variable Estimator Instrumental variable estimation is the classical solution to the roblem of
More informationEnergy-aware optimisation for run-time reconfiguration
Energy-aware otimisation for run-time reconfiguration Tobias Becker and Wayne Luk Deartment of Comuting Imerial College London, UK eter Y. K. Cheung Deartment of Electrical and Electronic Engineering Imerial
More information2-D Analysis for Iterative Learning Controller for Discrete-Time Systems With Variable Initial Conditions Yong FANG 1, and Tommy W. S.
-D Analysis for Iterative Learning Controller for Discrete-ime Systems With Variable Initial Conditions Yong FANG, and ommy W. S. Chow Abstract In this aer, an iterative learning controller alying to linear
More informationUnderstanding and Using Availability
Understanding and Using Availability Jorge Luis Romeu, Ph.D. ASQ CQE/CRE, & Senior Member C. Stat Fellow, Royal Statistical Society Past Director, Region II (NY & PA) Director: Juarez Lincoln Marti Int
More informationMatching Partition a Linked List and Its Optimization
Matching Partition a Linked List and Its Otimization Yijie Han Deartment of Comuter Science University of Kentucky Lexington, KY 40506 ABSTRACT We show the curve O( n log i + log (i) n + log i) for the
More informationInformation collection on a graph
Information collection on a grah Ilya O. Ryzhov Warren Powell October 25, 2009 Abstract We derive a knowledge gradient olicy for an otimal learning roblem on a grah, in which we use sequential measurements
More informationGIVEN an input sequence x 0,..., x n 1 and the
1 Running Max/Min Filters using 1 + o(1) Comarisons er Samle Hao Yuan, Member, IEEE, and Mikhail J. Atallah, Fellow, IEEE Abstract A running max (or min) filter asks for the maximum or (minimum) elements
More informationModeling and Estimation of Full-Chip Leakage Current Considering Within-Die Correlation
6.3 Modeling and Estimation of Full-Chi Leaage Current Considering Within-Die Correlation Khaled R. eloue, Navid Azizi, Farid N. Najm Deartment of ECE, University of Toronto,Toronto, Ontario, Canada {haled,nazizi,najm}@eecg.utoronto.ca
More informationUnderstanding and Using Availability
Understanding and Using Availability Jorge Luis Romeu, Ph.D. ASQ CQE/CRE, & Senior Member Email: romeu@cortland.edu htt://myrofile.cos.com/romeu ASQ/RD Webinar Series Noviembre 5, J. L. Romeu - Consultant
More informationOutline. CS21 Decidability and Tractability. Regular expressions and FA. Regular expressions and FA. Regular expressions and FA
Outline CS21 Decidability and Tractability Lecture 4 January 14, 2019 FA and Regular Exressions Non-regular languages: Puming Lemma Pushdown Automata Context-Free Grammars and Languages January 14, 2019
More informationINTRODUCTION. Please write to us at if you have any comments or ideas. We love to hear from you.
Casio FX-570ES One-Page Wonder INTRODUCTION Welcome to the world of Casio s Natural Dislay scientific calculators. Our exeriences of working with eole have us understand more about obstacles eole face
More informationGOOD MODELS FOR CUBIC SURFACES. 1. Introduction
GOOD MODELS FOR CUBIC SURFACES ANDREAS-STEPHAN ELSENHANS Abstract. This article describes an algorithm for finding a model of a hyersurface with small coefficients. It is shown that the aroach works in
More informationProvided by the author(s) and University College Dublin Library in accordance with ublisher olicies. Please cite the ublished version when available. Title Low Comlexity Stochastic Otimization-Based Model
More informationDevelopment of self-adaptively loading for planetary roller traction-drive transmission
Available online www.jocr.com Journal of Chemical and Pharmaceutical Research, 013, 5(9):498-506 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 Develoment of self-adatively loading for lanetary
More information3.4 Design Methods for Fractional Delay Allpass Filters
Chater 3. Fractional Delay Filters 15 3.4 Design Methods for Fractional Delay Allass Filters Above we have studied the design of FIR filters for fractional delay aroximation. ow we show how recursive or
More informationA Study of Active Queue Management for Congestion Control
A Study of Active Queue Management for Congestion Control Victor Firoiu vfiroiu@nortelnetworks.com Nortel Networks 3 Federal St. illerica, MA 1821 USA Marty orden mborden@tollbridgetech.com Tollridge Technologies
More informationModel checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle]
Chater 5 Model checking, verification of CTL One must verify or exel... doubts, and convert them into the certainty of YES or NO. [Thomas Carlyle] 5. The verification setting Page 66 We introduce linear
More informationUncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning
TNN-2009-P-1186.R2 1 Uncorrelated Multilinear Princial Comonent Analysis for Unsuervised Multilinear Subsace Learning Haiing Lu, K. N. Plataniotis and A. N. Venetsanooulos The Edward S. Rogers Sr. Deartment
More informationModeling Pointing Tasks in Mouse-Based Human-Computer Interactions
Modeling Pointing Tasks in Mouse-Based Human-Comuter Interactions Stanislav Aranovskiy, Rosane Ushirobira, Denis Efimov, Géry Casiez To cite this version: Stanislav Aranovskiy, Rosane Ushirobira, Denis
More informationPractice Final Solutions
Practice Final Solutions 1. True or false: (a) If a is a sum of three squares, and b is a sum of three squares, then so is ab. False: Consider a 14, b 2. (b) No number of the form 4 m (8n + 7) can be written
More informationResearch of PMU Optimal Placement in Power Systems
Proceedings of the 5th WSEAS/IASME Int. Conf. on SYSTEMS THEORY and SCIENTIFIC COMPUTATION, Malta, Setember 15-17, 2005 (38-43) Research of PMU Otimal Placement in Power Systems TIAN-TIAN CAI, QIAN AI
More informationEXACTLY PERIODIC SUBSPACE DECOMPOSITION BASED APPROACH FOR IDENTIFYING TANDEM REPEATS IN DNA SEQUENCES
EXACTLY ERIODIC SUBSACE DECOMOSITION BASED AROACH FOR IDENTIFYING TANDEM REEATS IN DNA SEUENCES Ravi Guta, Divya Sarthi, Ankush Mittal, and Kuldi Singh Deartment of Electronics & Comuter Engineering, Indian
More informationChapter 1 Fundamentals
Chater Fundamentals. Overview of Thermodynamics Industrial Revolution brought in large scale automation of many tedious tasks which were earlier being erformed through manual or animal labour. Inventors
More informationGeneral Linear Model Introduction, Classes of Linear models and Estimation
Stat 740 General Linear Model Introduction, Classes of Linear models and Estimation An aim of scientific enquiry: To describe or to discover relationshis among events (variables) in the controlled (laboratory)
More informationOn Load Shedding in Complex Event Processing
On Load Shedding in Comlex Event Processing Yeye He icrosoft Research Redmond, WA, 98052 yeyehe@microsoft.com Siddharth Barman California Institute of Technology Pasadena, CA, 906 barman@caltech.edu Jeffrey
More informationNew Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms
New Schedulability Test Conditions for Non-reemtive Scheduling on Multirocessor Platforms Technical Reort May 2008 Nan Guan 1, Wang Yi 2, Zonghua Gu 3 and Ge Yu 1 1 Northeastern University, Shenyang, China
More informationUnit 1 - Computer Arithmetic
FIXD-POINT (FX) ARITHMTIC Unit 1 - Comuter Arithmetic INTGR NUMBRS n bit number: b n 1 b n 2 b 0 Decimal Value Range of values UNSIGND n 1 SIGND D = b i 2 i D = 2 n 1 b n 1 + b i 2 i n 2 i=0 i=0 [0, 2
More informationStatistics II Logistic Regression. So far... Two-way repeated measures ANOVA: an example. RM-ANOVA example: the data after log transform
Statistics II Logistic Regression Çağrı Çöltekin Exam date & time: June 21, 10:00 13:00 (The same day/time lanned at the beginning of the semester) University of Groningen, Det of Information Science May
More informationMODEL-BASED MULTIPLE FAULT DETECTION AND ISOLATION FOR NONLINEAR SYSTEMS
MODEL-BASED MULIPLE FAUL DEECION AND ISOLAION FOR NONLINEAR SYSEMS Ivan Castillo, and homas F. Edgar he University of exas at Austin Austin, X 78712 David Hill Chemstations Houston, X 77009 Abstract A
More informationFE FORMULATIONS FOR PLASTICITY
G These slides are designed based on the book: Finite Elements in Plasticity Theory and Practice, D.R.J. Owen and E. Hinton, 1970, Pineridge Press Ltd., Swansea, UK. 1 Course Content: A INTRODUCTION AND
More informationThermal Propellant Gauging System for BSS 601
5th AIAA International Communications Satellite Systems Conference (organized by APSCC) AIAA 007-3149 Thermal Proellant Gauging System for BSS 601 T. Narita. 1 JSAT Cor, 9-1 Miho-Cho, Midori-ku, Yokohama
More information16. Binary Search Trees
Dictionary imlementation 16. Binary Search Trees [Ottman/Widmayer, Ka..1, Cormen et al, Ka. 12.1-12.] Hashing: imlementation of dictionaries with exected very fast access times. Disadvantages of hashing:
More informationHomework Set #3 Rates definitions, Channel Coding, Source-Channel coding
Homework Set # Rates definitions, Channel Coding, Source-Channel coding. Rates (a) Channels coding Rate: Assuming you are sending 4 different messages using usages of a channel. What is the rate (in bits
More informationAP Physics C: Electricity and Magnetism 2004 Scoring Guidelines
AP Physics C: Electricity and Magnetism 4 Scoring Guidelines The materials included in these files are intended for noncommercial use by AP teachers for course and exam rearation; ermission for any other
More information