Efficiency - metrics for performance evaluation, Computer Engineering

Assignment Help:

Q. Efficiency - Metrics for performance evaluation?

The other significant metric employed for performance measurement is efficiency of parallel computer system it implies that how resources of parallel systems are being utilized. This is termed as degree of effectiveness. The efficiency of program on parallel computer with k processors may be stated as ratio of relative speed up achieved whilst shifting load from single processor machine to k processor machine where multiple processors are being used for achieving result in a parallel computer. This is indicated by E(k).

Ek is defined in this manner:

1438_Efficiency - Metrics for performance evaluation.png

The value of E(k) is directly proportional to S(k) while inversely proportional to number of processors used for performing computation. The relation between E(k) versus Number of processors is displayed in Figure.

1630_Efficiency - Metrics for performance evaluation1.png

Figure: Efficiency vs. Number of Processors

Assuming we have multiplication problem as discussed above with k processors then efficiency is as under:

2259_Efficiency - Metrics for performance evaluation2.png

Supposing we have X processors it implies that X < K as well as we have to multiply n numbers in such a condition processors may be overloaded or might have a few overheads. Then efficiency is as under:

1219_Efficiency - Metrics for performance evaluation3.png

Now value of T(X) has to be calculated. As we have n numbers as well as we have X processors consequently firstly every processor will multiply n/X numbers as well as consequently process X partial results on X processors according to method discussed in Figure. Time complexity is equivalent to sum of time to calculate multiplication of k/X numbers on every processor it implies that O(k/X) as well as time to calculate solution of partial results it implies that log (X)

116_Efficiency - Metrics for performance evaluation4.png

Dividing by X/K we get

1068_Efficiency - Metrics for performance evaluation5.png

It can be concluded from above statement if N is fixed then efficiency it implies that E(X) will reduce like value of X raises and becomes equal to E(N) in case X=N.  In the same way , if X is fixed then efficiency it implies that E(X) will raise as value of X it implies that the number of computations raises. The other performance metrics include standard metrics such MIPS and Mflops. The term MIPS (Millions of Instructions Per Second) denotes the instruction execution rate. Mflops (Million of Floating Point Operations per Second) denotes floating-point execution rate.


Related Discussions:- Efficiency - metrics for performance evaluation

Explain the working of a 1-to-16 Demultiplexer, Using a suitable logic diag...

Using a suitable logic diagram explain the working of a 1-to-16 de multiplexer. Ans. 1-to-16 Demultiplexer Working: A demultiplexer obtains in data from one line and directs this

Inserting external media in the web page, Step 1: Click on the icon in the ...

Step 1: Click on the icon in the object tool bar Or Insert -> Media -> Choose the media type to be inserted Step 2: Find and select the file required (browse) Step 3: C

What is macro-expansion, What is macro-expansion? Macro calls lead to m...

What is macro-expansion? Macro calls lead to macro expansion. Throughout macro expansion, the macro call statement is replaced through a sequence of assembly statements.

What is tape backup, Q. What is Tape Backup? Magnetic tapes are used th...

Q. What is Tape Backup? Magnetic tapes are used these days in computers for the below purposes: Backing up data stored in disks. It is essential to regularly save data s

Objectives of parallel computing, Objectives of Parallel Computing Aft...

Objectives of Parallel Computing After reading this topic, you would be able to: Tell historical details of parallel computing; Explain the fundamental ideas of dis

Find the width of a time division space switch, I n a time division space s...

I n a time division space switch the size of the control memory is N and its Width:  (A) Log 10 M  (B) Log e M  (C) Log N M  (D) Log 2 M Where N are the ou

Slower layer to a faster layer, Given a four level hierarchical storage sys...

Given a four level hierarchical storage system consisting of: cache,  primary storage, secondary storage, and tertiary storage. Suppose the following:  programs may be executed on

Explain non-pre-emptive algorithms, Explain non-pre-emptive algorithms?   ...

Explain non-pre-emptive algorithms?   Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

Why a function cannot call a task, Why a function can n ot call a task ...

Why a function can n ot call a task As functions doesn't consume time,it can do any operation which doesn't consume time. Mostly tasks are written that consumes time. So a ta

Explain about RISC architecture, Q. Explain about RISC ARCHITECTURE? Le...

Q. Explain about RISC ARCHITECTURE? Let's first list some significant considerations of RISC architecture: 1. RISC functions are kept simple unless there is a very good reas

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