Groups | Search | Server Info | Keyboard shortcuts | Login | Register
Groups > comp.programming.threads > #1039
| From | "aminer" <aminer@videotron.ca> |
|---|---|
| Newsgroups | comp.programming.threads, comp.programming |
| Subject | About Parallel Merging paper... |
| Date | 2012-08-26 14:36 -0500 |
| Organization | A noiseless patient Spider |
| Message-ID | <k1dqb6$7cb$1@dont-email.me> (permalink) |
Cross-posted to 2 groups.
Hello, I have just read the following paper on Parallel Merging: http://www.economyinformatics.ase.ro/content/EN4/alecu.pdf And i have implemented this algorithm just to see what is the performance. And i have noticed that the serial algorithm is 8 times slower than the merge function that you find in the serial mergesort algorithm. So 8 times slower, it's too slow. Thank you, Amine Moulay Ramdane.
Back to comp.programming.threads | Previous | Next — Next in thread | Find similar
About Parallel Merging paper... "aminer" <aminer@videotron.ca> - 2012-08-26 14:36 -0500 Re: About Parallel Merging paper... "aminer" <aminer@videotron.ca> - 2012-08-26 14:45 -0500
csiph-web