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

Explain the do while loops, Explain The do while loops The do while loo...

Explain The do while loops The do while loops is similar, but the test occurs after the loop body is executed. This ensures that the loop body is run at least once.

What is reflection, What is Reflection?  It extends the benefits of met...

What is Reflection?  It extends the benefits of metadata by permitting developers to inspect and use it at runtime. For example, dynamically verify all the classes contained in

Define decision support system, Q. Define Decision Support System? An...

Q. Define Decision Support System? Ans. The decision support system is an information system application which help decision making. DSS tends to be used in planning or analy

Using bit wise operator implement nor and nand gate, Q. Write a program t...

Q. Write a program to implement NOR, NAND, XOR and XNOR gates using and without using bit wise operator. Also perform necessary checking. The user has option to give n numbe

What is internal path length, Internal Path length It is described as t...

Internal Path length It is described as the number of node traversed while moving by one particular node to any other node in the tree.

State about the indirect addressing, Indirect addressing A memory locat...

Indirect addressing A memory location is given that holds another memory location. This second memory location holds the real data. This mechanism solves problems caused by rea

Method of spirit duplicating, Method : The master from which the copies wi...

Method : The master from which the copies will be taken is first prepared from a special non-absorbent glazed sheet of paper and special carbon paper which acts as the reproducing

Explain about combinational circuits, Q. Explain about Combinational Circui...

Q. Explain about Combinational Circuits? Combinational Circuit is one of the models for parallel computers. In interconnection networks, different processors correspond with ea

Discrete mathmetics and structures, how to prove the partial order R is a t...

how to prove the partial order R is a total order in discrete mathmetics and structures by topological sorting method in c programming

Database management subsystem, (a) Explain, using suitable examples, the fu...

(a) Explain, using suitable examples, the functions of each of the sub system mentioned in the context of a large chain of supermarkets (i) Database Management Subsystem (ii)

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