Lutz Prechelt Fakultíat fíur Informatik. Universitíat Karlsruhe, Postfach Dí7500 Karlsruhe, Germany.

Size: px
Start display at page:

Download "Lutz Prechelt Fakultíat fíur Informatik. Universitíat Karlsruhe, Postfach Dí7500 Karlsruhe, Germany."

Transcription

1 Comparison of MasPar MP-1 and MP- Communication Operations Lutz Prechelt Institut fíur Programmstrukturen und Datenorganisation Fakultíat fíur Informatik Universitíat Karlsruhe, Postfach 9 Dí75 Karlsruhe, Germany ++9è71è-, Fax: ++9è71è99 April 3, 1993 Technical Report 1è93 Abstract Report 1è93 ëpre93ë describes the ændings of a series of communication measurements performed on a MasPar MP-1 series MP-11A machine. The current report covers the same measurements performed on a MP- series MP-1 machine. It compares the results and outlines and discusses the main diæerences. In these measurements, raw router communication was sometimes faster, sometimes slower on the MP- than on the MP-1, depending on the parameters of the communication requested. The relative performance of the MP- varied between 93è and 1è. Xnet communication was faster in all cases èperformance 1è to 175èè. Complex functions from the communication library were also always faster èperformance 1è to 1èè. Some of these results contradict technical speciæcations for the MP-1 and MP- published by MasPar. 1

2 CONTENTS Contents 1 Introduction 1.1 The scope of this report : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1. Technical speciæcation comparison of MP-1 and MP- : : : : : : : : : : : : : : : : : : Raw router communication 5.1 The router statement : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5. Using other activation patterns : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7.3 Using other communication patterns : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7. rsend and rfetch : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 9..1 sending large packets : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 9.. rsend vs. rfetch : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 9..3 rsend vs. router statement : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.. singular vs. plural pointers : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 3 xnet communication 11 Communication library functions 1.1 reduce : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1. scan : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.3 sendwith : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 13. enumerate, selectone, selectfirst : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 13.5 psort, rank : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 13 5 Summary of Results 1

3 LIST OF FIGURES 3 List of Figures 1 router permutation sensitivity : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : router send : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 router fetch : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : router send vs. fetch : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 5 sendèfetch routercount by PE activity : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 router sendèfetch by routercount : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 7 router send analytic approximation èlinear scaleè : : : : : : : : : : : : : : : : : : : : : router send analytic approximation èlogarithmic scaleè : : : : : : : : : : : : : : : : : : 9 router send with probabilistic vs. regular activity : : : : : : : : : : : : : : : : : : : : : 1 router fetch with diæerent communication patterns : : : : : : : : : : : : : : : : : : : : 11 router send large packets : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 9 1 router send very large packets : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 9 13 rsend vs. rfetch : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 9 1 router send vs. ss rsend : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 9 15 rsend with probabilistic vs. regular activity : : : : : : : : : : : : : : : : : : : : : : : : 1 1 rsend with singular and plural pointers è bytesè : : : : : : : : : : : : : : : : : : : : : 1 17 rfetch with singular and plural pointers è bytesè : : : : : : : : : : : : : : : : : : : : : 1 1 rsend with singular and plural pointers è3 bytesè : : : : : : : : : : : : : : : : : : : : : 1 19 xnet send : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 11 xnet send vs. fetch : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 11 1 xfetch in nonstandard direction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 11 ss xfetchèsend vs. pp xfetchèsend : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 3 sp xfetchèsend vs. ps xfetchèsend : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 pp xfetchèsend for small and large packets : : : : : : : : : : : : : : : : : : : : : : : : : 1 5 reduce : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 13 scan : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 13 7 sendwithadd vs. sendwithmax : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 13 sendwithadd with diæerent PE activity : : : : : : : : : : : : : : : : : : : : : : : : : : 13 9 sendwithadd with diæerent destination patterns : : : : : : : : : : : : : : : : : : : : : 1 3 rank and psort : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1

4 1 INTRODUCTION 1 Introduction 1.1 The scope of this report A few weeks after my technical report ëpre93ë had been published, Jan Berger Henriksen from the University of Bergen, Norway, contacted me. He asked whether he could run my measurement program on Bergen's new MasPar MP- machine. I agreed and he made the results available to me. I compiled the results into this report. The machine used was a MP-1 èthe 13 processor version of the MP-è, which corresponds directly to the MP-11A èthe 13 processor version of the MP-1è that was used for the measurements in the old report. This history has the following consequences: æ This report covers exactly the same measurements as ëpre93ë, which I will now call the old report. æ For easier overview, it also contains exactly the same set of diagrams. All diagrams use the same scales and nomenclature as in the old report. Only the actual data points are diæerent. æ Since this model of comparison tends to introduce a lot of redundancy, I have stripped most of the textual contents of the old report from this one. Thus, it is not useful to read this report alone, you need the old report as a reference to understand what the measurements mean. In particular, often-used phrases such as ëas we can see in ægure x"usually meann ëas we can see by comparing ægure x from this report with ægure x from the old report". æ The discussion of the MP- measurement results does not cover the absolute eæects that can be observed in MP- communication behavior but only the relative eæects in comparison to the MP-1. The report is structured as follows: After this introduction follows a comparison of the technical speciæcations of the two machines and a very short discussion of the eæects that can be expected from their diæerences. The other three sections è to è follow the same structure as in the old report: They discuss, in order, the raw router communication, the xnet communication, and the higher communication library functions. A short summary of the observations follows in section 5. To ease reading, the sequence of the diagrams from the old report was preserved, as was the substructuring of the individual sections. This decision resulted in some ægures not being referenced at all and some subsections being almost completely empty. All comparisons are expressed in percent relative performance of the MP- compared to the MP-1, i.e. the performance of the MP-1 is 1è for each operation measured. 1. Technical speciæcation comparison of MP-1 and MP- The main diæerence between the MP-1 and MP- series of MasPar machines is that for the MP- the CPU chip has been completely redesigned. This greatly enhances its computational performance. The communication network, on the other hand, was kept almost without èexternally visibleè change. Table 1 shows some technical speciæcations taken from MasPar marketing material. These speciæcations give an idea of the diæerences between the machines that we can expect to observe in communication measurements. The most important lines to look at are those that specify the router and xnet bandwith and the memory bandwith.

