Optimal VLSI Sorting with Reduced Number of Processors

IEEE Transactions on Computers

Volumn 40, Issue 1, 1991, Pages 105-110

  Prasanna Kumar, V K ^b  

^a KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Optimal parallel algorithms; optimal sorting; proces ; reduced VLSI architectures; row column sorting; sor time tradeoffs; techniques

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING--SORTING; INTEGRATED CIRCUITS, VLSI;

OPTIMAL SORTING; PARALLEL ALGORITHMS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0025786392     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.67326     Document Type: Article

References (23)

1. M. Ajtai, J. Komlos, and E. Szemeredi, “An O(n log n) sorting network,” in Proc. 15th Annu. Symp. Theory Comput., 1983.
2. S. G. Akl, Parallel Sorting Algorithms. New York: Academic, 1985.
3. Hussein M. Alnuweiri and V. K. Prasanna Kumar, “Efficient image computations on VLSI architectures with reduced hardware,” in Proc. IEEE Workshop Pattern Anal. Machine Intell., Seattle, 1987.
4. —, “A reduced mesh of trees organization for efficient solutions to graph problems,” Tech. Rep. CRI-87-49, USC, 1987.
5. K. E. Batcher, “Sorting networks and their applications,” in Proc. AFIPS Conf, 1968.
6. G. Baudet and D. Stevenson, “Optimal sorting algorithms for parallel computers,” IEEE Trans. Comput., vol. C-27, no. 1, Jan. 1978.
7. G. Bilardi and F. P. Preparata, “A minimum area VLSI network for O(log n) time sorting,” IEEE Trans. Comput., vol. C-34, no. 4, Apr. 1985.
8. J. Ja’Ja’ and M. Owens, “VLSI sorting with reduced hardware,” IEEE Trans. Comput., vol. C-33, no. 7, July 1984.
9. D. E. Knuth, The Art of Computer Programming. Vol. III: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
10. F. T. Leighton, “New lower bound techniques for VLSI,” in Proc. IEEE Symp. Foundations Comput. Sci., 1981.
11. F. T. Leighton, “Tight bounds on the complexity of parallel sorting,” IEEE Trans. Comput., vol. C-34, no. 4, Apr. 1985.
12. D.D. Nath, S.N. Maheshwari, and P.C.P. Bhatt, “Efficient VLSI networks for parallel processing based on orthogonal trees,” IEEE Trans. Comput., vol. C-32, no. 6, June 1983.
13. D. Nassimi and S. Sahni, “Bitonic sort on a mesh connected parallel computer,” IEEE Trans. Comput., vol. C-27, no. 1, 1979.
14. F. P. Preparata and J. Vuillemin, “The cube connected cycles: A versatile network for parallel computation,” Commun. ACM, vol. 24, no. 5, May 1981.
15. J. H. Reif and L. G. Valiant, “A logarithmic time sort for linear size networks,” J. ACM, vol. 34, no. 1, Jan. 1987.
16. I.D. Scherson, S. Sen, and A. Shamir, “Shear Sort: A true two-dimensional sorting technique for VLSI networks,” in Proc. Int. Conf. Parallel Processing, 1986.
17. H.S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. Comput., vol. C-20, no. 2, Feb. 1971.
18. C. D. Thompson, “ The VLSI complexity of sorting,” IEEE Trans. Comput., vol. C-32, no. 12, Dec. 1983.
19. C. D. Thompson and H. T. Kung, “Sorting on a mesh connected parallel computer,” Commun. ACM, vol. 20, no. 4, 1977.
20. P.S. Tseng, K. Hwang, and V. K. Prasanna Kumar, “A VLSI based multiprocessor architecture for implementing parallel algorithms,” in Proc. Conf. Parallel Processing, 1985.
21. J. Ullman, Computational Aspects of VLSI. Rockville, MD: Computer Science Press, 1984.
22. E. Upfal, “Efficient schemes for parallel communication,” J. ACM, vol. 31, no. 3, July 1984.
23. L. G. Valiant and G. Brebner, “Universal schemes for parallel communication,” in Proc. 13th Annu. ACM Symp. Theory Comput., 1981.