Sorting Large Files on a Backend Multiprocessor

@article{Beck1988SortingLF,
  title={Sorting Large Files on a Backend Multiprocessor},
  author={M. Beck and D. Bitton and K. 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… Expand
Beyond striping: the bridge multiprocessor file system
High-performance sorting on networks of workstations
ExterniaJ Sorting on a Distributed Memory Machine
  • D. Ecklund
  • Computer Science
  • The Sixth Distributed Memory Computing Conference, 1991. Proceedings
  • 1991
AlphaSort: a RISC machine sort
A practical external sort for shared disk MPP's
Alphasort: A cache-sensitive parallel external sort
A parallel interleaved file system
Parallel Sorting of Large Data Volumes on Distributed Memory Multiprocessors
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 14 REFERENCES
S/NET: A High-Speed Interconnect for Multiple Computers
  • S. Ahuja
  • Computer Science
  • IEEE J. Sel. Areas Commun.
  • 1983
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
Overview of the Jasmin database machine
A measure of transaction processing power
Task communication in DEMOS
Parallelism in tape-sorting
Duplicate record elimination in large data files
...
1
2
...