Scalable Distributed-Memory External Sorting

Details Scalable Distributed-Memory External Sorting Scalable Distributed-Memory External Sorting

2009-10-14

arxiv.org/abs/0910.2582v1

Computer Science

Data Structures and Algorithms

Scientific paper

We engineer algorithms for sorting huge data sets on massively parallel machines. The algorithms are based on the multiway merging paradigm. We first outline an algorithm whose I/O requirement is close to a lower bound. Thus, in contrast to naive implementations of multiway merging and all other approaches known to us, the algorithm works with just two passes over the data even for the largest conceivable inputs. A second algorithm reduces communication overhead and uses more conventional specifications of the result at the cost of slightly increased I/O requirements. An implementation wins the well known sorting benchmark in several categories and by a large margin over its competitors.

Affiliated with

Also associated with

No associations

Rating

Scalable Distributed-Memory External Sorting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scalable Distributed-Memory External Sorting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable Distributed-Memory External Sorting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-18956