This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sorting Large Files on a Backend Multiprocessor
July 1988 (vol. 37 no. 7)
pp. 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.

[1] Anonet al., "A measure of transaction processing power," Datamation,1985.
[2] S. R. Ahuja, "S/NET: A high speed interconnect for multiple computers,"IEEE J. Select. Areas Commun., vol. SAC-1, Nov. 1983.
[3] F. H. Baskett, J. H. Howard, and J. T. Montague, "Task communication in DEMOS," inProc. 6th ACM Symp. Oper. Syst. Principles, Nov. 1977, pp. 23-31.
[4] D. Bitton, "Design, analysis and implementation of parallel external sorting algorithms," Ph.D. dissertation, Univ. Wisconsin-Madison, TR 464, Jan. 1982.
[5] D. Bitton and D. J. Dewitt, "Duplicate record elimination in large data files,"ACM Trans. Database Syst., pp. 255-265, June 1983.
[6] S. Even, "Parallelism in tape sorting,"Commun. ACM, vol. 17, pp. 202-204, Apr. 1974.
[7] D. H. Fishman, M. Lai, and K. Wilkinson, "Overview of the Jasmin database machine," inProc. SIGMOD '84, alsoSIGMOD Rec., vol. 14, no. 2, pp. 234-238, 1984.
[8] J. Gray, M. Stewart, A. Tsukerman, S. Uren, and B. Vaughan, "Fastsort, An external sort using parallel processing,"Tandem Syst. Rev., vol. 2, Dec. 1986.
[9] M. Kitsuregawa, H. Tanaka, and T. Moto-oka, "Architecture and performance of relational algebra machine GRACE," inProc. 1984 Int. Conf. Parallel Processing, 1984.
[10] S. Kamiya, S. Matsuda, K. Iwata, S. Shibayama, H. Sakai, and K. Murakami, "A hardware pipeline algorithm for relational database operation," inProc. 12th Int. Symp. Comput. Architecture, June 1985.
[11] S. C. Kwan, "External sorting: I/O analysis and parallel processing techniques," Ph.D. dissertation, Univ. Washington TR 86-01-01.
[12] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[13] H. Lee and U. Premkumar, "The architecture and implementation of distributed JASMIN kernel," Bell Commun. Res. Tech. Memo, TM-ARH-000324, Oct. 1984, Morristown, NJ.
[14] J. P. Linderman, "Theory and practice in the construction of a working sort routine,"AT&T Tech. J., vol. 63, part 2, pp. 1827-1845, Oct. 1984.
[15] P. Selinger,et al., "Access path selection in a relational data base system," inProc. 1979 ACM-SIGMOD Int. Conf. Management of Data, Boston, MA, June 1979.
[16] H. Schweppe, H. C. Zeidler, W. Hell, H.-O. Leilich, G. Stiege, and W. Teich, "RDBM-A dedicated multiprocessor system for database management," inAdvanced Database Machine Architecture, D. K. Hsiao, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1983.
[17] Y. Tanaka, "A data-stream database machine with large capacity," inAdvanced Database Machine Architecture, D. K. Hsiao, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1983.

Index Terms:
backend multiprocessor; parallel sort-merge algorithm; JASMIN prototype; fast packet bus; streamlined distributed operating system; database management systems; multiprocessing systems; sorting.
Citation:
M. Beck, D. Bitton, W.K. Wilkinson, "Sorting Large Files on a Backend Multiprocessor," IEEE Transactions on Computers, vol. 37, no. 7, pp. 769-778, July 1988, doi:10.1109/12.2222
Usage of this product signifies your acceptance of the Terms of Use.