Sorting large records on a cell broadband engine

@article{Bandyopadhyay2010SortingLR,
  title={Sorting large records on a cell broadband engine},
  author={Shibdas Bandyopadhyay and Sartaj Sahni},
  journal={The IEEE symposium on Computers and Communications},
  year={2010},
  pages={939-944}
}
We consider the sorting of a large number of multifield records on the Cell Broadband engine. We show that our method, which generates runs using a 2-way merge and then merges these runs using a 4-way merge, outperforms previously proposed sort methods that use either comb sort or bitonic sort for run generation followed by a 2-way odd-even merging of runs. Interestingly, best performance is achieved by using scalar memory copy instructions rather than vector instructions. 

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Fundamentals of d ata structures in C++, Second Edition

  • E. Horowitz, S. Sahni, D. Mehta
  • 2007
3 Excerpts

Worst case for Comb Sort

  • A. Drozdek
  • Informatyka Teoretyczna i Stosowana,
  • 2005

The performance of randomized Shellsort-li ke network sorting algorithms, SCAMP working paper P18/94, Institute for Defense

  • P. Lemke
  • 1994

Similar Papers

Loading similar papers…