NDLI: Highly scalable parallel sorting

Content Provider	IEEE Xplore Digital Library
Author	Solomonik, E. Kale, L.V.
Copyright Year	2010
Description	Author affiliation: Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA (Solomonik, E.; Kale, L.V.)
Abstract	Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehensive analysis and theory for parallel sorting algorithms. However, modern supercomputers have advanced rapidly in size and changed significantly in architecture, forcing new adaptations to these algorithms. To fully utilize the potential of highly parallel machines, tens of thousands of processors are used. Efficiently scaling parallel sorting on machines of this magnitude is inhibited by the communication-intensive problem of migrating large amounts of data between processors. The challenge is to design a highly scalable sorting algorithm that uses minimal communication, maximizes overlap between computation and communication, and uses memory efficiently. This paper presents a scalable extension of the Histogram Sorting method, making fundamental modifications to the original algorithm in order to minimize message contention and exploit overlap. We implement Histogram Sort, Sample Sort, and Radix Sort in Charm++ and compare their performance. The choice of algorithm as well as the importance of the optimizations is validated by performance tests on two predominant modern supercomputer architectures: XT4 at ORNL (Jaguar) and Blue Gene/P at ANL (Intrepid).
Starting Page	1
Ending Page	12
File Size	539023
Page Count	12
File Format	PDF
ISBN	9781424464425
ISSN	15302075
e-ISBN	9781424464432
DOI	10.1109/IPDPS.2010.5470406
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-04-19
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Sorting Supercomputers Histograms Algorithm design and analysis Testing Computer science Application software Merging High performance computing Parallel processing
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Comparison Based Parallel Sorting Algorithm

A scalable high-performance I/O system

Parallel scalable libraries and algorithms for computer vision

Parallel Sorting on Symult 2010

Parallel scalable libraries and algorithms for computer vision (1994).

The R-LRPD test: speculative parallelization of partially parallel loops

Merging Multiple Lists in O(log n) Time

Parallel scalable libraries and algorithms for computer vision*.

A Paradigm for the Design of Parallel Algorithms with Applications

Highly scalable parallel sorting

Similar Documents

A Comparison Based Parallel Sorting Algorithm

A scalable high-performance I/O system

Parallel scalable libraries and algorithms for computer vision

Parallel Sorting on Symult 2010

Parallel scalable libraries and algorithms for computer vision (1994).

The R-LRPD test: speculative parallelization of partially parallel loops

Merging Multiple Lists in O(log n) Time

Parallel scalable libraries and algorithms for computer vision*.

A Paradigm for the Design of Parallel Algorithms with Applications

Highly scalable parallel sorting