12,394,573 members (80,228 online)
Rate this:
See more:
Q.] How can we find complexity of two funtion with parallel execution of that functions?
Posted 5-Dec-11 0:33am
Albert Holguin 5-Dec-11 9:24am

Don't think you question is exactly very clear. Might want to rephrase.

Rate this:

## Solution 3

Assuming you are talking of the time complexity, the complexity of two functions running in parallel is the largest of the two complexities.
Rate this:

## Solution 1

A very general question, but I think the following link might help.
https://computing.llnl.gov/tutorials/parallel_comp/[^]

Good luck!
Rate this:

## Solution 4

You first have to define the 'complexity of a function' in a (meaningful) way that fits your needs and then make sure that the 'parallel execution' of the functions gives you a measure of such 'complexity'.
As it is stated your questions is pretty vague.
Rate this:

## Solution 5

http://msdn.microsoft.com/en-us/library/gg663528.aspx[^]
Rate this:

## Solution 2

You want complexity of a function or a algo?
Albert Holguin 7-Dec-11 9:18am

How is this a solution?
RaviRanjankr 13-Dec-11 16:17pm

A suggestion :- you can use Have a question or Comment button to drop your message and to get Immediate response instead of posting as answer.

Top Experts
Last 24hrsThis month
 OriginalGriff 305 Richard Deeming 269 ppolymorphe 245 Richard MacCutchan 124 Dave Kreskowiak 113
 OriginalGriff 5,783 Karthik Bangalore 2,337 ppolymorphe 2,290 F-ES Sitecore 1,852 Richard MacCutchan 1,627