title: High-performance priority queue to merge many sorted runs
body: <p>I have an application to do merging of > 10,000 sorted runs on a single thread and I am currently using the C++ 11 STL::priority_queue to do the work. I wonder whether there exists some open-source priority queue code (or some other  data structure/implementation that can do merging of sorted  runs) that can outperform STL::priority_queue in a single-threaded environment (for example, designed with better cache aware). Or some report on benchmarking different priority queue implementations. </p>