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 application software, What is application software? Give example. ...

What is application software? Give example. Application programs are usually written in a high level programming language, in which the programmer states mathematical or text p

Raid and data stripping, Explained RAID? Ans: High performance devices ...

Explained RAID? Ans: High performance devices tend to be costly. So we can gain very high performance at a reasonable cost using a number of low-cost devices operating in paral

Explain what are design patterns, Design Patterns are easy and elegant solu...

Design Patterns are easy and elegant solutions of commonly having problems in software design. Design Patterns make it simpler to reuse successful designs and architectures of expe

What are threaded binary trees, What are threaded binary trees? A Threa...

What are threaded binary trees? A Threaded Binary Tree is a binary tree in which each node that does not have a right child has a THREAD (in real sense, a link) to its INORDER

Multi tasking environment, Q. Explain about Multi tasking environment? ...

Q. Explain about Multi tasking environment? Multi tasking uses parallelism by: 1) Pipelining functional units are pipe line mutually 2) Simultaneously employing multiple

Explain about fat - inode, Q. Explain about FAT - Inode? Today modern P...

Q. Explain about FAT - Inode? Today modern PC comprises total capacity of nearly 40GB for storage of program and data Due to this huge capacity in place of having just one oper

What is the impact of overflow for binary numbers, Q. What is the impact of...

Q. What is the impact of overflow for binary numbers? An overflow is said to have happened when sum of two n digits number takes n+ 1 digits. This definition is perfectly appli

What are desirable features of an electronic market place, What are the des...

What are the desirable features of an Electronic Market Place? Features of an Electronic Market Place: 1. Its electronic and business center is not a physical building qu

BCD ADDER, create a BCD adder combinational ckt. that adds 2 digit BCD inpu...

create a BCD adder combinational ckt. that adds 2 digit BCD inputs

Explain pointers, Explain pointers We can have a pointer pointing to a ...

Explain pointers We can have a pointer pointing to a structure just the same way a pointer pointing to an int, such pointers are called as structure pointers

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