A generalization of Amdahl's law and relative conditions of parallelism
|
|
- Doris Cooper
- 5 years ago
- Views:
Transcription
1 A generalization of Amdahl's law and relative conditions of arallelism Author: Gianluca Argentini, New Technologies and Models, Riello Grou, Legnago (VR), Italy. Abstract: In this work I resent a generalization of Amdahl's law on the limits of a arallel imlementation with many rocessors. In articular I establish some mathematical relations involving the number of rocessors and the dimension of the treated roblem, and with these conditions I define, on the ground of the reachable seedu, some classes of arallelism for the imlementations. I also derive a condition for obtaining suerlinear seedu. The used mathematical technics are those of differential calculus. I describe some examles from classical roblems offered by the secialized literature on the subject. Key words: dimension of a roblem, high erformances, arallel imlementation, scalability analysis, seedu.. Introduction In the world of arallel comuting or in general of high erformances one of the metric more useful for evaluating the gain reachable in an imlementation on many rocessors of a rogram in comarison with its serial monorocessor version is the seedu S (v. PACHECO, 997), defined as the ratio between the time Tser occurred for the execution of the serial rogram and the time Tar occurred for its arallel version: S = Tser ÅÅÅÅÅÅÅÅÅÅÅÅÅÅ Tar In this work I consider these two times as comuted by a scalability analysis (v. GROPP, 2002) of a articular logic imlementation of the roblem which they refer to, and not by their measurement on a articular hardware system. From the formula () one obtain the Amdahl's Law (v. AMDAHL, 967) by mean of the concet of arallelizable fraction f of a articular arallel imlementation, that is the ercentage of statements that are executable at the same time on many rocessors: S = ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ f H - L + where is the number of used rocessors and 0 < f. The otimal case, that is when f =, rovides for S a value equal to. The S is an increasing function resect to the variable, and for tending to infinity we obtain the limit () (2)
2 2 ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ - f that exresses the Amdahl's law, from which one observe that the seedu admits a suerior limitation determined by the used code, even if the number of rocessors is very high. In figure is drawn the grahic of seedu for a code with f = 0.8; the asymtotic limit is 5: (3) Seedu 6 Fig rocessors But the limitation imosed from this law can be overtaken, even in a a large measure, if one thinks that in formula (2) is not exlicitly resent the arameter that exresses the dimension of the considered roblem, that is the number n of data given as inut. A first reexamination of the Amdahl's law (v. BENNER - GUSTAFSON - MONTRY, 988) shows that, in several real situations, when the number of rocessors increases, a corresonding oortune increase of the number of treated data rovides a seedu much bigger than that imosed by (2). Even in (PACHECO, 997) there is a brief but illuminating discussion of this ossibility. The urose of this work is to exlain from a mathematical oint of view how it is ossibile to obtain seedu values much higher than those estimated from Amdahl's law, and to classify the arallel imlementations on the ground of the seedu obtained by various combinations of the arameters n and. 2. Generalization of Amdahl's law I will refer to an imlementation of a given roblem, that is to a triad (Problem, Program, System) constituted by a roblem, for examle the multilication of a matrix for a vector, by a rogram that accets the roblem's data as inut and by an oerative environment, to be intended as hardware as software, into which the rogram runs. The roblem gives the dimension n of the imlementation; the rogram, adating itself even to the hardware that is used, gives the number of rocessors. In accordance with the most art of the literature on the high erformances, for simlicity I identify the number of rocessors with the number of indeendent used rocesses, equal coies of the considered rogram. For examle, in the codes that use the arallelization library MPI (see MPI FORUM) the start of a arallel rogram ermits to secify the number of rocesses, that is of indeendent coies of the rogram itself, that communicate each other during the execution. Also I use the condition that the rocessors are all of the same tye and that the oerative environment is homogeneous resect to the used software (.e. comilers, libraries).
3 3 The first consideration is that the arameter f of Amdahl's Law can deend from the used imlementation, that is from the code instructions of the rogram used for treating the roblem, and hence in general it will be a function of and n: f = f H, nl If we introduce (4) into (2) and derive artially resect to, we obtain (4) S ÅÅÅÅÅÅÅÅÅÅ = ÅÅÅÅÅÅÅ 2 - ÅÅÅÅÅÅÅ + f ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ H f + H - f L L 2 One realist and desirable condition in the arallel imlementations for high erformances is that the seedu grows when the numbers of used rocessors increases, hence we imose the following condition: (5) S ÅÅÅÅÅÅÅÅÅÅ 0 and from the fact that the denominator in (5) is always ositive it follows that ÅÅÅÅÅÅÅÅÅÅ 2 - ÅÅÅÅÅÅÅÅÅÅ + f 0 Since f > 0, (7) can be written in this way: ÅÅÅÅÅÅÅ + H 2 - L ÅÅÅÅÅÅÅÅÅÅ 0 f Also, since > in a arallel imlementation, follows that 2 - > 0, ÅÅÅÅÅÅÅ H Log f L and remembering that ÅÅÅÅÅÅÅÅÅÅ = ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ, from H8L one obtains : f (6) (7) (8) H Log f L ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ (9) H 2 + ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ 0 - L Indefinitely integrating the first addendum resect to the variable, (9) is equivalent to ÅÅÅÅÅÅÅÅÅÅ i k jlog ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ - + ghnl + Log f y z 0 { where g (n) is an arbitrary function of n, that is the constant of integration resect to. Indicating with FH, nl the sum of the two logarithmic exressions, one can write (0) Log f = FH, nl - Log - ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ from which follows that: = FH, nl + Log ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ - ()
4 4 f = ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ ExH FH, nll - (2) We call the function F exonent of arallelism. We see now two F 's roerties useful for the subsequent discussion. First of all from (0) follow F ÅÅÅÅÅÅÅÅÅ (3) 0 hence F is an increasing function resect to. Also, being by definition f, from (2) one obtains the following condition: F H, nl Log - ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ < 0 Now we'll do some reasonings about the relation between F and the arallelism of the relative imlementation. In the first lace we can notice that it's realistic assuming that the dimension n of a treated roblem is greater of the number of rocessors used in the corresonding arallel imlementation; on the contrary we have a waste of hardware resources. Also, as exlicited.e. in (PACHECO, 997) and (BENNER - GUSTAFSON - MONTRY, 988), it's realistic assuming that as the number of used rocessors increases, the roblem dimension can increase too, otherwise the concet of arallelism's erformance and the research of a good imlementation itself could have no meaning. Under these iothesis from (2) there are two ossibilities: A) if becomes very large, the ratio ÅÅÅÅÅ n tends to a finite limit greater than 0; this is the case for examle when n = k, where k is a constant, even large; in this situation the two ossible meaningful alternatives are, remembering the conditions (3) and (4): a') FH, nl tends to 0, and from this follows that f tends to ; hence the arallel imlementation allows an unlimited seedu when increases, under the condition that the growth of roblem's dimension n is asymtotic to the rocessors number; a'' ) FH, nl tends to a finite limit smaller than 0, and from this follows that f tends to a value f 0 where 0 < f 0 < ; in this case, when the rocessors number increases, the arallel imlementation gives a behaviour that conforms to Amdahl's law, and the seedu is equal to ÅÅÅÅÅÅÅÅÅÅÅÅ (4) - f 0 ; B) if becomes very large, the ratio ÅÅÅÅÅ n tends to + ; this is the case for examle when n = Log ; in this situation the two ossible meaningful alternatives are: b') FH, nl tends to 0, and from this follows that f tends to ; hence the arallel imlementation allows an unlimited seedu when increases, and the roblem dimension can now increases with a very high velocity resect to the rocessors number; hence this situation is otimal and a real case is given for examle in (PACHECO, 997) by a arallel imlementation of the numerical integration with the traezoidal rule; b'' ) FH, nl tends to a finite limit smaller than 0, and from this follows that f tends to a value f 0
5 5 where 0 < f 0 < ; hence in this case too, when the rocessors number increases, the arallel imlementation gives a behaviour that conforms to Amdahl's law, but the roblem dimension can now increase in a way not asymtotic to the rocessors number. I consider not very realistic or at least not meaningful for an analysis of their arallelism the situations where the exonent of arallelism tends to -, in which case f tends to 0, the seedu becomes and there is resources's waste, or whose for which the ratio ÅÅÅÅ n tends to 0. From the revious considerations we can get the following theorem-definition, which generalizes the Amdahl's law and establishes the arallelism tye for a given imlementation: In a arallel imlementation, n is the dimension of the relative roblem, the rocessors number, F (,n) the function exonent of arallelism. gh L If n = g() is an increasing function of such that the ratio ÅÅÅÅÅÅÅÅÅÅÅ tends to + and F (, g()) tends to 0 for tending to +, than the imlementation is strongly arallel. If F (, g()) tends to 0 for tending to + only for g() increasing function gh L of such that the ratio ÅÅÅÅÅÅÅÅÅÅÅ tends to a finite limit, than the imlementation is weakly arallel. If for every g () increasing function of the function F (, g()) tends to a limit smaller than zero for tending to +, than the imlementation is Amdahl-like arallel. 3. Considerations and examles When we aly the receding classification we meet two roblems: the first is how to calculate the function exonent of arallelism, and the second is how to demonstrate if exist the right g () function. The former deends uon the used imlementation and it can be solved by mean of a scalability analysis (see GROPP, 2002), and in the following considerations I'll try to exlain how it is ossible to obtain some useful information; the latter is a roblem of mathematical kind which can be tackled by mean of the methods of differential calculus. First of all we can notice that in (2) we are interested to know when, for large enough values of, the exonential values are near to, and hence if we write the olynomial series of Ex(F) resect to the argument F we can assert that the following is a good aroximation: i f = ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ - k j + F + F 2 y ÅÅÅÅÅÅÅÅÅÅ z 2 { Using this exression of f into (2) one can obtain the following formula: F =- $%%%%%%%%%%%%%% - ÅÅÅÅÅ 2 S (5) (6)
6 6 where the interesting case is that with the + sign, because it is useful for examine the closeness of F to 0. In () we can consider Tar = Tar(, n). Also we can establish, as a good aroximation in general and otimal in the case when all the system's rocessors are of the same kind, that Tser = Tar(, n), i.e. the time sent in a serial imlementation of a rogram can be aroximated with the time sent in the corrisonding arallel imlementation executed in a unique rocessor. From () and (6) one obtain the following arallelism condition: Tar H, nl Tar H, nl ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ (7) 2 which can be interretated as a minimal condition of arallelism for the warranty of an advantageous seedu. We now examine some examle in which using the relation 2 T ar H, nl F =- + $%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% - ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ T ar H, nl (8) we can obtain the informations given in the receding generalization of Amdahl's law. In (PACHECO, 997) is resented a arallel imlementation of the numeric comutation of a definite integral by mean of the traezoidal rule, and using a scalability analysis the following estimate is obtained: T ar H, nl = a n ÅÅÅÅÅÅÅ + b Log whee a and b are two ositive constants deending from the used oerative environment. Hence we have Tar H, nl ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ Tar H, nl an + b Log = ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ an from which we see, using the rules of calculus, that if one consider for examle n = 2, increasing function resect to, the limit of the ratio when indefinitely grows is 0, and from (8) one obtain that F tends to 0. Hence on the ground of the receding classification, the imlementation is strongly arallel, and this fact is in accordance with the scalability argumentations develoed from Pacheco, from which if the increment of n is oortunity guided by that of, the seedu remains high. One can see that from the receding ratio for alying the classification rule it is sufficient to use the function n = Log, as reorted by Pacheco. If one uses the function n =, the limit of F when increases is still 0, but since the ratio ÅÅÅÅ n tends to a finite limit the imlementation, already classified as strongly arallel, reveals in such conditions a weakly arallel behaviour. This fact shows, in accordance with (BENNER -GUSTAFSON-MONTRY, 988), the imortance of a convenient growth function n = g() in a arallel imlementation which would have as aim a high seedu. Also it can be notice that keeing fixed the dimension n of the roblem, when the rocessors number increases the receding ratio increases in an unbounded manner, hence the arallelism is
7 7 no more advantageous, the (8) is not alicable, S tends to zero and hence the Amdahl's law (3) turns out not correct. This fact suggests the hyotesis that in the set of ossible imlementations the strongly arallel imlementations are those that turn out advantageous when the roblem's dimension grows in a suitably considerable way resect to the used rocessors number. In contrast with the Fig., we resent in the following Fig.2 the grahics of the seedu for the traezoidal rule resectively in the case n = 2, n = Log e n = : Seedu 500 Fig rocessors from which one can see that the seedu imroves when the derivative resect to the rocessors number of the roblem dimension grows. In (CORMEN-LEISERSON-RIVEST, 990) is resented a arallel imlementation for the calculation of a Fast Fourier Transform which has the aim of keeing an asymtotic execution time Tar = A Log (n), where A is a constant, n is the inut dimension and the logarithm is in base 2. The corresonding serial imlementation shows an asymtotic time Tser = B n Log (n). The constants A and B deend from the used oerative environment. The arallel rocedure is obtained by mean of a necessary configuration of n combinatorial elements, which are resonsable of the oerations of addition, multilication and intercommunication of artial results. If one use rocessors, each of these assembles k combinatorial elements, it is n = k, and hence T ar ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ Tser = A ÅÅÅÅÅÅÅÅÅÅÅÅ Bn = A ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ Bk The conclusion is that the function F tends to 0 for tending to +, and this under the condition that the roblem dimension grows linearly resect to the rocessors number. Hence on the ground of the receding classification, the arallel imlementation roosed for the FFT is weakly arallel. In this examle if one kees constant the roblem dimension n, increasing even indefinitely the rocessors (.e. identifying each of them with a single combinatorial element, hence imosing k = ), the ratio of the execution times is constant too, and therefore in this case the Amdahl's law can be alied. This consideration suggests that in the set of ossible imlementations the weakly arallel imlementations are those for which, keeing constant the relative roblem's dimension, the Amdahl's law is alicable.
8 8 In (GROPP, 2002) is resented an imlementation for multilying a n x n matrix with a vector of n comonents. The scalability analysis gives the following estimate: T ar H, nl = ah 2 n2 - n L ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ + b H n 2 + n L where a and b are two ositive constants deending from the used oerative environment. Hence one obtain T ar H, nl ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ T ar H, nl = a H 2 n2 - n L + bhn 2 + n L ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ H 2 n 2 - n L + b H n 2 + n LD = bn2 + 2 an 2 + bn-an ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ H 2 a + b L n 2 + H- a + bl n from which we see, using the rules of calculus, that if one considers a whatever increasing function n = g () such that ÅÅÅÅÅÅÅÅÅÅÅ g HL tends to + or not, the limit of the ratio when grows is b ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ H 2 a + b L Suosing that this quantity satisfies the minimal condition of arallelism (7), the limit of the function F given by (8) is finite and negative, therefore the rule of classification reviously enunciated secifies that the considered imlementation is Amdahl-like arallel. In (GROPP, 2002) is shown that the arameter b is the number of microseconds sent by a secific hardware for communicate beetwen two rocesses a floating-oint quantity, while a is the time sent for the execution of a floating-oint oeration. The (7) should imly the condition b 2a, not very realistic with the resent hardware, but the imrovements on the communications technology beetwen rocesses could render it reliable in the future. Imosing b = 2a, from (8) we have F = -, hence from (5) we obtain for f the limit 0.5, therefore the asymtotic value of the seedu is 2, that is near to the value 2.3 obtainable directly from (); in the following Fig.3 I resent the grahics of the seedu in the case n = 2, n = Log and n =, from which it is clear that the increasing of the dimension roblem resect to the used rocessors number ractically hasn't influence, on the contrary of what haens in a strongly arallel imlementation: Seedu 2.5 Fig rocessors 4. Suerlinear seedu In some real situations a suerlinear seedu is been registered, that is for some values of and
9 9 n the exerimental value of S is resulted greater then. A necessary condition for this situation is that in (2) the function f assumes values greater than, and recisely f > ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ - This doesn't agree fullfully with the initial definition of f as arallelizable fraction of a code, and hence smaller or equal to. Now we see how the suerlinear seedu can be exlained, in the mathematical roosed model, in a fashion coherent with the original definition of f. From (2) and (2) the suerlinear seedu imoses that (9) ÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅÅ ExH FH, nll H - L + < - and hence it must be ExH FH, nll> - ÅÅÅÅÅÅ therefore one obtains the condition (20) (2) FH, nl > Log i (22) k j - ÅÅÅÅÅÅ y z { First of all we can notice that the argument of logarithm is smaller than, therefore the (22) can be satisfied for values of F smaller than 0 too, and hence the roosed descrition is coherent with the originary condition f. We'll use the following aroximations, that are good for small values of the argument x: Log H + xl = x - x2 ÅÅÅÅÅÅÅÅ 2 (23) è!!!!!!!!!!! + x = + ÅÅÅÅÅ x (24) 2 - ÅÅÅÅÅÅÅÅ x2 8 In the case of a suerlinear imlementation the quantity under logarithm in (22) in general is small (mathematically it would sufficient = 0), therefore alying (23), from (22) and (6) one obtains FH, nl >-ÅÅÅÅÅÅÅÅÅÅÅÅ ÅÅÅÅÅÅ that can be considered as a suerlinear condition of an imlementation characterized by an exonent of arallelism F (,n). The figure 4 resents the grahic of the second member of (25), that reresents the inferior limit which must be resected by the function F (,n): (25)
10 0 Inferior limit for FH,nL Fig rocessors In such conditions the argument under square root in (6) is near to, hence from (24) one obtains ÅÅÅÅÅÅÅÅÅÅÅÅÅ 2 S 2 + ÅÅÅÅÅ S < ÅÅÅÅÅÅÅÅÅÅÅÅ ÅÅÅÅÅÅ condition which is trivialy satisfied by the classical condition of suerlinearity S >. Therefore (25) and (26) extend the notion of suerlinearity, and this in a coherent fashion with the original condition f. As an examle of alication of (25) or (26), we consider the arallel imlementation of the Fast Fourier Transform already mentioned. In this case one has, as uon reorted, ÅÅÅÅÅ S = A ÅÅÅÅÅÅÅÅÅ B n We suose for simlicity that n, as haens in real alications, is sufficiently large so that in (26) one can disregard the quadratic term at first member. Denoting by C the quantity ÅÅÅÅÅ A, that B deends from the hardware and software environment, using (26) and solving the disequality resect to the variable one obtains < ÅÅÅÅÅÅÅÅÅÅ (27) 2 C J n + "###################### n Cn N hence in this examle the suerlinear seedu is ossible only if the rocessors number is uer limited by a relation that involves the roblem dimension. In (CAVAZZONI-CHIAROTTI, 200) is reorted the exerimental observation of suerlinear seedu in an imlementation that uses in a great and sofisticated manner many arallelized FFT on a system Cray T3E with Fortran 90 as comiler: the rocessors region which resents suerlinearity is uer limited, and the (26)
11 henomenon is due to the effects of hardware and software caches, which in the receding mathematical schema are ointed out by the resence of the constant C. 5. Conclusions In this work I roosed a mathematical interretation of some exerimental results and of some theoretical digressions reorted in the literature on the ossible limits and erformances of arallel comuting. I roosed a generalization of Amdahl's law on the ossible seedu obtainable in a arallel imlementation. In articular I have resented some sufficient conditions in order that, in a given imlementation, the seedu could indefinitely grow when the dimension of the analyzed roblem increases as consequence of the growing of the used rocessors number. By mean of these conditions I have defined three classes into which the arallel imlementations can be classified, and the discriminant agent is offered by the relation of growth of roblem's dimension resect to the used rocessors number. Also I have roosed a condition of suerlinear seedu that is coherent with the original definition of arallelizable fraction of an imlementation. Some concrete examles are been resented to illustrate the formulated mathematical descrition, which in articular show that the obtained conditions have some constants deending from the hardware and software environment where the arallel imlementation is executed. Possible further develoments can regard the formulation of an algorithm for calculate the function exonent of arallelism of an imlementation, and an extension of the mathematical model to hardware architectures with non homogeneous rocessors. 6. Bibliograhy Gene AMDAHL, Validity of the single rocessor aroach to achieving large scale comuting caabilities, AFIPS Conference Proceedings, 967. R. BENNER - J. GUSTAFSON - G. MONTRY, Develoment of arallel methods for a 024- rocessor hyercube, SIAM Journal on Scientific and Statistical Comuting, 9(4), 988. Carlo CAVAZZONI - Guido CHIAROTTI, Imlementation of a Parallel and Modular Car- Parrinello Code, in Science and Suercomuting at CINECA, CINECA, Italy, 200. T.H. CORMEN - C.E. LEISERSON - R.L. RIVEST, Introduction to Algorithms, The MIT Press, Boston, 990. W. GROPP - E. LUSK, Parallel rogramming with MPI, in T. STERLING, Beowulf cluster comuting with Linux, The MIT Press, Boston, MPI FORUM, Web site: Peter PACHECO, Parallel rogramming with MPI, Morgan Kaufmann, San Francisco, 997.
MODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL
Technical Sciences and Alied Mathematics MODELING THE RELIABILITY OF CISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Cezar VASILESCU Regional Deartment of Defense Resources Management
More informationAnalysis of execution time for parallel algorithm to dertmine if it is worth the effort to code and debug in parallel
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
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 informationEstimation of the large covariance matrix with two-step monotone missing data
Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo
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 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 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 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 informationSpeedup 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 informationCHAPTER-II Control Charts for Fraction Nonconforming using m-of-m Runs Rules
CHAPTER-II Control Charts for Fraction Nonconforming using m-of-m Runs Rules. Introduction: The is widely used in industry to monitor the number of fraction nonconforming units. A nonconforming unit is
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 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 informationConvex Optimization methods for Computing Channel Capacity
Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem
More informationStatics and dynamics: some elementary concepts
1 Statics and dynamics: some elementary concets Dynamics is the study of the movement through time of variables such as heartbeat, temerature, secies oulation, voltage, roduction, emloyment, rices and
More informationA Closed-Form Solution to the Minimum V 2
Celestial Mechanics and Dynamical Astronomy manuscrit No. (will be inserted by the editor) Martín Avendaño Daniele Mortari A Closed-Form Solution to the Minimum V tot Lambert s Problem Received: Month
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 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 informationAn Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem
An Ant Colony Otimization Aroach to the Probabilistic Traveling Salesman Problem Leonora Bianchi 1, Luca Maria Gambardella 1, and Marco Dorigo 2 1 IDSIA, Strada Cantonale Galleria 2, CH-6928 Manno, Switzerland
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 informationAn Analysis of Reliable Classifiers through ROC Isometrics
An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. Srinkhuizen-Kuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICC-IKAT, Universiteit
More informationDETC2003/DAC AN EFFICIENT ALGORITHM FOR CONSTRUCTING OPTIMAL DESIGN OF COMPUTER EXPERIMENTS
Proceedings of DETC 03 ASME 003 Design Engineering Technical Conferences and Comuters and Information in Engineering Conference Chicago, Illinois USA, Setember -6, 003 DETC003/DAC-48760 AN EFFICIENT ALGORITHM
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 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 informationPreconditioning techniques for Newton s method for the incompressible Navier Stokes equations
Preconditioning techniques for Newton s method for the incomressible Navier Stokes equations H. C. ELMAN 1, D. LOGHIN 2 and A. J. WATHEN 3 1 Deartment of Comuter Science, University of Maryland, College
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 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 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 informationSTART Selected Topics in Assurance
START Selected Toics in Assurance Related Technologies Table of Contents Introduction Statistical Models for Simle Systems (U/Down) and Interretation Markov Models for Simle Systems (U/Down) and Interretation
More informationA SIMPLE PLASTICITY MODEL FOR PREDICTING TRANSVERSE COMPOSITE RESPONSE AND FAILURE
THE 19 TH INTERNATIONAL CONFERENCE ON COMPOSITE MATERIALS A SIMPLE PLASTICITY MODEL FOR PREDICTING TRANSVERSE COMPOSITE RESPONSE AND FAILURE K.W. Gan*, M.R. Wisnom, S.R. Hallett, G. Allegri Advanced Comosites
More informationThe Binomial Approach for Probability of Detection
Vol. No. (Mar 5) - The e-journal of Nondestructive Testing - ISSN 45-494 www.ndt.net/?id=7498 The Binomial Aroach for of Detection Carlos Correia Gruo Endalloy C.A. - Caracas - Venezuela www.endalloy.net
More informationSome results of convex programming complexity
2012c12 $ Ê Æ Æ 116ò 14Ï Dec., 2012 Oerations Research Transactions Vol.16 No.4 Some results of convex rogramming comlexity LOU Ye 1,2 GAO Yuetian 1 Abstract Recently a number of aers were written that
More informationParallel Quantum-inspired Genetic Algorithm for Combinatorial Optimization Problem
Parallel Quantum-insired Genetic Algorithm for Combinatorial Otimization Problem Kuk-Hyun Han Kui-Hong Park Chi-Ho Lee Jong-Hwan Kim Det. of Electrical Engineering and Comuter Science, Korea Advanced Institute
More informationON POLYNOMIAL SELECTION FOR THE GENERAL NUMBER FIELD SIEVE
MATHEMATICS OF COMPUTATIO Volume 75, umber 256, October 26, Pages 237 247 S 25-5718(6)187-9 Article electronically ublished on June 28, 26 O POLYOMIAL SELECTIO FOR THE GEERAL UMBER FIELD SIEVE THORSTE
More informationFor q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i
Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:
More informationLower Confidence Bound for Process-Yield Index S pk with Autocorrelated Process Data
Quality Technology & Quantitative Management Vol. 1, No.,. 51-65, 15 QTQM IAQM 15 Lower onfidence Bound for Process-Yield Index with Autocorrelated Process Data Fu-Kwun Wang * and Yeneneh Tamirat Deartment
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 informationUncertainty Modeling with Interval Type-2 Fuzzy Logic Systems in Mobile Robotics
Uncertainty Modeling with Interval Tye-2 Fuzzy Logic Systems in Mobile Robotics Ondrej Linda, Student Member, IEEE, Milos Manic, Senior Member, IEEE bstract Interval Tye-2 Fuzzy Logic Systems (IT2 FLSs)
More information16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes
Infinite Series 6.2 Introduction We extend the concet of a finite series, met in Section 6., to the situation in which the number of terms increase without bound. We define what is meant by an infinite
More information16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes
Infinite Series 6. Introduction We extend the concet of a finite series, met in section, to the situation in which the number of terms increase without bound. We define what is meant by an infinite series
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 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 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 informationGeneralized analysis method of engine suspensions based on bond graph modeling and feedback control theory
Generalized analysis method of ine susensions based on bond grah modeling and feedback ntrol theory P.Y. RICHARD *, C. RAMU-ERMENT **, J. BUION *, X. MOREAU **, M. LE FOL *** *Equie Automatique des ystèmes
More informationPaper C Exact Volume Balance Versus Exact Mass Balance in Compositional Reservoir Simulation
Paer C Exact Volume Balance Versus Exact Mass Balance in Comositional Reservoir Simulation Submitted to Comutational Geosciences, December 2005. Exact Volume Balance Versus Exact Mass Balance in Comositional
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 informationApplied Mathematics and Computation
Alied Mathematics and Comutation 217 (2010) 1887 1895 Contents lists available at ScienceDirect Alied Mathematics and Comutation journal homeage: www.elsevier.com/locate/amc Derivative free two-oint methods
More informationLower bound solutions for bearing capacity of jointed rock
Comuters and Geotechnics 31 (2004) 23 36 www.elsevier.com/locate/comgeo Lower bound solutions for bearing caacity of jointed rock D.J. Sutcliffe a, H.S. Yu b, *, S.W. Sloan c a Deartment of Civil, Surveying
More informationTopology Optimization of Three Dimensional Structures under Self-weight and Inertial Forces
6 th World Congresses of Structural and Multidiscilinary Otimization Rio de Janeiro, 30 May - 03 June 2005, Brazil Toology Otimization of Three Dimensional Structures under Self-weight and Inertial Forces
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 informationMATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK
Comuter Modelling and ew Technologies, 5, Vol.9, o., 3-39 Transort and Telecommunication Institute, Lomonosov, LV-9, Riga, Latvia MATHEMATICAL MODELLIG OF THE WIRELESS COMMUICATIO ETWORK M. KOPEETSK Deartment
More informationUsing the Divergence Information Criterion for the Determination of the Order of an Autoregressive Process
Using the Divergence Information Criterion for the Determination of the Order of an Autoregressive Process P. Mantalos a1, K. Mattheou b, A. Karagrigoriou b a.deartment of Statistics University of Lund
More informationHotelling s Two- Sample T 2
Chater 600 Hotelling s Two- Samle T Introduction This module calculates ower for the Hotelling s two-grou, T-squared (T) test statistic. Hotelling s T is an extension of the univariate two-samle t-test
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 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 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 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 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 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 informationCOMPARISON OF VARIOUS OPTIMIZATION TECHNIQUES FOR DESIGN FIR DIGITAL FILTERS
NCCI 1 -National Conference on Comutational Instrumentation CSIO Chandigarh, INDIA, 19- March 1 COMPARISON OF VARIOUS OPIMIZAION ECHNIQUES FOR DESIGN FIR DIGIAL FILERS Amanjeet Panghal 1, Nitin Mittal,Devender
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 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 informationRadial Basis Function Networks: Algorithms
Radial Basis Function Networks: Algorithms Introduction to Neural Networks : Lecture 13 John A. Bullinaria, 2004 1. The RBF Maing 2. The RBF Network Architecture 3. Comutational Power of RBF Networks 4.
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 informationFinite Mixture EFA in Mplus
Finite Mixture EFA in Mlus November 16, 2007 In this document we describe the Mixture EFA model estimated in Mlus. Four tyes of deendent variables are ossible in this model: normally distributed, ordered
More informationMinimax Design of Nonnegative Finite Impulse Response Filters
Minimax Design of Nonnegative Finite Imulse Resonse Filters Xiaoing Lai, Anke Xue Institute of Information and Control Hangzhou Dianzi University Hangzhou, 3118 China e-mail: laix@hdu.edu.cn; akxue@hdu.edu.cn
More informationThe non-stochastic multi-armed bandit problem
Submitted for journal ublication. The non-stochastic multi-armed bandit roblem Peter Auer Institute for Theoretical Comuter Science Graz University of Technology A-8010 Graz (Austria) auer@igi.tu-graz.ac.at
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 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 informationGalois Fields, Linear Feedback Shift Registers and their Applications
Galois Fields, Linear Feedback Shift Registers and their Alications With 85 illustrations as well as numerous tables, diagrams and examles by Ulrich Jetzek ISBN (Book): 978-3-446-45140-7 ISBN (E-Book):
More informationAge of Information: Whittle Index for Scheduling Stochastic Arrivals
Age of Information: Whittle Index for Scheduling Stochastic Arrivals Yu-Pin Hsu Deartment of Communication Engineering National Taiei University yuinhsu@mail.ntu.edu.tw arxiv:80.03422v2 [math.oc] 7 Ar
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 informationOne step ahead prediction using Fuzzy Boolean Neural Networks 1
One ste ahead rediction using Fuzzy Boolean eural etworks 1 José A. B. Tomé IESC-ID, IST Rua Alves Redol, 9 1000 Lisboa jose.tome@inesc-id.t João Paulo Carvalho IESC-ID, IST Rua Alves Redol, 9 1000 Lisboa
More informationUsing a Computational Intelligence Hybrid Approach to Recognize the Faults of Variance Shifts for a Manufacturing Process
Journal of Industrial and Intelligent Information Vol. 4, No. 2, March 26 Using a Comutational Intelligence Hybrid Aroach to Recognize the Faults of Variance hifts for a Manufacturing Process Yuehjen E.
More informationPrinciples of Computed Tomography (CT)
Page 298 Princiles of Comuted Tomograhy (CT) The theoretical foundation of CT dates back to Johann Radon, a mathematician from Vienna who derived a method in 1907 for rojecting a 2-D object along arallel
More informationA Comparison between Biased and Unbiased Estimators in Ordinary Least Squares Regression
Journal of Modern Alied Statistical Methods Volume Issue Article 7 --03 A Comarison between Biased and Unbiased Estimators in Ordinary Least Squares Regression Ghadban Khalaf King Khalid University, Saudi
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 informationAR PROCESSES AND SOURCES CAN BE RECONSTRUCTED FROM. Radu Balan, Alexander Jourjine, Justinian Rosca. Siemens Corporation Research
AR PROCESSES AND SOURCES CAN BE RECONSTRUCTED FROM DEGENERATE MIXTURES Radu Balan, Alexander Jourjine, Justinian Rosca Siemens Cororation Research 7 College Road East Princeton, NJ 8 fradu,jourjine,roscag@scr.siemens.com
More informationChurilova Maria Saint-Petersburg State Polytechnical University Department of Applied Mathematics
Churilova Maria Saint-Petersburg State Polytechnical University Deartment of Alied Mathematics Technology of EHIS (staming) alied to roduction of automotive arts The roblem described in this reort originated
More informationFORMAL DEFINITION OF TOLERANCING IN CAD AND METROLOGY
P. SERRÉ, A. CLÉENT, A. RIVIÈRE FORAL DEFINITION OF TOLERANCING IN CAD AND ETROLOGY Abstract: Our aim is to unify mathematically the secification and the metrological verification of a given geometrical
More informationScaling Multiple Point Statistics for Non-Stationary Geostatistical Modeling
Scaling Multile Point Statistics or Non-Stationary Geostatistical Modeling Julián M. Ortiz, Steven Lyster and Clayton V. Deutsch Centre or Comutational Geostatistics Deartment o Civil & Environmental Engineering
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 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 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 informationA SIMPLE AD EFFICIET PARALLEL FFT ALGORITHM USIG THE BSP MODEL MARCIA A. IDA AD ROB H. BISSELIG Abstract. In this aer, we resent a new arallel radix-4
Universiteit-Utrecht * Deartment of Mathematics A simle and ecient arallel FFT algorithm using the BSP model by Marcia A. Inda and Rob H. Bisseling Prerint nr. 3 March 2000 A SIMPLE AD EFFICIET PARALLEL
More informationAdaptive estimation with change detection for streaming data
Adative estimation with change detection for streaming data A thesis resented for the degree of Doctor of Philosohy of the University of London and the Diloma of Imerial College by Dean Adam Bodenham Deartment
More informationGenetic Algorithms, Selection Schemes, and the Varying Eects of Noise. IlliGAL Report No November Department of General Engineering
Genetic Algorithms, Selection Schemes, and the Varying Eects of Noise Brad L. Miller Det. of Comuter Science University of Illinois at Urbana-Chamaign David E. Goldberg Det. of General Engineering University
More informationA Bound on the Error of Cross Validation Using the Approximation and Estimation Rates, with Consequences for the Training-Test Split
A Bound on the Error of Cross Validation Using the Aroximation and Estimation Rates, with Consequences for the Training-Test Slit Michael Kearns AT&T Bell Laboratories Murray Hill, NJ 7974 mkearns@research.att.com
More informationOn Fractional Predictive PID Controller Design Method Emmanuel Edet*. Reza Katebi.**
On Fractional Predictive PID Controller Design Method Emmanuel Edet*. Reza Katebi.** * echnology and Innovation Centre, Level 4, Deartment of Electronic and Electrical Engineering, University of Strathclyde,
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 informationFault Tolerant Quantum Computing Robert Rogers, Thomas Sylwester, Abe Pauls
CIS 410/510, Introduction to Quantum Information Theory Due: June 8th, 2016 Sring 2016, University of Oregon Date: June 7, 2016 Fault Tolerant Quantum Comuting Robert Rogers, Thomas Sylwester, Abe Pauls
More informationLOGISTIC REGRESSION. VINAYANAND KANDALA M.Sc. (Agricultural Statistics), Roll No I.A.S.R.I, Library Avenue, New Delhi
LOGISTIC REGRESSION VINAANAND KANDALA M.Sc. (Agricultural Statistics), Roll No. 444 I.A.S.R.I, Library Avenue, New Delhi- Chairerson: Dr. Ranjana Agarwal Abstract: Logistic regression is widely used when
More informationMULTIVARIATE STATISTICAL PROCESS OF HOTELLING S T CONTROL CHARTS PROCEDURES WITH INDUSTRIAL APPLICATION
Journal of Statistics: Advances in heory and Alications Volume 8, Number, 07, Pages -44 Available at htt://scientificadvances.co.in DOI: htt://dx.doi.org/0.864/jsata_700868 MULIVARIAE SAISICAL PROCESS
More informationDeveloping A Deterioration Probabilistic Model for Rail Wear
International Journal of Traffic and Transortation Engineering 2012, 1(2): 13-18 DOI: 10.5923/j.ijtte.20120102.02 Develoing A Deterioration Probabilistic Model for Rail Wear Jabbar-Ali Zakeri *, Shahrbanoo
More informationApproximation of the Euclidean Distance by Chamfer Distances
Acta Cybernetica 0 (0 399 47. Aroximation of the Euclidean Distance by Chamfer Distances András Hajdu, Lajos Hajdu, and Robert Tijdeman Abstract Chamfer distances lay an imortant role in the theory of
More informationImplementation of a Column Generation Heuristic for Vehicle Scheduling in a Medium-Sized Bus Company
7e Conférence Internationale de MOdélisation et SIMulation - MOSIM 08 - du 31 mars au 2 avril 2008 Paris- France «Modélisation, Otimisation MOSIM 08 et Simulation du 31 mars des Systèmes au 2 avril : 2008
More informationRecent Developments in Multilayer Perceptron Neural Networks
Recent Develoments in Multilayer Percetron eural etworks Walter H. Delashmit Lockheed Martin Missiles and Fire Control Dallas, Texas 75265 walter.delashmit@lmco.com walter.delashmit@verizon.net Michael
More informationq-ary Symmetric Channel for Large q
List-Message Passing Achieves Caacity on the q-ary Symmetric Channel for Large q Fan Zhang and Henry D Pfister Deartment of Electrical and Comuter Engineering, Texas A&M University {fanzhang,hfister}@tamuedu
More informationON THE DEVELOPMENT OF PARAMETER-ROBUST PRECONDITIONERS AND COMMUTATOR ARGUMENTS FOR SOLVING STOKES CONTROL PROBLEMS
Electronic Transactions on Numerical Analysis. Volume 44,. 53 72, 25. Coyright c 25,. ISSN 68 963. ETNA ON THE DEVELOPMENT OF PARAMETER-ROBUST PRECONDITIONERS AND COMMUTATOR ARGUMENTS FOR SOLVING STOKES
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 information