External sorting: I/O analysis and parallel processing techniques
External sorting: I/O analysis and parallel processing techniques
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Duplicate record elimination in large data files
ACM Transactions on Database Systems (TODS)
A hardware pipeline algorithm for relational database operation
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Communications of the ACM
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Overview of the Jasmin database machine
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Beyond striping: the bridge multiprocessor file system
ACM SIGARCH Computer Architecture News
A low communication sort algorithm for a parallel database machine
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Percentile finding algorithm for multiple sorted runs
VLDB '89 Proceedings of the 15th international conference on Very large data bases
FastSort: a distributed single-input single-output external sort
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Exploiting database parallelism in a message-passing multiprocessor
IBM Journal of Research and Development
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
AlphaSort: a RISC machine sort
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A Parallel Scheme Using the Divide-and-Conquer Method
Distributed and Parallel Databases
AlphaSort: a cache-sensitive parallel external sort
The VLDB Journal — The International Journal on Very Large Data Bases
IEEE Transactions on Knowledge and Data Engineering
Speeding Up External Mergesort
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 14.98 |
The authors investigate the feasibility and efficiency of a parallel sort-merge algorithm by considering its implementation of the JASMIN prototype, a backend multiprocessor built around a fast packet bus. They describe the design and implementation of a parallel sort utility and present and analyze the results of measurements corresponding to a range of file sizes and processor configurations. The 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-Mb file in 1 hr 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.