Abstract
A correction network C is introduced that can be added to an arbitrary N input sorting net in order to achieve single fault tolerance. Multiple (m) fault robustness ist attained by adding Cm. For single fault correction C is proved to be assymptotically optimal.
Preview
Unable to display preview. Download preview PDF.
References
Batcher, K.E., Sorting Networks and Their Applications, AFIPS Spring Joint Computer Conference, Vol 23, 307–314, (1968)
Dowd. M., Perl. Y., Rudolph. L., Saks. M., The Balanced Sorting Network. in Proc. ACM Princ. Distrib. Comput., 161–172, (1983)
Knuth, D.E., The Art of Computer Programming, Vol 3. Sorting and Searching, Addison Wesley (1973)
Rudolph, L., A Robust Sorting Network. IEEE Trans. Comput.. C-34. 326–335, (1985)
Schimmler, M., Starke, C., A Correction Network for N-Sorters. Technical Report 8714, Institut für Informatik und Praktische Mathematik, Kiel, W.-Germany, (1987)
Yao, A.C., Yao, F.E., On Fault Tolerant Networks for Sorting, SIAM J. on Comput., Vol 14, 120–128, (1985)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schimmler, M., Starke, C. (1988). A correction network for N-sorters. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040411
Download citation
DOI: https://doi.org/10.1007/BFb0040411
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96818-6
Online ISBN: 978-0-387-34770-7
eBook Packages: Springer Book Archive