Performance evaluation-parallel computing, Computer Engineering

Assignment Help:

Performance Evaluation

In this part, we talk about the primary attributes used to measure the performance of a computer system. Unit 2 of block 3 is totally devoted to performance assessment of parallel computer systems. The performance attributes are:

i)  Cycle time (T): It is the part of time for all the operations of a computer system. It is the opposite of clock rate (l/f). The cycle time is represented in n sec.

ii) Cycles Per Instruction (CPI): dissimilar instructions takes different number of cycles for implementation. CPI is dimension of number of cycles per instruction

iii) Instruction count(Ic): No. of instruction in a program is called instruction count.

If we presume that all instructions have same count of cycles, then the total execution

Time of a program = number of cycle required by one instruction*number of instruction in the program*time of one cycle.

Hence, the execution time

                                                 T=Ic*CPI*Tsec.

Basically the clock frequency of the process is specified in MHz. Also, the processor speed is calculated in terms of million instructions per sec (MIPS).

 


Related Discussions:- Performance evaluation-parallel computing

A full binary tree with ''n'' non-leaf nodes, A full binary tree with 'n' n...

A full binary tree with 'n' non-leaf nodes have  2n+l nodes.

Electric typewriter in information distribution, Electric typewriter : Ele...

Electric typewriter : Electric typewriters are similar to standard typewriters but with an electronic motor taking the place of human energy. It is much faster than the standard m

Describe the micro programmed control unit in detail, Describe the micro pr...

Describe the micro programmed control unit in detail. A micro programmed control unit is built around a storage unit is known as a control store where all the control signals a

Define rules for reducing karnaugh maps, Define Rules for Reducing Karnaugh...

Define Rules for Reducing Karnaugh Maps? The rules for reducing Karnaugh Maps (k- maps) are as follows: All of the 1's in the Karnaugh Map are called as minterms. The

Translation table encryption technique to secure transaction, Discuss about...

Discuss about Translation table encryption technique to ensure secured transactions onto the net? Translation table: In this process each chunk of data is used like an of

Applications of linked list, What are the Applications of Linked List are ...

What are the Applications of Linked List are a) Fixed block storage allocation b) garbage collection

States briefly the generic framework for e-commerce, States briefly the gen...

States briefly the generic framework for e-commerce. Generic framework of e-commerce comprises the Applications of e-commerce (as like banking, shopping within online stores an

Illustrate diffrent types of modems, Q. Illustrate Diffrent types of modems...

Q. Illustrate Diffrent types of modems? There are four different types of modems: half-duplex, full-duplex, synchronous, and asynchronous.With half-duplex modems data can be tr

Explain differences between folded and non-folded network, Explain differen...

Explain differences between folded and non-folded network. Folded network: While all the inlets/outlets are connected to the subscriber lines, the logical connection shows as

Xml can play when dynamically generating html pages , Explain the role that...

Explain the role that XML can play when dynamically generating HTML pages from a relational database? Ans) Even if student has never participated in a project involving this typ

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd