13,048,805 members (84,622 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[^]
See here about parellel programming
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.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Top Experts
Last 24hrsThis month
 Richard MacCutchan 114 Satya Prakash Swain 114 OriginalGriff 95 Jochen Arndt 85 Atlapure Ambrish 65
 OriginalGriff 4,963 RickZeeland 1,924 ppolymorphe 1,753 F-ES Sitecore 1,553 Dave Kreskowiak 1,379

Advertise | Privacy | Mobile
Web02 | 2.8.170713.1 | Last Updated 15 Dec 2011