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

Functionality of hypethread processor, Hyper-threading works by duplicating...

Hyper-threading works by duplicating those parts of processor which store architectural state but not duplicating main execution resources. This permits a Hyper-threading equipped

Demostrate the example of spreadsheet, Now consider the following spreadshe...

Now consider the following spreadsheet: Formula in cell D2 is = (B2/C2) Replicating this formula (by highlighting then drag down to D7) gives all the formulas needed in cell

Data structures.., in asingle function declaration what is maximum no of st...

in asingle function declaration what is maximum no of statements that may be recursive calls

What is a binary tree, What is a binary tree? A binary tree 'T' is desc...

What is a binary tree? A binary tree 'T' is described as A finite set of elements, known as nodes, such that: either (i) or (ii) happens: (i) T is empty (known as the 'nu

Switch statement with the use of nested if-else statement, Compare the use ...

Compare the use of switch statement with the use of nested if-else statement. If-else statement:  When there are many conditional statements that may all evaluate to true, bu

Dbms, write er diagram for company database

write er diagram for company database

Illustrate the accumulator architecture, Accumulator Architecture: An accu...

Accumulator Architecture: An accumulator is anespecially designated register which supplies one instruction operand and receives result. Instructions in such machines are usually

Types of bus - computer architecture, Types of Bus: Synchronous Bus ...

Types of Bus: Synchronous Bus All devices gain timing information from a common clock line. Each of these intervals constitutes a bus cycle at the time duration w

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