Explain time complexity in parallel algorithms, Computer Engineering

Assignment Help:

Q. Explain Time Complexity in Parallel algorithms?

As it takes place nearly everyone who implement algorithms wish to know how much of an individual resource (for example time or storage) is needed for a given algorithm. The parallel architectures have been intended for improving computation power of several algorithms. So the main concern of evaluating an algorithm is the determination of amount of time needed to execute. Generally the time complexity is computed on the grounds of total number of steps implemented to achieve the desired output.

The Parallel algorithms generally divide the problem in more asymmetrical or symmetrical sub problems and shift them to various processors and put results back together at one end. The resource utilization in concurrent algorithms is both the communication overhead between the processors and also processor cycles on each processor.


Related Discussions:- Explain time complexity in parallel algorithms

Probabilistic hough transformation, The probabilistic Hough transform uses ...

The probabilistic Hough transform uses random sampling instead of an accumulator array. In this approach the number of random samples r, is not specified in the OpenCV call, but

What is graceful degradation, What is graceful degradation? In multipro...

What is graceful degradation? In multiprocessor systems, failure of one processor will not halt the system, but only slow it down by sharing the work of failure system by other

What are different queues used, 1.Local queue -is a actual queue 2.Clus...

1.Local queue -is a actual queue 2.Cluster queue -is a local queue that is called as throughout a cluster of queue managers 3. Remote queue -structure explaining a queue

A switch statement , Which is more efficient, a switch statement or an if e...

Which is more efficient, a switch statement or an if else chain? Ans) The differences, if any, are likely to be small. The switch statement was designed to be efficiently impl

Combining logic gates - boolean algebra, More complicated logic circuits ca...

More complicated logic circuits can be made byconnecting a number of simple logic gates.How do we decide how to connect the gates togive a particular function e.g. output Y?We need

What are the applications of edi in business, What are the applications of ...

What are the applications of EDI in business A.  Organistions that use EDI Extensive users of EDI contain: BHS- is a UK and European retailer dealing majorly in appare

Pipelined processor, Pipelined Processor Having discussed pipelining; n...

Pipelined Processor Having discussed pipelining; now we can describe a pipeline processor. A pipeline processor can be distinct as a processor that consists of a series of proc

Explain non-folded network, Explain Non-Folded network Non-Folded Netw...

Explain Non-Folded network Non-Folded Network: In a switching network, every inlet/outlet connection may be utilized for inter exchange transmission. In this case, the .excha

Logical difference among move a to b and compute b = a, What is the  logic...

What is the  logical difference among Move A TO B and COMPUTE B = A ? Ans) In case of Move A TO B it will move whatever the value of a in to b. It mean it will move nume

What is called when distortion caused on telephone line, Distortion caused ...

Distortion caused on telephone line by an adjacent one is called (A) Cross Fire                      (B) Inductive Disturbance (C)  Cross Talk                     (D) Non

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