Explain time complexity in parallel algorithms, Computer Engineering

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.

Posted Date: 7/10/2013 7:02:44 AM | Location : United States







Related Discussions:- Explain time complexity in parallel algorithms, Assignment Help, Ask Question on Explain time complexity in parallel algorithms, Get Answer, Expert's Help, Explain time complexity in parallel algorithms Discussions

Write discussion on Explain time complexity in parallel algorithms
Your posts are moderated
Related Questions
Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes,

Discuss the concept of segmentation? Segmentation is method for the non contiguous storage allocation. This is different from paging as this supports user's view of his program

Array Processing We have seen that for performing vector operations, the pipelining concept has been taken. There is another method for vector operations. If we have an array o

Write short note on the Johnson counter. Ans:  Johnson Counter: It is a synchronous counter, where all flip-flops are clocked concurrently and the clock pulses drive the

A data set with 1000 rows is input to a neural network in Weka. The test option is set to 10-fold cross validation and the neural network option validationSetSize = 20%. How many r

Explain what is DTMF signalling. Dual Tone Multi Frequency (DTMF) was initially introduced in 1963 with 10 buttons into Western Electric 1500 -type telephones. Dual Tone Multi


write a short note on good blend of engineering and managerial economics

Classify Scheduler. Scheduler is a kernel function decide which method  be  thought to be implemented by the processor: the scheduler scans the list of processes in the ready s

The following sentences have a (potential) scope ambiguity. Give two translations into predicate logic for each sentence (one formula for each reading), and explain in words what t