|
[x]
Posted via EE Mobile
|
|
| Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again. |
|
|
|
|
|
[x]
The Solution Rating System
|
|
| With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating. - The Grade of the Solution
- The Zone Rank of the Expert Providing the Solution
- The Number of Author and Expert Comments
- The Number of Experts Contributing
- The Feedback of the Community
Your Input Matters Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site. If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support. Thank you! |
|
|
|
|
Asked by chsalvia in Algorithms, C Programming Language, C++ Programming Language
I posted this question in C/C++ because I usually program in those languages, but this is really a general question relating to an algorithm.
Recently I've been experimenting with different implementations of algorithms designed to sort very large files using external merge sorting. This entails a two-phase approach - the first phase reads in the file in chunks and sorts each chunk, then writes the sorted chunk to disk. The second phase then merges all chunks together into a single sorted file.
Parallelization is of course the key here to doing this efficiently. It's quite easy to parallelize the first phase of the algorithm. Each chunk of the file can be passed to a separate worker thread, so the sorting can be done in parallel. But is it possible to parallelize the merging phase?
Does any expert here know of a general algorithm for parallelizing the merging phase of an external merge sort?
20091118-EE-VQP-93 - Hierarchy / EE_QW_2_20070628