Sorting Large Files on a Backend Multiprocessor

@article{Beck1988SortingLF,
  title={Sorting Large Files on a Backend Multiprocessor},
  author={Micah Beck and Dina Bitton and Kevin Wilkinson},
  journal={IEEE Trans. Computers},
  year={1988},
  volume={37},
  pages={769-778}
}
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… 
Beyond striping: the bridge multiprocessor file system
TLDR
It is argued that file systems such as Bridge will satisfy the I/O needs of a wide range of parallel architectures and applications, and empirical results on a 32-processor implementation agree with this prediction.
External Sorting on a Parallel Interleaved File System
TLDR
It is argued that file systems such as Bridge will satisfy the 1/0 needs of a wide range of parallel architectures and applications.
High-performance sorting on networks of workstations
We report the performance of NOW-Sort, a collection of sorting implementations on a Network of Workstations (NOW). We find that parallel sorting on a NOW is competitive to sorting on the large-scale
A Low Communication Sort Algorithm for a Parallel Database Machine
TLDR
This work proposes a novel algorithm that exhibits complete parallelism during the sort, merge, and return-tohost phases, and decreases the amou@ of inter-processor communication compared to existing parallel sort algorithms.
ExterniaJ Sorting on a Distributed Memory Machine
  • D. Ecklund
  • Computer Science
    The Sixth Distributed Memory Computing Conference, 1991. Proceedings
  • 1991
TLDR
This work proposes and prototyped a two phase parallel external sorting algorithm that removes the “final merge bottleneck” by partitioning sorted utilizing multiple processors to build a merged Iun.
AlphaSort: a RISC machine sort
TLDR
A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads and proposes two new benchmarks: Minutesort: how much can you sort in a minute, and DollarSort: how to sort for a dollar.
A practical external sort for shared disk MPP's
TLDR
The implementation of the sample sort algorithm described here meets the requirements of real world constraints and is suitable for shared disk MPP computer systems.
Alphasort: A cache-sensitive parallel external sort
TLDR
A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads and argues that modern architectures require algorithm designers to re-examine their use of the memory hierarchy.
A parallel interleaved file system
TLDR
The thesis of this dissertation is that a parallel interleaved file system will provide scalable high-performance I/O for a wide range of parallel architectures while supporting a comprehensive set of conventional file system facilities.
Parallel Sorting of Large Data Volumes on Distributed Memory Multiprocessors
TLDR
This algorithm is suited for large data volumes (external sorting) and does not suffer from processing skew in presence of data skew and the optimal degree of CPU parallelism is derived if I/O limitations are taken into account.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 14 REFERENCES
External sorting: I/O analysis and parallel processing techniques
TLDR
This thesis deals with sorting of data that are much too large to fit in main memory, or external sorting, and develops techniques for producing long runs in merge sort and for rearranging the records in tag sort after their ranks have been determined.
Design, analysis, and implementation of parallel external sorting algorithms
TLDR
A modified merge-sort is proposed to use as a method for eliminating duplicate records in a large file and a combinatorial model is developed to provide an accurate estimate for the cost of the duplicate elimination operation (both in the serial and the parallel cases).
S/NET: A High-Speed Interconnect for Multiple Computers
  • S. Ahuja
  • Computer Science
    IEEE J. Sel. Areas Commun.
  • 1983
TLDR
S/NET (symmetric network), a high-speed small area interconnect that supports effective multiprocessing using message-based communication that provides low latency, bounded contention time, and high throughput is described.
The UNIX system: Theory and practice in the construction of a working sort routine
  • J. P. Linderman
  • Computer Science
    AT&T Bell Laboratories Technical Journal
  • 1984
Because comparison in the standard UNIX™ operating system sort routine, /bin/sort, is interpretive, it is generally more time-consuming than the standard paradigm of comparing two integers. When a
Overview of the Jasmin database machine
TLDR
Jasmin's architecture is described and the performance observed in the uniprocessor prototype is discussed, which shows its configurable performance, its use of off-the-shelf parts, and its ability to handle distributed databases.
A hardware pipeline algorithm for relational database operation
TLDR
The design considerations of the RDBE and these algorithms, including a two-way merge-sort algorithm, are described and the detailed design, implementation, and a performance evaluation of theRDBE are described.
A measure of transaction processing power
TLDR
These benchmarks measure the performance of diverse transaction processing systems and a standard system cost measure is stated and used to define price/performance metrics.
Task communication in DEMOS
TLDR
The link based message and data sharing system is an attractive alternative to the semaphore or monitor type of shared variable based operating system on machines with only very simple memory protection mechanisms or on machines connected together in a network.
Parallelism in tape-sorting
TLDR
Two methods for employing parallelism in tape-sorting are presented and both approximately achieve the goal of reducing the processing time by a divisor which is the number of processors.
Duplicate record elimination in large data files
The issue of duplicate elimination for large data files in which many occurrences of the same record may appear is addressed. A comprehensive cost analysis of the duplicate elimination operation is
...
1
2
...