5 5 Unit MP-1 MP- relative Raw computation 3 bit Integer MIPS 1è 3 bit Floating Point MFLOPS è bit Floating Point MFLOPS 55 3è Memory bandwith direct addressing MBès 11 1è indirect addressing MBès 7 195è Communication xnet bandwith MBès 3 7è router bandwith MBès è Table 1: MasPar MP-11 and MP-1 technical speciæcations They tell us that we can expect to ænd memory-to-memory router communication slightly faster on the MP- than on the MP-1, in particular when the packet size is high èdue to higher memory bandwithè and in particular when indirect addressing is used. Xnet communication may be somewhat faster on MP- than on MP-1 for the same reasons, but may as well sometimes be a bit slower, because of the reduced bandwith of the xnet on the MP-. For more complex library operations that use communication we can expect to ænd increased performance on the MP-, because the high raw processing speed of its CPU will accelerate the computations embedded within these operations by factors of or 3. As we will see, these expectations were not always met by the actual measurements: Router communication happened to be slower on the MP- in some cases. We can only speculate about the reasons for this lack of speed: one possibility is that the speciæcations MasPar published are simply not quite correct, another possibility would be that the MP- machine had some hardware problems during the measurements 1, a third explanation would be that synchronization of CPU and communication network is more diæcult on the MP- and eats up a lot of time. Whatever the actual reason was, in the following I assume that the diæerences are real, i.e., not produced by hardware problems. This assumption is supported by ægure 1. It shows that over 1 repetitions of the same communication operation èa permutation with changing communication patternè, the MP- averages about 9 ticks while the MP-1 averages about ticks and the variance of both samples is very similar. From this I conclude that the MP- is indeed about è slower on this operation than the MP-1. Raw router communication In this section we will examine the behavior of the router statement and the rsend and rfetch library functions..1 The router statement From ægure we ænd that router send èusing a permutation as the communication pattern and moving data from memory and to memoryè is slightly slower on the MP-. The relative performance for full 1 Since the MasPar machines can transparently perform automatic retries when communication operations fail, a machine can get a little slower èinstead of failingè when some component has intermittant errors.

