Dina Bitton
- AJTAI, M, KOML6S, J., AND SZEMER~DI, E 1983. An O(n log n) sorting network. In Procee&ngs of the 15th Annual ACM Symposium on Theory of Computing (Boston, Apr. 25-27). ACM, New York, pp. 1-9. Google Scholar
- ALEKSEYEV, V. E. 1969. On certain algorithms for sorting with minimal memory. K~bernettca 5, 5.~Google Scholar
- BANERJEE, J., BAUM, R. I., AND HSIAO, D. K. 1978. Concepts and capabilities of a database computer. ACM Trans. Database Syst. 3, 4 (Dec.), 347-384. Google Scholar
- BATCHER, K. E. 1968. Sorting networks and their applications. In Proceedings of the 1968 Spring Joint Computer Conference (Atlantic City, N.J., Apr. 30-May 2), vol. 32. AFIPS Press, Reston, Va., pp. 307-314.Google Scholar
- BAUDET, G., ANO STEVENSON, D. 1978. Optimal sorting algorithms for parallel computers. IEEE Trans. Comput. C-27, 1 (Jan.).Google Scholar
- BENTLEY, J. L., AND KUNG, H. T. 1979. A tree machine for searching problems. In Proceedmgs of the 1979 Internattonal Conference on Parallel Processmg (Aug.).Google Scholar
- BILARDi, G., AND PREPARATA, F. P. 1983. A miramum area VLSI architecture for O(log n) time sorting. TR-1006, Computer Science Department, Univ. of illinois at Urbana-Champalgn (Nov.).Google Scholar
- BITTON, D., AND DEWITT, D. J. 1983. Duplicate record elimination in large data files. ACM Trans. Database $yst. 8, 2 (June), 255-265. Google Scholar
- BiTTON-FRIEDLAND, D. 1982. Design, analysis and implementation of parallel external sorting algorithms. Ph.D. &ssertation, TR464, Computer Science Department, Univ. of Wmconsin, Madison (Jan.).Google Scholar
- BORODIN, A., AND HOPCROFT, J. E. 1982. Routing, merging and sorting on parallel models of computation. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (San Francisco, Calif., May 5-7). ACM, New York, pp. 338- 344. Google Scholar
- BRYANT, R. 1980. External sorting m a layered storage architecture. Lecture. IBM Research Center, Yorktown Heights, N.Y.Google Scholar
- CHEN, T C., LUM, V. Y., AND TUNG, C. 1978. The rebound sorter: An efficient sort engine for large files. In Proceedings of the 4th Internatwnal Conference on Very Large Data Bases (West Berlin, FRG, Sept. 13-15). IEEE, New York, 312-318.Google Scholar
- CHUNG, K., LuccIo, F., AND WONG, C. K. 1980. On the complexity of sorting in magnetic bubble memory systems. IEEE Trans. Comput. C-29 (July).Google Scholar
- Dora, Y., SUZUKI, A., AND MATSUI, N. 1982. Hardware sorter and its application to data base machine. In Proceedings of the 9th Conference on Computer Archttecture (Austin, Tex., Apr. 26- 29). IEEE, New York, pp. 218-225. Google Scholar
- EVEN, S. 1974. Parallelism in tape-sorting. Commun. ACM 17, 4 (Apr.), 202-204. Google Scholar
- FENG, T.-Y. 1981. A survey of interconnection networks. Computer 14, 12 (Dec.).Google Scholar
- FmUSURN, J. P., AND F~NKrL, R. A. 1982. Quotient networks. IEEE Trans Comput C-31, 4 (Apr.).Google Scholar
- GAVRIL, F. 1975. Merging with parallel processors. Cornmun ACM 18, 10 (Oct.), 588-591. Google Scholar
- HIRSCHBERG, D. S. 1978. Fast parallel sorting algorithms. Cornmun. ACM 21, 8 (Aug.), 657-666. Google Scholar
- HslAo, D. C., AND MENON, M. J. 1980. Parallel record-sorting methods for hardware realization. Tech. Rep. OSU-CISRC-TR-80-7, Computer and Science Information Dept., Ohio State Univ., Columbus, Ohio (July).Google Scholar
- KNUTH, D. E. 1973. Sorting and searching. In The Art of Computer Prograrnrn~ng, vol. 3 Addmon- Wesley, Reading, MassGoogle Scholar
- KUMAR, M., AND HIRSCHBERG, D. S. 1983. An efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes. IEEE Trans Comput C-32 (Mar.).Google Scholar
- LEE, D. T., CHANG, H., AND WONG, K. 1981. An onchip compare/steer bubble sorter. IEEE Trans Comput. C-30 (June).Google Scholar
- LEILICH, H. O., STmGE, G, Argo ZEIOLER, H. C. 1978. A search processor for database management systems. In Proceedings of the 4th Conference on Very Large Databases (West Berlin, FRG, Sept. 13-15) IEEE, New York, pp. 280-287.Google Scholar
- LEiSERSON, C. E. 1981. Area-efficient VLSI computation. Ph.D. dissertation. Tech. Rep. CMU- CS-82-108, Computer Science Dept.; Carnegie- Mellon Univ., P~ttsburgh, Pa. (Oct.). Google Scholar
- MULLER, D. E., AND PREPARATA, F. P. 1975. Bounds to complexities of networks for sorting and for switching. J ACM 22, 2 (Apr.), 195-201. Google Scholar
- NASSlMI, D., ANO SAHNI, S. 1979. Bitomc sort on a mesh connected parallel computer, iEEE Trans. Comput C-27, 1 (Jan.).Google Scholar
- NASSlMI, D., ANO SAHNL S. 1982. Parallel algorithms to set up the Benes permutation network. IEEE Trans Comput. C-31, 2 (Feb.).Google Scholar
- PEASE, M. C. 1977. The indirect binary n-cube microprocessor array. IEEE Trans Comput C-26, 5 (May).Google Scholar
- PREPARATA, F. P. 1978. New parallel sorting schemes. IEEE Trans. Comput. C-27, 7 (July).Google Scholar
- PREPARATA, F. P., AND VUILLEMIN, j. 1979. The cube-connected-cycles. In Proceedings of the 20th Symposium on Foundations of Computer Science.Google Scholar
- SELiNGER, P. G., ASTRAHAN, M. M, CHAMBERLIN, D D., LORm, R. A., AND PRICE, T. G. 1979. Access path selection m a relational database system. In Proceedings of the A CM SIGMOD International Conference on Management of Data (Boston, Mass., May 30-June 1). ACM, New York, pp. 23-34. Google Scholar
- SHILOACtl, ~, AND VISHKIN, U. 1981. Finding the maximum, merging and sorting in a parallel computation model. J Algortthrns 2, 1 (Mar.).Google Scholar
- SIEGEL, H. J. 1977. The umversahty of various types of SIMD machine interconnection networks. In Proceedings of the 4th Annual Syrnposzurn on Computer Archttecture (Silver Spring, Md., Mar. 23-25). ACM SIGARCH/IEEE-CS, New York. Google Scholar
- SIEGEL, $. J. 1979. Interconnection networks for SIMD machines. IEEE Comput 12, 6 (June).Google Scholar
- STONE, $. S. 1971 Parallel processing with the perfect shuffle IEEE Trans Cornput C-20, 2 (Feb.).Google Scholar
- THOMPSON, C. D. 1980. A complexity theory for VLSI. Ph.D. dissertation, Tech. Rep. CMU-CS- 80-140, Computer Scmnce Dept, Carnegm-Mellon Univ, (Aug.). Google Scholar
- THOMPSON, C. D. 1983. The VLSI complexity of sorting. IEEE Trans Comput C-32, 12 (Dec.).Google Scholar
- THOMPSON, C. D., AND KUNG, H T 1977 Sorting on a mesh-connected parallel computer. Comrnun. ACM 20, 4 (Apr.), 263-271. Google Scholar
- VALIANT, L G. 1975 Parallehsm in comparison problems. SIAM J Cornput 3, 4 (Sept.).Google Scholar
- VAN VOORHIS, D. C. 1971. On sorting networks. Ph.D. dissertation, Computer Science Dept., Stanford Umv, Stanford, Calif.Google Scholar
- VISHKIN U. 1981 Synchronized parallel computation. Ph.D. dissertation, Computer Science Dept., Technion--israel Institute of Technology, Halfa, Israel.Google Scholar
- YASUURA, H., TAKAGI, N., AND YAJIMA, S 1982. The parallel enumeration sorting scheme for VLSI. IEEE Trans Comput C-31, 12 (Dec.).Google Scholar
Recommendations
Parallel database sorting
Sorting in database processing is frequently required through the use of Order By and Distinct clauses in SQL. Sorting is also widely known in computer science community at large. Sorting in general covers internal and external sorting. Past published ...
Approximate non-dominated sorting for evolutionary many-objective optimization
Non-dominated sorting has widely been adopted and shown to be very effective in dominance based evolutionary multi-objective optimization where the number of objectives is two or three. In dealing with many-objective optimization problems, where the ...
An Efficient General In-Place Parallel Sorting Scheme
We present a simple and general parallel sorting scheme, ZZ-sort, which can be used to derive a class of efficient in-place sorting algorithms on realistic parallel machine models. We prove a tight bound for the worst case performance of ZZ-sort. We ...
Reviews
Colin Whitby-Strevens
The dry-sounding title belies an excellent survey paper. The paper clarifies parallel sorting techniques into those implemented on sorting networks, those implemented on shared-memory multiprocessors, and those implemented on file stores. Also discussed is the potential of hardware sorters designed to exploit VLSI and bubble storage. The strengths of the paper lie in its strong sense of relevance to reality, in its realization that technology is moving fast, and its realization that the subject under discussion is immature. The paper is peppered with spicy comments such as “However, the assumptions . . . do not consider the constraints imposed by technology”; “research . . . is based on the assumption of unlimited parallelism”; and “it is premature to determine whether advances in technology will be able to provide for intelligent mass-storage devices with sorting capabilities.” Those looking for a rigorous comparative analysis will not find it in this survey paper. However, in the opinion of this reviewer, the main weakness of the paper lies in the context in which the topic is placed. The authors briefly speculate on whether advances in computer technology could reduce use of sorting as a tool for performing other operations (e.g., searching), but the thrust of the paper is to regard sorting as an end in itself. The resulting emphasis is unfortunate (and this must be a criticism of the research being reviewed, not just the survey paper). If parallelism is to be used for sorting, then it will undoubtedly be used for these “other operations.” This fundamentally impacts on the requirements for sorting, and the paper takes no account of this.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments