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

What is XMS, What is XMS Memory system is divided into 3 main parts. TP...

What is XMS Memory system is divided into 3 main parts. TPA (transient program area), system area and XMS (extended memory system). Type of microprocessor in your computer sign

Pebble merchant, There is a pebble merchant.He sells the pebbles,that are u...

There is a pebble merchant.He sells the pebbles,that are used for shining the floor.His main duty is to take length of the room''s sides. program 1 : package test.padovanstring

Role of world wide web in the field of e-commerce, Explain the role of Worl...

Explain the role of World Wide Web in the field of e-commerce.  In the 1990s, the arrival of the World Wide Web on the Internet had shown a turning point in e-commerce by givin

Interpreter, difference between pure and impute inter preter

difference between pure and impute inter preter

Towers of hanoi problem, The Towers of Hanoi Problem Towers of Hanoi pro...

The Towers of Hanoi Problem Towers of Hanoi problem is described. There are three pegs on which disks are "threaded" (there are holes in the disks to allow them to be placed on

Explain about annotational notations, Explain about Annotational Notations ...

Explain about Annotational Notations These notations may be applied to describe remark and illuminate about any element in the model. They are considered as explanatory of U

State about the directed-test methodology, Directed-Test Methodology Bu...

Directed-Test Methodology Building a directed verification environment with a comprehensive set of directed tests is very time-consuming and difficult. As directed tests only c

State about the multiple inheritance, State about the multiple inheritance ...

State about the multiple inheritance multiple inheritance is shown in Figure. In this, one class is inherited from more than one class.

What is a diagonalization language ld, What is a Diagonalization language L...

What is a Diagonalization language LD?  The  diagonalization  language  having  of  all  strings  w  such  that  the  TM  whose  code is w does not accept when w is given as in

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