skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Sorting large files on a backend multiprocessor

Abstract

A fundamental measure of processing power in a database management system is the performance of the sort utility it provides. When sorting a large data file on a serial computer, performance is limited by factors involving processor speed, memory capacity, and I/O bandwidth. In this paper, the authors investigate the feasibility and efficiency of a parallel sort-merge algorithm through implementation on the JASMIN prototype, a backend multiprocessor built around a fast packet bus. The authors describe the design and implementation of a parallel sort utility. They then present and analyze the results of measurements corresponding to a range of file sizes and processor configurations. Their results show that using current, off-the-shelf technology coupled with a streamlined distributed operating system, three- and five-microprocessor configurations provide a very cost-effective sort of large files. The three-processor configuration sorts a 100 Mbyte file in 1 h, which compares well to commercial sort packages available on high-performance mainframes. In additional experiments, the authors investigate a model to tune their sort software and scale their results to higher processor and network capabilities.

Authors:
; ;
Publication Date:
Research Org.:
Dept. of Computer Science, Cornell Univ., Ithaca, NY (US)
OSTI Identifier:
7177748
Resource Type:
Journal Article
Journal Name:
IEEE Trans. Comput.; (United States)
Additional Journal Information:
Journal Volume: 37:7
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; ARRAY PROCESSORS; DATA BASE MANAGEMENT; DATA PROCESSING; ALGORITHMS; CONFIGURATION; EXECUTIVE CODES; MEASURING METHODS; COMPUTER CODES; MANAGEMENT; MATHEMATICAL LOGIC; PROCESSING; 990210* - Supercomputers- (1987-1989)

Citation Formats

Beck, M, Bitton, D, and Wilkinson, W K. Sorting large files on a backend multiprocessor. United States: N. p., 1988. Web. doi:10.1109/12.2222.
Beck, M, Bitton, D, & Wilkinson, W K. Sorting large files on a backend multiprocessor. United States. https://doi.org/10.1109/12.2222
Beck, M, Bitton, D, and Wilkinson, W K. 1988. "Sorting large files on a backend multiprocessor". United States. https://doi.org/10.1109/12.2222.
@article{osti_7177748,
title = {Sorting large files on a backend multiprocessor},
author = {Beck, M and Bitton, D and Wilkinson, W K},
abstractNote = {A fundamental measure of processing power in a database management system is the performance of the sort utility it provides. When sorting a large data file on a serial computer, performance is limited by factors involving processor speed, memory capacity, and I/O bandwidth. In this paper, the authors investigate the feasibility and efficiency of a parallel sort-merge algorithm through implementation on the JASMIN prototype, a backend multiprocessor built around a fast packet bus. The authors describe the design and implementation of a parallel sort utility. They then present and analyze the results of measurements corresponding to a range of file sizes and processor configurations. Their results show that using current, off-the-shelf technology coupled with a streamlined distributed operating system, three- and five-microprocessor configurations provide a very cost-effective sort of large files. The three-processor configuration sorts a 100 Mbyte file in 1 h, which compares well to commercial sort packages available on high-performance mainframes. In additional experiments, the authors investigate a model to tune their sort software and scale their results to higher processor and network capabilities.},
doi = {10.1109/12.2222},
url = {https://www.osti.gov/biblio/7177748}, journal = {IEEE Trans. Comput.; (United States)},
number = ,
volume = 37:7,
place = {United States},
year = {Fri Jul 01 00:00:00 EDT 1988},
month = {Fri Jul 01 00:00:00 EDT 1988}
}