High-Performance Sorting Algorithms on AIX

Sorting is a topic which has been studied and researched extensively. Given a number of records and one or more fields as the key, the task is to arrange the records into ascending or descending order. Sorting has been one of the most critical applications on mainframe machines. In this paper we describe our approach of offloading sorting operations from mainframe machines and executing the operations on AIX systems. A library was developed to read records from mainframe DASD disks on an AIX machine and thus make offloading other mainframe operations feasible. We analyze the performance of quick sort and radix sort implementations on AIX using mainframe datasets and find that the sorting operations can be improved up to 70%.

By: C. Eric Wu; Gokul Kandiraju; Pratap Pattnaik

Published in: RC24489 in 2008


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .