Parallel join and sorting algorithms
This paper proposes parallel join and sorting algorithms which complete in steps close to log2N for N records. The algorithms are intended for data base machines. The algorithms and the required interconnection are simple and realistic. The application of the algorithms can bring a performance improvement of three to four orders of magnitude over conventional sequential data base management systems. The analysis is primarily made by simulations.
KeywordsParallel Algorithm Search Tree Regular Graph Distribution Information Sorting Algorithm
Unable to display preview. Download preview PDF.
- Batcher K. E. (1968). Sorting Networks and Their Applications. 1968 SJCC, AFIPS Proc., Vol. 32, Washington, D.C., Thompson. 1968, pp. 307–314.Google Scholar
- Bollobás B. (1978). Extremal Graph Theory. Academic Press. 1978.Google Scholar
- Harary F. and Palmer E. M. (1973). Graphical Enumeration. Academic Press, New York. 1973.Google Scholar
- Knuth D. E. (1973). The Art of Computer Programming, Vol. 3, Sorting and Searching. Addison-Wesley. 1973.Google Scholar
- Okada Y. Tajima H., and Mori R. (1976). A Novel Multiprocessor Array. Second Symposium on Micro Architecture. North-Holland Publishing, Co. 1976.Google Scholar
- Stone H. S. (1971). Parallel Processing with the Perfect Shuffle. IEEE Trans. on Computers, Vol. 1, C-20, No. 2. Feb. 1971, pp.153–161.Google Scholar
- Thompson C. D., and Kung H. T. (1977). Sorting on a Mesh Connected Parallel Computer. Comm. ACM, Vol. 20, No. 4. April 1977, pp.263–271.Google Scholar