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 erasable programmable rom (eprom) - computer memory, Explain Erasab...

Explain Erasable Programmable ROM (EPROM) - Computer Memory? An EPROM is a ROM that can be reprogrammed and erased. A little glass window is installed at the top of the ROM pac

Determine the bios function with one illustration, Determine the BIOS funct...

Determine the BIOS function with one illustration BIOS stands for Basic Input Output System. It is a set of programs to provide most basic low-level services like services keyb

What is swapping, What is swapping?   A process can be swapped out tempo...

What is swapping?   A process can be swapped out temporarily of memory to a backing store and after that brought back in memory for execution as continued.

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

Iterative deepening search, Iterative Deepening Search: So, breadth fi...

Iterative Deepening Search: So, breadth first search is always guaranteed to find a solution (if one exists), actually it eats all the memory. For the depth first search, ther

Explain about candidate check, The process which is underlined throughout t...

The process which is underlined throughout the check of base data is called as candidate check. When performing candidate check performance varies either towards the positive side

Incorporating javascript into a web page, As we already know, HTML (Hyperte...

As we already know, HTML (Hypertext Markup Language) is the language we use to create Web documents. Now we will read "Hello World!" As given below:

Find out the access time of ROM using bipolar transistors, The access time ...

The access time of ROM using bipolar transistors is about ? Ans. About 1 µ sec is the access time of ROM using bipolar transistors.

What is dialog box, This is a small window that is demanding your attention...

This is a small window that is demanding your attention. You must respond before you can carry on using the program that shown the dialog box. A dialog box does not have a minimize

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