Out-of-core computing on mesh connected computers

Rajasekaran, Sanguthevar

doi:10.1016/j.jpdc.2004.08.003

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [24], a merge-based parallel external sorting algorithm is proposed that is inspired by parallel mesh algorithms. This algorithm needs at least four passes over the data.…”

Section: Related Workmentioning

confidence: 99%

Scalable distributed-memory external sorting

Rahn

Sanders

Singler

2010

2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)

View full text Add to dashboard Cite

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.

show abstract

“…In [24], a merge-based parallel external sorting algorithm is proposed that is inspired by parallel mesh algorithms. This algorithm needs at least four passes over the data.…”

Section: Related Workmentioning

confidence: 99%