Abstract
This paper presents the hardware realization of a recurrent scalable sorting network based on Batcher’s bitonic algorithm, which is very suitable for concurrently accessible data. Firstly, preserving the time complexity of the original bitonic sorter, the recurrent network yields a lower area complexity by reducing the communication within the network and minimizes the cost in terms of hardware resources. Secondly, an enhancement of the input registers allows the reuse of the same architecture for different input widths, where the role of each comparator level is redistributed over the network. Finally, the implementation of such a sorter has been realized in an FPGA (Field Programmable Gate Array) and shows how applications treating data block-wise can benefit from this architecture.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahmadi, D., Denzel, W.E.: A Survey of Modem High-Performance Switching Techniques. IEEE Jal. on Selected Areas in Comm. 7(7), 1091–1103 (1989)
Ajtai, M., Komlos, J., Szemeredi, E.: An O(N log N) Sorting Network. In: Proceedings of the 15th Annual Symposium on Theory of Computing, pp.1–9 (1983)
Batcher, K.E.: Sorting Networks and Their Applications. In: Proceedings of the Spring Joint Computer Conference, AFIPS, vol. 32, pp. 307–314 (1968)
Claessen, K., Sheeran, M., Singh, S.: The design and verification of a sorter core. In: Margaria, T., Melham, T.F. (eds.) CHARME 2001. LNCS, vol. 2144, pp. 355–369. Springer, Heidelberg (2001)
Knuth, D.E.: The Art of Computer Programming, 2nd edn. Sorting and Searching. ch. 5.3: Optimum Sorting, vol. 3. Addison Wesley, Reading (1997)
Kozyrakis, C., Patterson, D.: Vector Vs. Superscalar and VLIW Architectures for Embedded Multimedia Benchmarks. In: Proceedings of the 35th International Symposium on Microarchitecture, pp. 283–293. ACM/IEEE (2002)
Lee, J.D., Batcher, K.E.: Minimizing Communication in the Bitonic Sort. IEEE Transactions on Parallel and Distributed Systems 11(5), 459–474 (2000)
Leighton, F.: Tight Bounds on the Complexity of Parallel Sorting. IEEE Transactions on Computers 34(4), 344–354 (1985)
Nakatani, T., Shing-Tsaan, H., Arden, B., Tripathi, S.: K-Way Bitonic Sort. IEEE Transactions on Computers 38(2), 283–288 (1989)
Sharma, N.K.: Modular Design of a Large Sorting Network. In: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks, pp. 362–368. IEEE, Los Alamitos (1997)
Stone, H.S.: Parallel processing with the perfect shuffle. IEEE Transactions on Computers C-20, 153–161 (1971)
Westermann, R., Ertl, T.: Efficiently Using Graphics Hardware in Volume Rendering Applications. In: Proceedings of the 25th International Conference on Computer Graphics and Interactive Techniques, vol. 32(4), pp. 169–179 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Layer, C., Pfleiderer, HJ. (2004). A Reconfigurable Recurrent Bitonic Sorting Network for Concurrently Accessible Data. In: Becker, J., Platzner, M., Vernalde, S. (eds) Field Programmable Logic and Application. FPL 2004. Lecture Notes in Computer Science, vol 3203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30117-2_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-30117-2_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22989-6
Online ISBN: 978-3-540-30117-2
eBook Packages: Springer Book Archive