Explain performance evaluation in parallel computing, Computer Engineering

Assignment Help:

Explain Performance Evaluation in parallel Computing

In this section, we will discuss the key attributes used to measure performance of a computer system. The performance characteristics are:

i)  Cycle time (T): It's the unit of time for all operations of a computer system. It is the inverse of clock rate (l/f). The cycle time is signified in n sec. 

ii) Cycles per Instruction (CPI): Different instructions receive different number of cycles for execution. Cycles per Instruction (CPI) is measurement of number of cycles per instruction

iii) Instruction count(IC): Number of total instructions in a program is known as instruction count.

If we presume that all instructions have equal number of cycles, then total execution time of a program would be

                                              = Number of instruction in program * Number of cycle required by one instruction * Time of one cycle.

Hence, execution time would be T=IC*CPI*Tsec.

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

 


Related Discussions:- Explain performance evaluation in parallel computing

How address resolution is performed with table lookup, How address resoluti...

How address resolution is performed with table lookup? Explain with the help of a suitable example. The approach of table lookup to address resolution needs a data structure wh

What are the advantages of public key cryptography, What are the advantages...

What are the advantages of Public Key Cryptography? Advantages of Public Key Cryptography are illustrated in below: a) Increased convenience and security and b) Electro

Explain the working of a 3-bit D/A converter, With the help of R-2R binary ...

With the help of R-2R binary network, explain the working of a 3-bit D/A converter and derive an expression for the output voltage. Ans: We see a 3-bit R-2R ladder D/A netwo

Simplified boolean expression, Simplified the Boolean Algebra (x + y)(x + z...

Simplified the Boolean Algebra (x + y)(x + z) simplifies to ? Ans. x + yz as simplified the Boolean Algebra expression. [(x + y) (x + z)] = xx + xz + xy + yz = x + xz + xy + y

Explain macro definition and call, Explain Macro definition and call. ...

Explain Macro definition and call. Macro: The assembly language programming frequently finds this necessary to repeat certain piece of code several times during the course of

What is reification, What is reification? It is the promotion of someth...

What is reification? It is the promotion of something that is not an object into an object. Helpful method for Meta applications. It shifts the level of abstraction. Promote

What is event-driven control, What is event-driven control? Control res...

What is event-driven control? Control resides within a dispatcher or monitors that language, subsystem or OS provider. Developers attach application process to events and dispa

Why schottky transistors preferred over other transistors , In digital ICs,...

In digital ICs, Schottky transistors are preferred over normal transistors because of their ? Ans. Lower  propagation  delay  in digital ICs, as  shottky  transistors  reduce

Explain about distributed shared memory systems, Explain about Distributed ...

Explain about Distributed Shared Memory Systems? Distributed Shared Memory (DSM) systems emulate a shared memory abstraction on loosely coupled architectures in order to allow

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