Evaluate total expense of algorithm, Computer Engineering

Assignment Help:

Q. Evaluate Total expense of algorithm?

Lastly, the total expense of algorithm is a product of the total number of processors required for computation and time complexity of the parallel algorithm.

Cost = Time Complexity * Total Number of Processors

The other form of defining cost is that this specifies total number of steps performed together by n number of processors; it implies that summation of steps. Another term associated with the analysis of parallel algorithms is effectiveness of the algorithm. It is explained as the ratio of worst case running time of the best sequential algorithm and the cost of the parallel algorithm. The effectiveness would be mostly equal to or less than 1. In a condition, if efficiency is greater than 1 then it means that sequential algorithm is more rapid than parallel algorithm.

764_Total expense of algorithm.png


Related Discussions:- Evaluate total expense of algorithm

What is difference between cgi and java, CGI and JAVA are fundamentally dis...

CGI and JAVA are fundamentally dissimilar, and for most applications are NOT interchangable. CGI is a protocol for running programs on a WWW server. Whilst JAVA can also be us

What are subroutines, What are subroutines? Subroutines are program mo...

What are subroutines? Subroutines are program modules, which can be known  from other ABAP/4 programs or within the similar program.

Define static memories, Define static memories? Memories that consists ...

Define static memories? Memories that consists of circuits capable of retaining their state as long as power is applied is known as static memories

Characteristics of a computer memory systems, Question: a) Describe wha...

Question: a) Describe what is meant by a "bus". There are two types of bus, dedicated and multiplexed. Give a brief description of both types of buses. b) Briefly explain f

What is SSTF, SSTF stands for ? Ans. Shortest-Seek-time-first scheduli...

SSTF stands for ? Ans. Shortest-Seek-time-first scheduling.

Define terms setup time and hold time violation, Define setup time and hold...

Define setup time and hold time, what will occur when there is setup time and hold tine violation, how to overcome it? For Synchronous flip-flops, we have particular requiremen

Execution error and compilation error, Execution error and compilation erro...

Execution error and compilation error: Errors like as mismatch of data types or array out of bound error are called as execution errors or runtime errors. These errors are us

What are the two aspects of locality of reference, What are the two aspects...

What are the two aspects of locality of reference? Define them. Two aspects of locality of reference are temporal aspects and spatial aspect. Temporal aspect is that a r

Explain the modularity of object oriented analysis, Explain the Modularity ...

Explain the Modularity of Object oriented analysis Modularity is closely attached to encapsulation; you may think of it as a way of mapping encapsulated abstractions into phys

Why pointer variable to a function as an argument, Why pointer variable som...

Why pointer variable sometimes desirable to pass a pointer to a function as an argument? Frequently, a called function needs to make changes to objects declared in the calling

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