Abstract
Much research has been done on sorting networks but there are very few results concerning their robustness. Our starting point is the balanced sorting network introduced by Dowd et al. and its single-block robust design of Rudolph obtained at the cost of some redundancy and two permuters external to the network. In this article we introduce a new implementation which is more robust than Rudolph's network and needs no redundancy or external permuters. We also consider a class of single-stage designs with redundancy and compare the characteristics of networks discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Rudolph, “A robust sorting network,” IEEE Trans. Computers C-34 (4): 326–335, 1985.
K.E. Batcher, “Sorting networks and their applications,” Proc. AFIPS Spring Joint Comput. Conf 32: 307–314, 1968.
H.S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. Computers C-20 (2): 153–161, 1971.
M. Dowd, Y. Perl, L. Rudolph, and M. Saks, “The balanced sorting network,” Proc. ACM Princ. Distrib. Comput., pp. 161–172, August 1983.
D.E. Knuth, The Art of Computer Programming, vol. 3, Addison-Wesley, Reading, MA, 1968.
G.B. Adams III, et al., “A survey and comparison of fault-tolerant multistage interconnection networks,” Computer 20 (6): 14–27, 1987.
J.D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, MD, 1983.
M. Ajtai, et al., “An O(nlog n) sorting network,” Proc. 15th Annu. ACM Symp. Theory Comput., pp. 1–9, 1983.
R. Cole and A. Siege, “Optimal VLSI circuits for sorting,” Technical Report #172, Dept. of Computer Science, New York Univ., September 1985.
S.G. Akl, Parallel Sorting Algorithms, Academic Press, Orlando, FL, 1985.
T. Nakatani et al., “K-way bitonic sort,” IEEE Trans. Computers 38 (2): 283–288, 1989.
Y. Choi and M. Malek, “A fault-tolerant systolic sorter,” IEEE Trans. Computers 37 (5): 621–624, 1988.
C.E. Leiserson, “Systolic priority queues,” Proc. Caltech Conf. VLSI, pp. 199–224, January 1979.
T.-Y. Feng and C.-L. Wu, “Fault-diagnosis for a class of multistage interconnection networks,” IEEE Trans. Computers C-30 (10): 743–758, 1981.
K.E. Batcher, “The flip network in STARAN,” Proc. Intern. Conf. Parallel Processing, pp. 65–71, 1976.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sun, J., Gecsei, J. & Cerny, E. Fault-tolerance in balanced sorting networks. J Electron Test 1, 31–41 (1990). https://doi.org/10.1007/BF00134013
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00134013