Talk:Parallel calculations: Difference between revisions

From Rosetta Code
Content added Content deleted
No edit summary
Line 5: Line 5:
:Hint: look-up <code>map</code> ''in the Python reference''. P.S. please sign your edits here, thanks. --[[User:Paddy3118|Paddy3118]] 07:13, 21 December 2010 (UTC)
:Hint: look-up <code>map</code> ''in the Python reference''. P.S. please sign your edits here, thanks. --[[User:Paddy3118|Paddy3118]] 07:13, 21 December 2010 (UTC)


: My intention for the task was that to have multiple threads/processes do some parallel calculations (factorize the numbers), and then have the main process receive the results, and proceed with other calculations based on the results. Finding an extremum in these numbers is just an example, the main process might well want to do other things with the returned lists. The current Python solution is different in that it respect: It searches for the minimum already in the sub-process (returning a single number from ''lowest_factor''), but is not what the task asks for: Return that number and its prime factors. --[[User:Abu|Abu]] 09:02, 21 December 2010 (UTC)
: I didn't doubt the parallelism. My intention for the task was that to have multiple threads/processes do some parallel calculations (factorize the numbers), and then have the main process receive the results, and proceed with other calculations based on the results. Finding an extremum in these numbers is just an example, the main process might well want to do other things with the returned lists. The current Python solution is different in that it respect: It searches for the minimum already in the sub-process (returning a single number from ''lowest_factor''), but this is not what the task asks for: Return that number and its prime factors. --[[User:Abu|Abu]] 09:02, 21 December 2010 (UTC)

Revision as of 09:05, 21 December 2010

Python example?

Sure looks to me as if it is outputting the smallest factor (of a list of numbers). Which I don't think is what the task is asking for.

Hint: look-up map in the Python reference. P.S. please sign your edits here, thanks. --Paddy3118 07:13, 21 December 2010 (UTC)
I didn't doubt the parallelism. My intention for the task was that to have multiple threads/processes do some parallel calculations (factorize the numbers), and then have the main process receive the results, and proceed with other calculations based on the results. Finding an extremum in these numbers is just an example, the main process might well want to do other things with the returned lists. The current Python solution is different in that it respect: It searches for the minimum already in the sub-process (returning a single number from lowest_factor), but this is not what the task asks for: Return that number and its prime factors. --Abu 09:02, 21 December 2010 (UTC)