Efficient Sorting Networks
{'Code': '05010100', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Bruce H. Barnes', 'PO_EMAI': None, 'PO_PHON': None}
The importance of efficient sorting algorithms is widely acknowledged           in many applications.  This project is an investigation of the problem          of producing fast n-input parallel sorting circuits.  The model used is         the popular sorting network.  For extremely small n, the fastest                sorting networks are hand-constructed.  For intermediate n, the fastest         networks are essentially those of Batcher.  For extremely large n, the          fastest sorting networks are those of Ajtai, Kimlos and Szemeredi.              Improvements in all three situations are sought.                                                                                                                For very small n, a modification of existing backtracking algorithms            should result in viable networks with a slightly larger number of               inputs.  For intermediate n, Batcher's sorting algorithm will be                modified to use larger building blocks.  This approach is essentially a         careful analysis of the divide-and-conquer strategy.  For very large n,         existing algorithms will be studied for potential improvements.
{'FirstName': 'Ian', 'LastName': 'Parberry', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Ian Parberry', 'EmailAddress': 'ian@unt.edu', 'NSF_ID': '000216861', 'StartDate': '07/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Pennsylvania State Univ University Park', 'CityName': 'UNIVERSITY PARK', 'ZipCode': '168021503', 'PhoneNumber': '8148651372', 'StreetAddress': '201 OLD MAIN', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Pennsylvania', 'StateCode': 'PA', 'CONGRESSDISTRICT': '15', 'CONGRESS_DISTRICT_ORG': 'PA15', 'ORG_UEI_NUM': 'NPM2J7MSCF61', 'ORG_LGL_BUS_NAME': 'THE PENNSYLVANIA STATE UNIVERSITY', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '2860', 'Text': 'THEORY OF COMPUTING'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8801659.xml'}