6 RAW ROUTER COMMUNICATION 7 send..ap1 send..ap Repetition Nr. Figure 1: router permutation sensitivity 7 send.1.pp send..pp send..pp 7 fetch.1.pp fetch..pp fetch..pp log(#active_pes) Figure : router send Figure 3: router fetch log(#active_pes) PE activity are on the order of 3è7 è=9èè for byte packets, è9 è=9èè for byte packets, and 3è395 è=9èè for 1 byte packets. Note that these values are derived from averaging of small samples of about measurement values which diæer by up to 11è. These variations mean that the results can only give an idea of the overall behavior but are not precise in the sense of statistical signiæcance. The absolute values given in the text are also rounded somewhat to ease their perception. For the router fetch corresponding to the above send, on the other hand, we ænd that the MP- is slightly faster, as ægure 3 shows. The relative performance is 13è for byte packets, 15è for byte packets, and 1è for 1 byte packets. That send performance is below 1è while fetch performance is above 1è is no accident, as we can see from ægure : For a constant number of router steps, that is, independent of the actual permutation used, the same diæerences show up: For instance for 35 router steps, the send took about 39 ticks on the MP-1 but almost ticks on the MP-, a relative performance of about 9è. For 39 fetch router steps, on the other hand, the MP-1 took almost ticks while the MP- needed only 39 a relative performance of 13è. As expected, ægure 5 indicates that the same number of router steps are required for a given problem This comment applies to most other comparisons as well. Sometimes, however, the number of relevant data points is much larger.

7 . Using other activation patterns 7 7 send.1.pp send..pp fetch.1.pp fetch..pp log(#active_pes) Figure : router send vs. fetch 5 5 send..pp fetch..pp 7 send..pp fetch..pp 35 routercount log(#active_pes) 5 Figure 5: sendèfetch routercount by PE activity Figure : router sendèfetch by routercount routercount on both machines. This was to be expected since the communication network functions algorithmically identical on both machines. Figures 7 and depict the analytic approximation describing the dependency between the number of active PEs and the time used for a -byte permutation send on the MP-1. We see that for the MP- this approximation is a bit too small for high PE activity èright part of ægure 7è and a bit too large for low PE activity èleft part of ægure è.. Using other activation patterns Using regular activation patterns instead of stochastic ones does not reveal any interesting new eæects èægure 9è..3 Using other communication patterns Using regular communication patterns instead of random permutations also does not reveal any interesting new eæects èægure 1è.

8 RAW ROUTER COMMUNICATION 7 send..pp.*x + 1*sqrt(x) send..pp.*x + 1*sqrt(x) # active PEs # active PEs Figure 7: router send analytic approximation èlinear scaleè Figure : router send analytic approximation èlogarithmic scaleè 7 send..pp send..rp send..bp 7 fetch..pp fetch..ps1 fetch..ps1 fetch..pr fetch..p log(#active_pes) log(#active_pes) Figure 9: router send with probabilistic vs. regular activity Figure 1: router fetch with diæerent communication patterns

9 . rsend and rfetch send..pp send..pp ss_rsend.3.pp ss_rsend.1.pp 15 send..pp ss_rsend.3.pp ss_rsend.1.pp ss_rsend.5.pp log(#active_pes) Figure 11: router send large packets Figure 1: router send very large packets 1 log(#active_pes) 1 1 ss_rsend..pp ss_rfetch..pp pp_rsend..pp pp_rfetch..pp 7 send..pp ss_rsend..pp log(#active_pes) Figure 13: rsend vs. rfetch Figure 1: router send vs. ss rsend 1 log(#active_pes). rsend and rfetch..1 sending large packets The timings for sending larger packets of data are given in ægures 11 and 1. They indicate that large packets may result in signiæcant increase in the relative performance of the MP-. This is due to the higher memory bandwith. For instance, a 5-byte send with 13 PEs active uses only about 1 ticks instead of 1 on the MP-1 è1è performanceè. 1-byte send with 1 PEs active uses 3 instead of 3 è1è performanceè. 3-byte sends perform at about 115è... rsend vs. rfetch Figure 13 indicates that ss rsend performs at 1è for -byte packets and ss rfetch at about 13è. For the indirect-addressing versions pp rsend and pp rfetch, the values are similar.

10 1 RAW ROUTER COMMUNICATION 3 ss_rsend.3.pp ss_rsend.3.rp ss_rsend.3.bp 1 1 ss_rsend..pp sp_rsend..pp ps_rsend..pp pp_rsend..pp log(#active_pes) log(#active_pes) Figure 15: rsend with probabilistic vs. regular activity Figure 1: rsend with singular and plural pointers è bytesè ss_rfetch..pp sp_rfetch..pp ps_rfetch..pp pp_rfetch..pp ss_rsend.3.pp sp_rsend.3.pp ps_rsend.3.pp pp_rsend.3.pp log(#active_pes) log(#active_pes) Figure 17: rfetch with singular and plural pointers è bytesè Figure 1: rsend with singular and plural pointers è3 bytesè..3 rsend vs. router statement Given the previous results, the comparison of rsend versus router statements èægure 1è yields no additional information. The results using diæerent activation patterns on rsend èægure 15è are consistent with the results from ægure 9 and singular vs. plural pointers In ægures 17 and 17 we ænd all four variants of the xx rsend as well as the xx rfetch command to perform at roughly 1è for -byte packets. When sending larger packets of 3 bytes, very surprising observations can be made èægure 1è: While ss rsend performs at about 115è, as seen before, the other variants are not above 1è on the MP-! For instance at 1 PEs active, sp rsend performs at about 9è, ps rsend at 1è, and pp rsend at 93è. For more than 1 PEs active, the measurements deviate very much, so that it is not possible to give a good estimation of performance, but it seems that the performance tends to be below 1è. I am not able to explain this eæect.

11 11 7 xnetesend.1 xnetesend. xnetesend. 7 xnetefetch. xnetesend. ss_xfetch. ss_xsend distance 1 Figure 19: xnet send Figure : xnet send vs. fetch 1 distance 7 ss_xfetch. ss_xfetch..y pp_xfetch. pp_xfetch..y distance Figure 1: xfetch in nonstandard direction 3 xnet communication For a simple xnet send operation we ænd in ægure 19 that for 1-byte packets the MP performs at 1è, for -byte packets at 15è, and for -byte packtets at about 11è Figure shows that both, ss xsend and ss xfetch perform at about 1è for -byte packets. A bit surprising èalthough only when judged in the light of the previous resultsè is the high performance for pp xfetch èægure 1è of 11è. For xfetch in non-straight directions, ægure 1 indicates a constant acceleration of about 1 ticks for the ss xfetch variant and 55 ticks pp xfetch, resulting in a performance of 19è for distance. For standard directions, we ænd 1è performance for the ss xsend and ss xfetch operations èægure è. The pp xsendèpp xfetch operations show a performance increase that consists of two parts: a constant acceleration of 1 and 5 ticks, respectively, plus a slightly faster communication per distance step. This results in relative performances of 175è and 1è for distance or 1è and 11è for distance èalso ægure è. A similar although much less drastic eæect occurs for the sp xxx and ps xxx variants of xsend and xfetch. The relative performance for these cases varies between 133è and 1è èægure 3è. For larger 3-byte packets, we get a performance of 11è from pp xfetch and 1è from pp xsend for

12 1 COMMUNICATION LIBRARY FUNCTIONS 7 ss_xfetch. ss_xsend. pp_xfetch. pp_xsend. 7 sp_xfetch. sp_xsend. ps_xfetch. ps_xsend distance Figure : ss xfetchèsend vs. pp xfetchèsend Figure 3: sp xfetchèsend vs. ps xfetchèsend distance 3 5 pp_xfetch. pp_xsend. pp_xfetch.3 pp_xsend distance Figure : pp xfetchèsend for small and large packets distance èægure è. Communication library functions.1 reduce The performance of the various reduce operations that were tested èægure 5è were 11è for reduce- Max, 133è for reducemaxd, 17è for reduceadd, and 1è for reduceaddd.. scan Scan operations èægure è are not faster on the MP- for bit integers. For -bit æoating point values there is a small acceleration, provided there are only a few segments, i.e. the computation part of the call is dominant. In this case è segmentsè the performance is 17è for scanmaxd and 11è for scanaddd. For æoating point scans on a large number of small segments è 1 è, performance drops to about 1è again.

13 .3 sendwith 13 7 reduceadd.p reducemax.p reduceaddd.p reducemaxd.p 3 scanadd.p scanmax.p scanaddd.p scanmaxd.p log(#active_pes) Figure 5: reduce Figure : scan log(#segments) sendwithadd.1r sendwithmax.1r sendwithaddd.1r sendwithmaxd.1r 11 sendwithadd.1r sendwithadd.r sendwithadd.rr sendwithadd.r log(#destinations) log(#destinations) Figure 7: sendwithadd vs. sendwithmax Figure : sendwithadd with diæerent PE activity.3 sendwith For the variants of the sendwith operation, the performance diæerences are not as dramatic as ægures 7 and may suggest, because these diagrams do not use as the lower end of the vertical axis. Nevertheless, the MP- performs at about 1è to 19è, regardless of the kind of sendwith operation performed and regardless of the number of destinations.. enumerate, selectone, selectfirst The performance for enumerate is about 13è, for selectone and for selectfirst 113è. actual diagrams are still boring, they are still not shown here. Since the.5 psort, rank For the rank and psort operations, as shown in ægure 3, we ænd roughly the following performance scores: rankd 19è, psortd 1è, rank 13è, and rankd 15è.

14 1 REFERENCES sendwithadd.1r sendwithadd.1c sendwithadd.1b 5 rank.p rankd.p psort.p psortd.p log(#destinations) log(#active_pes) Figure 9: sendwithadd with diæerent destination patterns Figure 3: rank and psort 5 Summary of Results Similar to the measurements made on the MP-1, the comparison of the same measurements for MP-1 and MP- yielded some results that were surprising. The most signiæcant of these is the fact that raw router communication can be slower on the MP- than it is on the MP-1. Looking at the big picture, the message that can be derived from the results in this report is the following: For realistic programs, one can usually expect a relative performance of between 1è and 1è from the communication operations, provided they are fed from and deliver to memory. This value is better than one would expect at ærst when looking at the technical speciæcations alone and stems mostly from the almost-twice-as-high memory bandwith of the MP-. Other observations to be made from the measurements are: 1. Router fetch is slightly cheaper than send on the MP-1. This diæerence is noticeably bigger on the MP-.. Router send is slower on the MP- than on the MP-1 for small packets è9è relative performance for -byte packetsè, but faster for large packets è115è relative performance for 3-byte packetsè. Even for 3-byte packets, relative performance mysteriously drops below 1è when indirect addressing èvia a plural pointerè is used. 3. Xnet communication was not slower on the MP- than on the MP-1 for any of the measurements used in this report, despite the fact that the technical speciæcations published by MasPar announced reduced bandwith of the xnet on the MP-.. The constant cost of an xfetch or xsend operation is signiæcantly lower on an MP-. This can result in a performance above 15è for small distances. 5. All complex communication functions from the MPL library are faster on the MP- than on the MP-1. For some cases this advantage is only in the per mille range èe.g. scan with very many segmentsè, for others it is almost factor èe.g. reduceaddd: 1èè. References ëpre93ë Lutz Prechelt. Measurements of MasPar MP-11A communication operations. Technical Report 1è93, Institut fíur Programmstrukturen und Datenorganisation, Universitíat Karlsruhe, D-75 Karlsruhe, Germany, January 1993.

Modular Arithmetic. is just the set of remainders we can get when we divide integers by n

Modular Arithmetic. is just the set of remainders we can get when we divide integers by n 20181004 Modular Arithmetic We are accustomed to performing arithmetic on infinite sets of numbers. But sometimes we need to perform arithmetic on a finite set, and we need it to make sense and be consistent

More information

Encoding Time in seconds. Encoding Time in seconds. PSNR in DB. Encoding Time for Mandrill Image. Encoding Time for Lena Image 70. Variance Partition

Encoding Time in seconds. Encoding Time in seconds. PSNR in DB. Encoding Time for Mandrill Image. Encoding Time for Lena Image 70. Variance Partition Fractal Image Compression Project Report Viswanath Sankaranarayanan 4 th December, 1998 Abstract The demand for images, video sequences and computer animations has increased drastically over the years.

More information

In THEORETICAL COMPUTER SCIENCE, Copyright Elsevier

In THEORETICAL COMPUTER SCIENCE, Copyright Elsevier In THEORETICAL COMPUTER SCIENCE, 1996. Copyright Elsevier Eæcient Massively Parallel Implementation of Some Combinatorial Algorithms 1 Tsan-sheng Hsu 2 Institute of Information Science, Academia Sinica,

More information

formulation Model Real world data interpretation results Explanations

formulation Model Real world data interpretation results Explanations Mathematical Modeling Lecture Notes David C. Dobson January 7, 2003 1 Mathematical Modeling 2 1 Introduction to modeling Roughly deæned, mathematical modeling is the process of constructing mathematical

More information

BWM CRM, PRM CRM, WB, PRM BRM, WB CWM, CWH, PWM. Exclusive (read/write) CWM PWM

BWM CRM, PRM CRM, WB, PRM BRM, WB CWM, CWH, PWM. Exclusive (read/write) CWM PWM University of California, Berkeley College of Engineering Computer Science Division EECS Spring 1998 D.A. Patterson Quiz 2 April 22, 1998 CS252 Graduate Computer Architecture You are allowed to use a calculator

More information

University of Texas at Austin. Austin, TX Nathaniel Dean. Combinatorics and Optimization Research. Bell Communications Research

University of Texas at Austin. Austin, TX Nathaniel Dean. Combinatorics and Optimization Research. Bell Communications Research Implementation of Parallel Graph Algorithms on a Massively Parallel SIMD Computer with Virtual Processing Tsan-sheng Hsu æy & Vijaya Ramachandran æ Department of Computer Sciences University of Texas at

More information

19.2 View Serializability. Recall our discussion in Section?? of how our true goal in the design of a

19.2 View Serializability. Recall our discussion in Section?? of how our true goal in the design of a 1 19.2 View Serializability Recall our discussion in Section?? of how our true goal in the design of a scheduler is to allow only schedules that are serializable. We also saw how differences in what operations

More information

Performance of Circuit Switched LANs. Pittsburgh, PA Pittsburgh, PA data transfers, assuming all N sources and all N destinations

Performance of Circuit Switched LANs. Pittsburgh, PA Pittsburgh, PA data transfers, assuming all N sources and all N destinations Performance of Circuit Switched LANs under Diæerent Traæc Conditions Qingming Ma Peter Steenkiste School of Computer Science School of Computer Science Carnegie Mellon University Carnegie Mellon University

More information

File Size Distribution on UNIX Systems Then and Now

File Size Distribution on UNIX Systems Then and Now File Size Distribution on UNIX Systems Then and Now Andrew S. Tanenbaum, Jorrit N. Herder*, Herbert Bos Dept. of Computer Science Vrije Universiteit Amsterdam, The Netherlands {ast@cs.vu.nl, jnherder@cs.vu.nl,

More information

Instruction Set Principles and Examples. Appendix B

Instruction Set Principles and Examples. Appendix B Instruction Set Principles and Examples Appendix B Outline What is Instruction Set Architecture? Classifying ISA Elements of ISA Programming Registers Type and Size of Operands Addressing Modes Types of

More information

Two hours. Question ONE is COMPULSORY UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 25th January 2013 Time: 14:00-16:00

Two hours. Question ONE is COMPULSORY UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 25th January 2013 Time: 14:00-16:00 Two hours Question ONE is COMPULSORY UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE Operating Systems Date: Friday 25th January 2013 Time: 14:00-16:00 Please answer Question ONE and any TWO other

More information

Real instruction set architectures. Part 2: a representative sample

Real instruction set architectures. Part 2: a representative sample Real instruction set architectures Part 2: a representative sample Some historical architectures VAX: Digital s line of midsize computers, dominant in academia in the 70s and 80s Characteristics: Variable-length

More information

6. Results. This section describes the performance that was achieved using the RAMA file system.

6. Results. This section describes the performance that was achieved using the RAMA file system. 6. Results This section describes the performance that was achieved using the RAMA file system. The resulting numbers represent actual file data bytes transferred to/from server disks per second, excluding

More information

CS162 Operating Systems and Systems Programming Lecture 14. Caching (Finished), Demand Paging

CS162 Operating Systems and Systems Programming Lecture 14. Caching (Finished), Demand Paging CS162 Operating Systems and Systems Programming Lecture 14 Caching (Finished), Demand Paging October 11 th, 2017 Neeraja J. Yadwadkar http://cs162.eecs.berkeley.edu Recall: Caching Concept Cache: a repository

More information

BWM CRM, PRM CRM, WB, PRM BRM, WB CWM, CWH, PWM. Exclusive (read/write) CWM PWM

BWM CRM, PRM CRM, WB, PRM BRM, WB CWM, CWH, PWM. Exclusive (read/write) CWM PWM University of California, Berkeley College of Engineering Computer Science Division EECS Spring 998 D.A. Patterson Quiz 2 Solutions CS252 Graduate Computer Architecture Question : Bigger, Better, Faster?

More information

insertion wcet insertion 99.9 insertion avgt heap wcet heap 99.9 heap avgt 200 execution time number of elements

insertion wcet insertion 99.9 insertion avgt heap wcet heap 99.9 heap avgt 200 execution time number of elements Time-Constrained Sorting A Comparison of Diæerent Algorithms P. Puschner Technische Universitíat Wien, Austria peter@vmars.tuwien.ac.at A. Burns University of York, UK burns@minster.york.ac.uk Abstract:

More information

CS 134 Midterm Fall 2006

CS 134 Midterm Fall 2006 CS 34 Midterm Fall 26 This is a closed book exam. You have 5 minutes to complete the exam. There are 5 questions on this examination. The point values for the questions are shown in the table below. Your

More information

Understand the factors involved in instruction set

Understand the factors involved in instruction set A Closer Look at Instruction Set Architectures Objectives Understand the factors involved in instruction set architecture design. Look at different instruction formats, operand types, and memory access

More information

A,B,C,D 1 E,F,G H,I,J 3 B 5 6 K,L 4 M,N,O

A,B,C,D 1 E,F,G H,I,J 3 B 5 6 K,L 4 M,N,O HYCORE: A Hybrid Static-Dynamic Technique to Reduce Communication in Parallel Systems via Scheduling and Re-routing æ David R. Surma Edwin H.-M. Sha Peter M. Kogge Department of Computer Science and Engineering

More information

Characteristics of Memory Location wrt Motherboard. CSCI 4717 Computer Architecture. Characteristics of Memory Capacity Addressable Units

Characteristics of Memory Location wrt Motherboard. CSCI 4717 Computer Architecture. Characteristics of Memory Capacity Addressable Units CSCI 4717/5717 Computer Architecture Topic: Cache Memory Reading: Stallings, Chapter 4 Characteristics of Memory Location wrt Motherboard Inside CPU temporary memory or registers Motherboard main memory

More information

Exploring Performance Tradeoffs in a Sudoku SAT Solver CS242 Project Report

Exploring Performance Tradeoffs in a Sudoku SAT Solver CS242 Project Report Exploring Performance Tradeoffs in a Sudoku SAT Solver CS242 Project Report Hana Lee (leehana@stanford.edu) December 15, 2017 1 Summary I implemented a SAT solver capable of solving Sudoku puzzles using

More information

University of Maryland. fkochut, agrawala, CS-TR-4265 UMIACS-TR October 26, 2001

University of Maryland. fkochut, agrawala, CS-TR-4265 UMIACS-TR October 26, 2001 ADT èattacker-defender-targetè Game æ Andrzej Kochut 1, Ashok K. Agrawala 1, Ronald L. Larsen 2, A. Udaya Shankar 1 1 Department of Computer Science University of Maryland College Park, Maryland 20742

More information

CMPSCI 646, Information Retrieval (Fall 2003)

CMPSCI 646, Information Retrieval (Fall 2003) CMPSCI 646, Information Retrieval (Fall 2003) Midterm exam solutions Problem CO (compression) 1. The problem of text classification can be described as follows. Given a set of classes, C = {C i }, where

More information

Lecture 2: Computer Performance. Assist.Prof.Dr. Gürhan Küçük Advanced Computer Architectures CSE 533

Lecture 2: Computer Performance. Assist.Prof.Dr. Gürhan Küçük Advanced Computer Architectures CSE 533 Lecture 2: Computer Performance Assist.Prof.Dr. Gürhan Küçük Advanced Computer Architectures CSE 533 Performance and Cost Purchasing perspective given a collection of machines, which has the - best performance?

More information

Chapter 5. A Closer Look at Instruction Set Architectures

Chapter 5. A Closer Look at Instruction Set Architectures Chapter 5 A Closer Look at Instruction Set Architectures Chapter 5 Objectives Understand the factors involved in instruction set architecture design. Gain familiarity with memory addressing modes. Understand

More information

Lecture 8: RISC & Parallel Computers. Parallel computers

Lecture 8: RISC & Parallel Computers. Parallel computers Lecture 8: RISC & Parallel Computers RISC vs CISC computers Parallel computers Final remarks Zebo Peng, IDA, LiTH 1 Introduction Reduced Instruction Set Computer (RISC) is an important innovation in computer

More information

Section 4 General Factorial Tutorials

Section 4 General Factorial Tutorials Section 4 General Factorial Tutorials General Factorial Part One: Categorical Introduction Design-Ease software version 6 offers a General Factorial option on the Factorial tab. If you completed the One

More information

Worksheet - Storing Data

Worksheet - Storing Data Unit 1 Lesson 12 Name(s) Period Date Worksheet - Storing Data At the smallest scale in the computer, information is stored as bits and bytes. In this section, we'll look at how that works. Bit Bit, like

More information

Fourier Transforms and Signal Analysis

Fourier Transforms and Signal Analysis Fourier Transforms and Signal Analysis The Fourier transform analysis is one of the most useful ever developed in Physical and Analytical chemistry. Everyone knows that FTIR is based on it, but did one

More information

Functional Units of a Modern Computer

Functional Units of a Modern Computer Functional Units of a Modern Computer We begin this lecture by repeating a figure from a previous lecture. Logically speaking a computer has four components. Connecting the Components Early schemes for

More information

TECHNICAL RESEARCH REPORT

TECHNICAL RESEARCH REPORT TECHNICAL RESEARCH REPORT A Simulation Study of Enhanced TCP/IP Gateways for Broadband Internet over Satellite by Manish Karir, Mingyan Liu, Bradley Barrett, John S. Baras CSHCN T.R. 99-34 (ISR T.R. 99-66)

More information

æ When a query is presented to the system, it is useful to ænd an eæcient method of ænding the answer,

æ When a query is presented to the system, it is useful to ænd an eæcient method of ænding the answer, CMPT-354-98.2 Lecture Notes July 26, 1998 Chapter 12 Query Processing 12.1 Query Interpretation 1. Why dowe need to optimize? æ A high-level relational query is generally non-procedural in nature. æ It

More information

Vector and Parallel Processors. Amdahl's Law

Vector and Parallel Processors. Amdahl's Law Vector and Parallel Processors. Vector processors are processors which have special hardware for performing operations on vectors: generally, this takes the form of a deep pipeline specialized for this

More information

High Performance Computer Architecture Prof. Ajit Pal Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

High Performance Computer Architecture Prof. Ajit Pal Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur High Performance Computer Architecture Prof. Ajit Pal Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 18 Dynamic Instruction Scheduling with Branch Prediction

More information

Chapter 3 - Memory Management

Chapter 3 - Memory Management Chapter 3 - Memory Management Luis Tarrataca luis.tarrataca@gmail.com CEFET-RJ L. Tarrataca Chapter 3 - Memory Management 1 / 222 1 A Memory Abstraction: Address Spaces The Notion of an Address Space Swapping

More information

Compiler Design Prof. Y. N. Srikant Department of Computer Science and Automation Indian Institute of Science, Bangalore

Compiler Design Prof. Y. N. Srikant Department of Computer Science and Automation Indian Institute of Science, Bangalore Compiler Design Prof. Y. N. Srikant Department of Computer Science and Automation Indian Institute of Science, Bangalore Module No. # 10 Lecture No. # 16 Machine-Independent Optimizations Welcome to the

More information

Embedded Systems Design Prof. Anupam Basu Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Embedded Systems Design Prof. Anupam Basu Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Embedded Systems Design Prof. Anupam Basu Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 05 Optimization Issues Now I see, that is not been seen there;

More information

Renault Nissan Placement Paper Part-1

Renault Nissan Placement Paper Part-1 Renault and Nissan interview process Selection process consisted of three rounds 1.Written test 2.Technical interview 3.HR interview Written test had 50 aptitude questions to be solved in 1 hour. Questions

More information

Lecture 4: RISC Computers

Lecture 4: RISC Computers Lecture 4: RISC Computers Introduction Program execution features RISC characteristics RISC vs. CICS Zebo Peng, IDA, LiTH 1 Introduction Reduced Instruction Set Computer (RISC) represents an important

More information

More advanced CPUs. August 4, Howard Huang 1

More advanced CPUs. August 4, Howard Huang 1 More advanced CPUs In the last two weeks we presented the design of a basic processor. The datapath performs operations on register and memory data. A control unit translates program instructions into

More information

CS510 Operating System Foundations. Jonathan Walpole

CS510 Operating System Foundations. Jonathan Walpole CS510 Operating System Foundations Jonathan Walpole Disk Technology & Secondary Storage Management Disk Geometry Disk head, surfaces, tracks, sectors Example Disk Characteristics Disk Surface Geometry

More information

EECS 428 Final Project Report Distributed Real-Time Process Control Over TCP and the Internet Brian Robinson

EECS 428 Final Project Report Distributed Real-Time Process Control Over TCP and the Internet Brian Robinson EECS 428 Final Project Report Distributed Real-Time Process Control Over TCP and the Internet Brian Robinson 1.0 Introduction Distributed real-time process control, from a network communication view, involves

More information

Lecture - 36 Effect on Higher Layer I

Lecture - 36 Effect on Higher Layer I Satellite Communication Systems Prof. Kalyan Kumar Bandyopadhyay Department of Electronics and Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture - 36 Effect on Higher

More information

CSC 2515 Introduction to Machine Learning Assignment 2

CSC 2515 Introduction to Machine Learning Assignment 2 CSC 2515 Introduction to Machine Learning Assignment 2 Zhongtian Qiu(1002274530) Problem 1 See attached scan files for question 1. 2. Neural Network 2.1 Examine the statistics and plots of training error

More information

Tracy D. Braun, Anthony A. Maciejewski, and Howard Jay Siegel. Purdue University. ftdbraun, maciejew,

Tracy D. Braun, Anthony A. Maciejewski, and Howard Jay Siegel. Purdue University. ftdbraun, maciejew, A Parallel Algorithm for Singular Value Decomposition as Applied to Failure Tolerant Manipulators Tracy D. Braun, Anthony A. Maciejewski, and Howard Jay Siegel Parallel Processing Laboratory School of

More information

3. G. G. Lemieux and S. D. Brown, ëa detailed router for allocating wire segments

3. G. G. Lemieux and S. D. Brown, ëa detailed router for allocating wire segments . Xilinx, Inc., The Programmable Logic Data Book, 99.. G. G. Lemieux and S. D. Brown, ëa detailed router for allocating wire segments in æeld-programmable gate arrays," in Proceedings of the ACM Physical

More information

Equities and Fixed Income. Introduction Manual

Equities and Fixed Income. Introduction Manual Finance Data Thomson Reuters Eikon Equities and Fixed Income Introduction Manual March 2017 Contents 1. Introduction... 3 1.1 When do I use Eikon?... 3 1.2 Request access for Eikon... 3 1.3 Where can I

More information

Advanced FPGA Design Methodologies with Xilinx Vivado

Advanced FPGA Design Methodologies with Xilinx Vivado Advanced FPGA Design Methodologies with Xilinx Vivado Alexander Jäger Computer Architecture Group Heidelberg University, Germany Abstract With shrinking feature sizes in the ASIC manufacturing technology,

More information

Rui Wang, Assistant professor Dept. of Information and Communication Tongji University.

Rui Wang, Assistant professor Dept. of Information and Communication Tongji University. Instructions: ti Language of the Computer Rui Wang, Assistant professor Dept. of Information and Communication Tongji University it Email: ruiwang@tongji.edu.cn Computer Hierarchy Levels Language understood

More information

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: MIPS Instruction Set Architecture

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: MIPS Instruction Set Architecture Computer Science 324 Computer Architecture Mount Holyoke College Fall 2007 Topic Notes: MIPS Instruction Set Architecture vonneumann Architecture Modern computers use the vonneumann architecture. Idea:

More information

Lecture #3: PageRank Algorithm The Mathematics of Google Search

Lecture #3: PageRank Algorithm The Mathematics of Google Search Lecture #3: PageRank Algorithm The Mathematics of Google Search We live in a computer era. Internet is part of our everyday lives and information is only a click away. Just open your favorite search engine,

More information

Architecturally Visible Storage Two types used: registers and memory. Registers èinternal Storageè Store what is actively being worked on. E

Architecturally Visible Storage Two types used: registers and memory. Registers èinternal Storageè Store what is actively being worked on. E 03-1 03-1 Addressing Modes and Instruction Set Design To be covered: æ Architecturally visible storage. æ ISA classiæcation based on register organization. æ Addressing modes. æ Impact on ISA. 03-1 EE

More information

(Refer Slide Time: 00:26)

(Refer Slide Time: 00:26) Programming, Data Structures and Algorithms Prof. Shankar Balachandran Department of Computer Science and Engineering Indian Institute Technology, Madras Module 07 Lecture 07 Contents Repetitive statements

More information

High-Performance Computing

High-Performance Computing Informatik und Angewandte Kognitionswissenschaft Lehrstuhl für Hochleistungsrechnen Rainer Schlönvoigt Thomas Fogal Prof. Dr. Jens Krüger High-Performance Computing http://hpc.uni-duisburg-essen.de/teaching/wt2013/pp-nbody.html

More information

Chapter 2: Memory Hierarchy Design Part 2

Chapter 2: Memory Hierarchy Design Part 2 Chapter 2: Memory Hierarchy Design Part 2 Introduction (Section 2.1, Appendix B) Caches Review of basics (Section 2.1, Appendix B) Advanced methods (Section 2.3) Main Memory Virtual Memory Fundamental

More information

Computer Architecture Review. ICS332 - Spring 2016 Operating Systems

Computer Architecture Review. ICS332 - Spring 2016 Operating Systems Computer Architecture Review ICS332 - Spring 2016 Operating Systems ENIAC (1946) Electronic Numerical Integrator and Calculator Stored-Program Computer (instead of Fixed-Program) Vacuum tubes, punch cards

More information

CS162 Operating Systems and Systems Programming Lecture 14. Caching and Demand Paging

CS162 Operating Systems and Systems Programming Lecture 14. Caching and Demand Paging CS162 Operating Systems and Systems Programming Lecture 14 Caching and Demand Paging October 17, 2007 Prof. John Kubiatowicz http://inst.eecs.berkeley.edu/~cs162 Review: Hierarchy of a Modern Computer

More information

Lecture 3 Machine Language. Instructions: Instruction Execution cycle. Speaking computer before voice recognition interfaces

Lecture 3 Machine Language. Instructions: Instruction Execution cycle. Speaking computer before voice recognition interfaces Lecture 3 Machine Language Speaking computer before voice recognition interfaces 1 Instructions: Language of the Machine More primitive than higher level languages e.g., no sophisticated control flow Very

More information

On-Line Applications Research Corporation TEXinfo COPYRIGHT cæ On-Line Applications Research Corporation èoarè. The authors have us

On-Line Applications Research Corporation TEXinfo COPYRIGHT cæ On-Line Applications Research Corporation èoarè. The authors have us RTEMS Development Environment Guide Edition 4.0.0, for RTEMS 4.0.0 October 1998 On-Line Applications Research Corporation On-Line Applications Research Corporation TEXinfo 1.1.1.1 COPYRIGHT cæ 1988-1998.

More information

378: Machine Organization and Assembly Language

378: Machine Organization and Assembly Language 378: Machine Organization and Assembly Language Spring 2010 Luis Ceze Slides adapted from: UIUC, Luis Ceze, Larry Snyder, Hal Perkins 1 What is computer architecture about? Computer architecture is the

More information

Load1 no Load2 no Add1 Y Sub Reg[F2] Reg[F6] Add2 Y Add Reg[F2] Add1 Add3 no Mult1 Y Mul Reg[F2] Reg[F4] Mult2 Y Div Reg[F6] Mult1

Load1 no Load2 no Add1 Y Sub Reg[F2] Reg[F6] Add2 Y Add Reg[F2] Add1 Add3 no Mult1 Y Mul Reg[F2] Reg[F4] Mult2 Y Div Reg[F6] Mult1 Instruction Issue Execute Write result L.D F6, 34(R2) L.D F2, 45(R3) MUL.D F0, F2, F4 SUB.D F8, F2, F6 DIV.D F10, F0, F6 ADD.D F6, F8, F2 Name Busy Op Vj Vk Qj Qk A Load1 no Load2 no Add1 Y Sub Reg[F2]

More information

Recursive-Fib(n) if n=1 or n=2 then return 1 else return Recursive-Fib(n-1)+Recursive-Fib(n-2)

Recursive-Fib(n) if n=1 or n=2 then return 1 else return Recursive-Fib(n-1)+Recursive-Fib(n-2) Dynamic Programming Any recursive formula can be directly translated into recursive algorithms. However, sometimes the compiler will not implement the recursive algorithm very efficiently. When this is

More information

PARAMETER OPTIMIZATION FOR AUTOMATED SIGNAL ANALYSIS FOR CONDITION MONITORING OF AIRCRAFT SYSTEMS. Mike Gerdes 1, Dieter Scholz 1

PARAMETER OPTIMIZATION FOR AUTOMATED SIGNAL ANALYSIS FOR CONDITION MONITORING OF AIRCRAFT SYSTEMS. Mike Gerdes 1, Dieter Scholz 1 AST 2011 Workshop on Aviation System Technology PARAMETER OPTIMIZATION FOR AUTOMATED SIGNAL ANALYSIS FOR CONDITION MONITORING OF AIRCRAFT SYSTEMS Mike Gerdes 1, Dieter Scholz 1 1 Aero - Aircraft Design

More information

Outline. L9: Project Discussion and Floating Point Issues. Project Parts (Total = 50%) Project Proposal (due 3/8) 2/13/12.

Outline. L9: Project Discussion and Floating Point Issues. Project Parts (Total = 50%) Project Proposal (due 3/8) 2/13/12. Outline L9: Project Discussion and Floating Point Issues Discussion of semester projects Floating point Mostly single precision until recent architectures Accuracy What s fast and what s not Reading: Ch

More information

JINI RMI JAVA JAVA UNIX TCP TCP Architectural structure: Runtime structure:

JINI RMI JAVA JAVA UNIX TCP TCP Architectural structure: Runtime structure: Carp@í Managing Dynamic Jini TM Systems æ Michael Fahrmair, Chris Salzmann, Maurice Schoenmakers Technische Universitíat Míunchen Institut fíur Informatik D-80290 Míunchen, Germany ffahrmairjsalzmannjschoenmag@in.tum.de

More information

Memory management. Last modified: Adaptation of Silberschatz, Galvin, Gagne slides for the textbook Applied Operating Systems Concepts

Memory management. Last modified: Adaptation of Silberschatz, Galvin, Gagne slides for the textbook Applied Operating Systems Concepts Memory management Last modified: 26.04.2016 1 Contents Background Logical and physical address spaces; address binding Overlaying, swapping Contiguous Memory Allocation Segmentation Paging Structure of

More information

LESSON 13: LANGUAGE TRANSLATION

LESSON 13: LANGUAGE TRANSLATION LESSON 13: LANGUAGE TRANSLATION Objective Interpreters and Compilers. Language Translation Phases. Interpreters and Compilers A COMPILER is a program that translates a complete source program into machine

More information

A faster way to downscale during JPEG decoding to a fourth

A faster way to downscale during JPEG decoding to a fourth A faster way to downscale during JPEG decoding to a fourth written by written by Stefan Kuhr 1 Introduction The algorithm that is employed in the JPEGLib for downscaling to a fourth during decoding uses

More information

Architectural Differences nc. DRAM devices are accessed with a multiplexed address scheme. Each unit of data is accessed by first selecting its row ad

Architectural Differences nc. DRAM devices are accessed with a multiplexed address scheme. Each unit of data is accessed by first selecting its row ad nc. Application Note AN1801 Rev. 0.2, 11/2003 Performance Differences between MPC8240 and the Tsi106 Host Bridge Top Changwatchai Roy Jenevein risc10@email.sps.mot.com CPD Applications This paper discusses

More information

Abstract. Reconægurable circuits and systems have evolved from application. But the algorithmic techniques and software tools are also heavily based

Abstract. Reconægurable circuits and systems have evolved from application. But the algorithmic techniques and software tools are also heavily based Mapping Loops onto Reconægurable Architectures? Kiran Bondalapati and Viktor K. Prasanna Department of Electrical Engineering Systems, EEB-200C University of Southern California Los Angeles, CA 90089-2562,

More information

Chapter 5. A Closer Look at Instruction Set Architectures. Chapter 5 Objectives. 5.1 Introduction. 5.2 Instruction Formats

Chapter 5. A Closer Look at Instruction Set Architectures. Chapter 5 Objectives. 5.1 Introduction. 5.2 Instruction Formats Chapter 5 Objectives Understand the factors involved in instruction set architecture design. Chapter 5 A Closer Look at Instruction Set Architectures Gain familiarity with memory addressing modes. Understand

More information

Approximations and Errors

Approximations and Errors The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 3 Approximations and Errors Associate Prof. Mazen Abualtayef Civil Engineering Department,

More information

SOCRATES WEB SCORES FAQ S

SOCRATES WEB SCORES FAQ S SOCRATES WEB SCORES FAQ S Contents 1. The patient hasn t received their email... 1 2. No ID, password or QR code... 2 3. The email address was yellow but isn t any more.... 2 4. How do I check that the

More information

Developments in harmonised scoring systems and data presentation 'The ABC of EQA

Developments in harmonised scoring systems and data presentation 'The ABC of EQA UK NEQAS UK NEQAS FOR CLINICAL CHEMISTRY UNITED KINGDOM NATIONAL EXTERNAL QUALITY ASSESSMENT SCHEMES Developments in harmonised scoring systems and data presentation 'The ABC of EQA Dr David G Bullock

More information

One motivation for developing axiomatic systems is to determine precisely which properties

One motivation for developing axiomatic systems is to determine precisely which properties 1 Axiomatic Systems 1.1 Features of Axiomatic Systems One motivation for developing axiomatic systems is to determine precisely which properties of certain objects can be deduced from which other properties.

More information

Here is the data collected.

Here is the data collected. Introduction to Scientific Analysis of Data Using Spreadsheets. Computer spreadsheets are very powerful tools that are widely used in Business, Science, and Engineering to perform calculations and record,

More information

Memory Hierarchies. Instructor: Dmitri A. Gusev. Fall Lecture 10, October 8, CS 502: Computers and Communications Technology

Memory Hierarchies. Instructor: Dmitri A. Gusev. Fall Lecture 10, October 8, CS 502: Computers and Communications Technology Memory Hierarchies Instructor: Dmitri A. Gusev Fall 2007 CS 502: Computers and Communications Technology Lecture 10, October 8, 2007 Memories SRAM: value is stored on a pair of inverting gates very fast

More information

Chapter 5. A Closer Look at Instruction Set Architectures

Chapter 5. A Closer Look at Instruction Set Architectures Chapter 5 A Closer Look at Instruction Set Architectures Chapter 5 Objectives Understand the factors involved in instruction set architecture design. Gain familiarity with memory addressing modes. Understand

More information

Cache Timing Analysis of LFSR-based Stream Ciphers

Cache Timing Analysis of LFSR-based Stream Ciphers Cache Timing Analysis of LFSR-based Stream Ciphers Gregor Leander, Erik Zenner and Philip Hawkes Technical University Denmark (DTU) Department of Mathematics e.zenner@mat.dtu.dk Cirencester, Dec. 17, 2009

More information

UNIT III BALANCED SEARCH TREES AND INDEXING

UNIT III BALANCED SEARCH TREES AND INDEXING UNIT III BALANCED SEARCH TREES AND INDEXING OBJECTIVE The implementation of hash tables is frequently called hashing. Hashing is a technique used for performing insertions, deletions and finds in constant

More information

ECE 471 Embedded Systems Lecture 2

ECE 471 Embedded Systems Lecture 2 ECE 471 Embedded Systems Lecture 2 Vince Weaver http://web.eece.maine.edu/~vweaver vincent.weaver@maine.edu 7 September 2018 Announcements Reminder: The class notes are posted to the website. HW#1 will

More information

Memory Hierarchy. Memory Flavors Principle of Locality Program Traces Memory Hierarchies Associativity. (Study Chapter 5)

Memory Hierarchy. Memory Flavors Principle of Locality Program Traces Memory Hierarchies Associativity. (Study Chapter 5) Memory Hierarchy Why are you dressed like that? Halloween was weeks ago! It makes me look faster, don t you think? Memory Flavors Principle of Locality Program Traces Memory Hierarchies Associativity (Study

More information

Question 1: Calculate Your Cache A certain system with a 350 MHz clock uses a separate data and instruction cache, and a uniæed second-level cache. Th

Question 1: Calculate Your Cache A certain system with a 350 MHz clock uses a separate data and instruction cache, and a uniæed second-level cache. Th University of California, Berkeley College of Engineering Computer Science Division EECS Spring 1998 D.A. Patterson Quiz 1 March 4, 1998 CS252 Graduate Computer Architecture You are allowed to use a calculator

More information

Instructions: MIPS arithmetic. MIPS arithmetic. Chapter 3 : MIPS Downloaded from:

Instructions: MIPS arithmetic. MIPS arithmetic. Chapter 3 : MIPS Downloaded from: Instructions: Chapter 3 : MIPS Downloaded from: http://www.cs.umr.edu/~bsiever/cs234/ Language of the Machine More primitive than higher level languages e.g., no sophisticated control flow Very restrictive

More information

Topic Notes: MIPS Instruction Set Architecture

Topic Notes: MIPS Instruction Set Architecture Computer Science 220 Assembly Language & Comp. Architecture Siena College Fall 2011 Topic Notes: MIPS Instruction Set Architecture vonneumann Architecture Modern computers use the vonneumann architecture.

More information

Chapter 12. CPU Structure and Function. Yonsei University

Chapter 12. CPU Structure and Function. Yonsei University Chapter 12 CPU Structure and Function Contents Processor organization Register organization Instruction cycle Instruction pipelining The Pentium processor The PowerPC processor 12-2 CPU Structures Processor

More information

Cascading versus Indexed Menu Design

Cascading versus Indexed Menu Design February 2003, Vol. 5 Issue 1 Volume 5 Issue 1 Past Issues A-Z List Usability News is a free web newsletter that is produced by the Software Usability Research Laboratory (SURL) at Wichita State University.

More information

Parallel Computing Prof. Subodh Kumar Department of Computer Science & Engineering Indian Institute of Technology Delhi

Parallel Computing Prof. Subodh Kumar Department of Computer Science & Engineering Indian Institute of Technology Delhi Parallel Computing Prof. Subodh Kumar Department of Computer Science & Engineering Indian Institute of Technology Delhi Module No # 01 Lecture No # 02 Parallel Programming Paradigms (Refer Slide Time:

More information

Stored Program Concept. Instructions: Characteristics of Instruction Set. Architecture Specification. Example of multiple operands

Stored Program Concept. Instructions: Characteristics of Instruction Set. Architecture Specification. Example of multiple operands Stored Program Concept Instructions: Instructions are bits Programs are stored in memory to be read or written just like data Processor Memory memory for data, programs, compilers, editors, etc. Fetch

More information

Instruction Set Design

Instruction Set Design Instruction Set Design software instruction set hardware CPE442 Lec 3 ISA.1 Instruction Set Architecture Programmer's View ADD SUBTRACT AND OR COMPARE... 01010 01110 10011 10001 11010... CPU Memory I/O

More information

Contents. Slide Set 1. About these slides. Outline of Slide Set 1. Typographical conventions: Italics. Typographical conventions. About these slides

Contents. Slide Set 1. About these slides. Outline of Slide Set 1. Typographical conventions: Italics. Typographical conventions. About these slides Slide Set 1 for ENCM 369 Winter 2014 Lecture Section 01 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Winter Term, 2014 ENCM 369 W14 Section

More information

Analog, Digital Signals; Computer Structure

Analog, Digital Signals; Computer Structure Analog, Digital Signals; Computer Structure David M. Auslander Mechanical Engineering University of California at Berkeley Copyright 2007, D.M.Auslander Signal Impedance Relationship of current and voltage

More information

Building a safe and secure embedded world. Testing State Machines. and Other Test Objects Maintaining a State. > TESSY Tutorial Author: Frank Büchner

Building a safe and secure embedded world. Testing State Machines. and Other Test Objects Maintaining a State. > TESSY Tutorial Author: Frank Büchner Building a safe and secure embedded world Testing State Machines and Other Test Objects Maintaining a State > TESSY Tutorial Author: Frank Büchner Topic: TESSY is especially well-suited for testing state

More information

Memory Management. Reading: Silberschatz chapter 9 Reading: Stallings. chapter 7 EEL 358

Memory Management. Reading: Silberschatz chapter 9 Reading: Stallings. chapter 7 EEL 358 Memory Management Reading: Silberschatz chapter 9 Reading: Stallings chapter 7 1 Outline Background Issues in Memory Management Logical Vs Physical address, MMU Dynamic Loading Memory Partitioning Placement

More information

The Encoding Complexity of Network Coding

The Encoding Complexity of Network Coding The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network

More information

July 19, Abstract. they may execute over a network of heterogeneous machines. This paper presents some performance

July 19, Abstract. they may execute over a network of heterogeneous machines. This paper presents some performance The Performance of PVM on MPP Systems Henri Casanova æ Jack Dongarra? y Weicheng Jiang? July 19, 1995 Abstract PVM èparallel Virtual Machineè is a popular standard for writing parallel programs so that

More information

Multiprocessing and Scalability. A.R. Hurson Computer Science and Engineering The Pennsylvania State University

Multiprocessing and Scalability. A.R. Hurson Computer Science and Engineering The Pennsylvania State University A.R. Hurson Computer Science and Engineering The Pennsylvania State University 1 Large-scale multiprocessor systems have long held the promise of substantially higher performance than traditional uniprocessor

More information

The ray tracing software package implements an object-oriented approach to

The ray tracing software package implements an object-oriented approach to Chapter 1 RayTracing 1.1 Using the ray tracer package The ray tracing software package implements an object-oriented approach to rendering and ray tracing. The object oriented design includes base classes

More information

und Formale Beschreibungsverfahren D Karlsruhe, Germany fbranke, July 1996 Abstract

und Formale Beschreibungsverfahren D Karlsruhe, Germany   fbranke, July 1996 Abstract Searching for Shortest Common Supersequences by Means of a Heuristic-Based Genetic Algorithm Jíurgen Branke, Martin Middendorf University of Karlsruhe Institut fíur Angewandte Informatik und Formale Beschreibungsverfahren

More information

QUIZ. What is wrong with this code that uses default arguments?

QUIZ. What is wrong with this code that uses default arguments? QUIZ What is wrong with this code that uses default arguments? Solution The value of the default argument should be placed in either declaration or definition, not both! QUIZ What is wrong with this code

More information