-1

I searched in Google: "parallel merge sort" and found algorithm where "odd/even merge" is base component, but did not understand how to use it.

Can you give me links to an implementation or pseudo code of parallel merge sort?

Ian Boyd
  • 233,966
  • 238
  • 834
  • 1,160
mr. Vachovsky
  • 1,148
  • 2
  • 12
  • 23

2 Answers2

4

Merge sort implementations for almost any language: http://rosettacode.org/wiki/Merge_sort

dbyrne
  • 55,767
  • 13
  • 84
  • 103
  • I understand merge sort!!! I need parallel merge sort!!! With load balancing!... – mr. Vachovsky Mar 08 '11 at 17:07
  • By parallel do you mean multithreaded? If so, check out the Erlang implementation from the link I provided. – dbyrne Mar 08 '11 at 17:11
  • I didn't use Erlang... ) Are you? There is implementation is supported load balancing? – mr. Vachovsky Mar 08 '11 at 17:21
  • Added a link to an implementation in C/C++. I don't understand what you mean by "load balancing" in this context. – dbyrne Mar 08 '11 at 17:22
  • And whats wrong with Erlang? Erlang is especially useful for concurrent processing, which it seems you are interested in. If you wanted an implementation for a specific language, it would help to include that in your question. – dbyrne Mar 08 '11 at 17:24
1

This is a good way to start: http://penguin.ewu.edu/~trolfe/ParallelMerge/ParallelMerge.html

dinwal
  • 445
  • 2
  • 13