Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Sorting it out in Hardware: A State-of-the-Art Survey (2310.07903v1)

Published 11 Oct 2023 in cs.AR and cs.ET

Abstract: Sorting is a fundamental operation in various applications and a traditional research topic in computer science. Improving the performance of sorting operations can have a significant impact on many application domains. For high-performance sorting, much attention has been paid to hardware-based solutions. These are often realized with application-specific integrated circuits (ASICs) or field-programmable gate arrays (FPGAs). Recently, in-memory sorting solutions have also been proposed to address the movement cost issue between memory and processing units, also known as Von Neumann bottleneck. Due to the complexity of the sorting algorithms, achieving an efficient hardware implementation for sorting data is challenging. A large body of prior solutions is built on compare-and-swap (CAS) units. These are categorized as comparison-based sorting. Some recent solutions offer comparison-free sorting. In this survey, we review the latest works in the area of hardware-based sorting. We also discuss the recent hardware solutions for partial and stream sorting. Finally, we will discuss some important concerns that need to be considered in the future designs of sorting systems.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (115)
  1. W. Fan and A. Bifet, “Mining big data: Current status, and forecast to the future,” SIGKDD Explor. Newsl., vol. 14, p. 1–5, apr 2013.
  2. D. J. Mankowitz, A. Michi, A. Zhernov, M. Gelmi, M. Selvi, C. Paduraru, E. Leurent, S. Iqbal, J.-B. Lespiau, A. Ahern, et al., “Faster sorting algorithms discovered using deep reinforcement learning,” Nature, vol. 618, no. 7964, pp. 257–263, 2023.
  3. S. Pang, J. Wang, and X. Yi, “Application of loan lost-linking customer path correlated index model and network sorting search algorithm based on big data environment,” Neural Comp. and Apps., pp. 1–28, 2022.
  4. T. Do, G. Graefe, and J. Naughton, “Efficient sorting, duplicate removal, grouping, and aggregation,” ACM Trans. Database Syst., vol. 47, jan 2023.
  5. M. L. Dezaki, S. Hatami, A. Zolfagharian, and M. Bodaghi, “A pneumatic conveyor robot for color detection and sorting,” Cognitive Robotics, vol. 2, pp. 60–72, 2022.
  6. G. Montesdeoca, V. Asanza, K. Chica, and D. H. Peluffo-Ordóñez, “Analysis of sorting algorithms using a wsn and environmental pollution data based on fpga,” in 2022 International Conference on Applied Electronics (AE), pp. 1–4, 2022.
  7. S. Shirvani Moghaddam and K. Shirvani Moghaddam, “A threshold-based sorting algorithm for dense wireless sensor systems and communication networks,” IET Wireless Sensor Systems, vol. 13, no. 2, pp. 37–47, 2023.
  8. W. Guo and S. Li, “Fast binary counters and compressors generated by sorting network,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 29, no. 6, pp. 1220–1230, 2021.
  9. C. Kotropoulos, M. Pappas, and I. Pitas, “Sorting networks using l/sub p/ mean comparators for signal processing applications,” IEEE Trans. on Signal Processing, vol. 50, no. 11, pp. 2716–2729, 2002.
  10. C.-Y. Lu and C.-M. Wu, “A hardware design approach of sorting for flexray-based clock synchronization,” in 2011 IEEE/SICE International Symposium on System Integration (SII), pp. 1400–1405, 2011.
  11. A. Ivanov, D. Yarotsky, M. Stoliarenko, and A. Frolov, “Smart sorting in massive mimo detection,” in 2018 14th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), pp. 1–6, 2018.
  12. J. Munro and M. Paterson, “Selection and sorting with limited storage,” Theoretical Computer Science, vol. 12, no. 3, pp. 315–323, 1980.
  13. H. Chen, S. Madaminov, M. Ferdman, and P. Milder, “Fpga-accelerated samplesort for large data sets,” in ACM/SIGDA Int. Symp. on Field-Prog. Gate Arrays, p. 222–232, 2020.
  14. M. OrHai and C. Teuscher, “Spatial sorting algorithms for parallel computing in networks,” in 2011 Fifth IEEE Conference on Self-Adaptive and Self-Organizing Systems Workshops, pp. 73–78, 2011.
  15. W. Teich and H. C. Zeidler, “Data handling and dedicated hardware for the sort problem,” in Database Machines (H.-O. Leilich and M. Missikoff, eds.), (Berlin, Heidelberg), pp. 205–226, Springer Berlin Heidelberg, 1983.
  16. G. Graefe, “Implementing sorting in database systems,” ACM Comput. Surv., vol. 38, no. 3, p. 10–es, 2006.
  17. A. C. Arpaci-Dusseau, R. H. Arpaci-Dusseau, D. E. Culler, J. M. Hellerstein, and D. A. Patterson, “High-performance sorting on networks of workstations,” SIGMOD Rec., vol. 26, p. 243–254, jun 1997.
  18. B. Shang, R. Crowder, and K.-P. Zauner, “Swarm behavioral sorting based on robotic hardware variation,” in 2014 4th International Conference On Simulation And Modeling Methodologies, Technologies And Applications (SIMULTECH), pp. 631–636, 2014.
  19. H. Bui, H. Nguyen, H. M. La, and S. Li, “A deep learning-based autonomous robotmanipulator for sorting application,” CoRR, vol. abs/2009.03565, 2020.
  20. D. Guo, H. Liu, and F. Sun, “Audio–visual language instruction understanding for robotic sorting,” Robotics and Autonomous Systems, vol. 159, p. 104271, 2023.
  21. A. S. Shaikat, S. Akter, and U. Salma, “Computer vision based industrial robotic arm for sorting objects by color and height,” Journal of Engineering Advancements, vol. 1, p. 116–122, Dec. 2020.
  22. Y. Tang, D. Huang, R. Li, and Z. Huang, “A non-dominated sorting genetic algorithm based on voronoi diagram for deployment of wireless sensor networks on 3-d terrains,” Electronics, vol. 11, no. 19, 2022.
  23. J. L. Bordim, K. Nakano, and H. Shen, “Sorting on single-channel wireless sensor networks,” in Proceedings 2002 International Symposium on Parallel Architectures, Algorithms, and Networks, (Los Alamitos, CA, USA), p. 0153, IEEE Computer Society, may 2002.
  24. M. Singh and V. K. Prasanna, “Energy-optimal and energy-balanced sorting in a single-hop wireless sensor network,” in Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003)., 2003.
  25. M. Moshref, R. Al-Sayyed, and S. Al-Sharaeh, “An enhanced multi-objective non-dominated sorting genetic routing algorithm for improving the qos in wireless sensor networks,” IEEE Access, vol. 9, pp. 149176–149195, 2021.
  26. S.-H. Shiau and C.-B. Yang, “A fast sorting algorithm and its generalization on broadcast communications,” in Computing and Combinatorics (D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, and A. Sharma, eds.), pp. 252–261, 2000.
  27. K. Chi, J. Shen, Y. Li, Y. Li, and S. Wang, “Multi-function radar signal sorting based on complex network,” IEEE Signal Processing Letters, vol. 28, pp. 91–95, 2021.
  28. J. Wang, C. Hou, and F. Qu, “Multi-threshold fuzzy clustering sorting algorithm,” in 2017 Progress In Electromagnetics Research Symposium - Spring (PIERS), pp. 889–892, 2017.
  29. S.-H. Shiau and C.-B. Yang, “Generalization of sorting in single hop wireless networks,” IEICE Trans. Inf. Syst., vol. 89-D, pp. 1432–1439, 2006.
  30. B. Abbasi, J. Calder, and A. M. Oberman, “Anomaly detection and classification for streaming data using pdes,” SIAM Journal on Applied Mathematics, vol. 78, p. 921–941, Jan 2018.
  31. X. Zhang, H. Zhang, S. Song, X. Huang, C. Wang, and J. Wang, “Backward-sort for time series in apache iotdb,” in 2023 IEEE 39th Intern. Conf. on Data Engineering (ICDE), pp. 3196–3208, 2023.
  32. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: Nsga-ii,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002.
  33. B. C. L. Ramírez, G. Guzmán, W. Alhalabi, N. Cruz-Cortés, M. Torres-Ruiz, and M. Moreno-Ibarra, “On the usage of sorting networks to control greenhouse climatic factors,” International Journal of Distributed Sensor Networks, vol. 14, no. 2, p. 1550147718756871, 2018.
  34. W. Chen, Y. Liu, Z. Chen, F. Liu, and N. Xiao, “External sorting algorithm: State-of-the-art and future directions,” IOP Conf. Series: Materials Science and Engineering, vol. 806, p. 012040, apr 2020.
  35. Y. Ben Jmaa, R. Ben Atitallah, D. Duvivier, and M. Ben Jemaa, “A comparative study of sorting algorithms with fpga acceleration by high level synthesis,” Comp. y Sistemas, vol. 23, pp. 213–230, 2019.
  36. I. Skliarova, “A survey of network-based hardware accelerators,” Electronics, vol. 11, no. 7, 2022.
  37. R. Ali, “Hardware solution to sorting algorithms: A review,” Turkish Journal of Computer and Mathematics Education (TURCOMAT), vol. 13, no. 2, pp. 254–272, 2022.
  38. D. P. Singh, I. Joshi, and J. Choudhary, “Survey of gpu based sorting algorithms,” Int. J. Parallel Program., vol. 46, p. 1017–1034, dec 2018.
  39. A. Farmahini-Farahani, H. J. Duwe III, M. J. Schulte, and K. Compton, “Modular design of high-throughput, low-latency sorting units,” IEEE Transactions on Computers, vol. 62, no. 7, pp. 1389–1402, 2013.
  40. M. H. Najafi, D. J. Lilja, M. D. Riedel, and K. Bazargan, “Low-cost sorting network circuits using unary processing,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 26, no. 8, pp. 1471–1480, 2018.
  41. H. H. Draz, N. E. Elashker, and M. M. A. Mahmoud, “Optimized algorithms and hardware implementation of median filter for image processing,” Circuits, Systems, and Signal Processing, vol. 42, pp. 5545–5558, Apr 2023.
  42. J. Chhugani, A. D. Nguyen, V. W. Lee, W. Macy, M. Hagog, Y.-K. Chen, A. Baransi, S. Kumar, and P. Dubey, “Efficient implementation of sorting on multi-core simd cpu architecture,” Proc. VLDB Endow., vol. 1, p. 1313–1324, aug 2008.
  43. S. Abdel-Hafeez and A. Gordon-Ross, “An efficient o(n𝑛nitalic_n) comparison-free sorting algorithm,” IEEE Transactions on Very Large Scale Integration Sys., vol. 25, no. 6, pp. 1930–1942, 2017.
  44. S. S. Ray and S. Ghosh, “k-degree parallel comparison-free hardware sorter for complete sorting,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pp. 1–1, 2022.
  45. S.-H. Lin, P.-Y. Chen, and Y.-N. Lin, “Hardware design of low-power high-throughput sorting unit,” IEEE Transactions on Computers, vol. 66, no. 8, pp. 1383–1395, 2017.
  46. A. Norollah, D. Derafshi, H. Beitollahi, and M. Fazeli, “Rths: A low-cost high-performance real-time hardware sorter, using a multidimensional sorting algorithm,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 27, no. 7, pp. 1601–1613, 2019.
  47. P. T. Jelodari, M. P. Kordasiabi, S. Sheikhaei, and B. Forouzandeh, “An o(1) time complexity sorting network for small number of inputs with hardware implementation,” Microprocessors and Microsystems, vol. 77, p. 103203, 2020.
  48. P. Papaphilippou, C. Brooks, and W. Luk, “An adaptable high-throughput fpga merge sorter for accelerating database analytics,” in 2020 30th International Conference on Field-Programmable Logic and Applications (FPL), pp. 65–72, 2020.
  49. P. Papaphilippou, C. Brooks, and W. Luk, “Flims: Fast lightweight merge sorter,” in 2018 International Conference on Field-Programmable Technology (FPT), pp. 78–85, IEEE, 2018.
  50. P. Preethi, K. Mohan, K. Sudeendra Kumar, and K. K. Mahapatra, “Low power sorters using clock gating,” in 2021 IEEE International Symposium on Smart Electronic Systems (iSES), pp. 6–11, 2021.
  51. B. Prince, M. H. Najafi, and B. Li, “Scalable low-cost sorting network with weighted bit-streams,” in 2023 24th International Symposium on Quality Electronic Design (ISQED), pp. 1–6, IEEE, 2023.
  52. T. Bhargav and E. Prabhu, “Power and area efficient fsm with comparison-free sorting algorithm for write-evaluate phase and read-sort phase,” in Advances in Signal Processing and Intelligent Recognition Systems: 4th International Symposium SIRS 2018, Bangalore, India, pp. 433–442, Springer, 2019.
  53. W.-T. Chen, R.-D. Chen, P.-Y. Chen, and Y.-C. Hsiao, “A high-performance bidirectional architecture for the quasi-comparison-free sorting algorithm,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 68, no. 4, pp. 1493–1506, 2021.
  54. G. C. Sri, S. A. K. V. Hanuma, N. Harshita, and S. Agrawal, “An efficient quasi comparison-free bidirectional architecture for sorting algorithm,” in 2022 IEEE 3rd Global Conference for Advancement in Technology (GCAT), pp. 1–8, 2022.
  55. A. H. Jalilvand, S. N. Estiri, S. Naderi, M. H. Najafi, and M. Imani, “A fast and low-cost comparison-free sorting engine with unary computing: Late breaking results,” in the 59th ACM/IEEE Design Automation Conference, DAC ’22, p. 1390–1391, 2022.
  56. B. Yu, T. Mak, X. Li, F. Xia, A. Yakovlev, Y. Sun, and C.-S. Poon, “Real-time fpga-based multichannel spike sorting using hebbian eigenfilters,” IEEE Journal on Emerging and Selected Topics in Circuits and Systems, vol. 1, no. 4, pp. 502–515, 2011.
  57. G. Campobello, G. Patanè, and M. Russo, “On the complexity of min–max sorting networks,” Info. Sci., vol. 190, pp. 178–191, 2012.
  58. J. Subramaniam, J. Raju, and D. Ebenezer, “Fast median-finding word comparator array,” Elect. Lett., vol. 53, no. 21, pp. 1402–1404, 2017.
  59. U. A. Korat, P. Yadav, and H. Shah, “An efficient hardware implementation of vector-based odd-even merge sorting,” in IEEE 8th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference (UEMCON), pp. 654–657, 2017.
  60. D. Valencia and A. Alimohammad, “An efficient hardware architecture for template matching-based spike sorting,” IEEE Transactions on Biomedical Circuits and Systems, vol. 13, no. 3, pp. 481–492, 2019.
  61. F. Zhang, S. Angizi, and D. Fan, “Max-pim: Fast and efficient max/min searching in dram,” in 58th Design Automation Conference DAC, pp. 211–216, 2021.
  62. D. Yan, W.-X. Wang, L. Zuo, and X.-W. Zhang, “A novel scheme for real-time max/min-set-selection sorters on fpga,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 68, no. 7, pp. 2665–2669, 2021.
  63. C.-H. Wu and K.-Y. Huang, “Data sorting in flash memory,” ACM Transactions on Storage (TOS), vol. 11, no. 2, pp. 1–25, 2015.
  64. N. Samardzic, W. Qiao, V. Aggarwal, M.-C. F. Chang, and J. Cong, “Bonsai: High-performance adaptive merge tree sorting,” in 2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA), pp. 282–294, IEEE, 2020.
  65. Z. Li, N. Challapalle, A. K. Ramanathan, and V. Narayanan, “Imc-sort: In-memory parallel sorting architecture using hybrid memory cube,” in the 2020 on Great Lakes Symposium on VLSI, pp. 45–50, 2020.
  66. A. K. Prasad, M. Rezaalipour, M. Dehyadegari, and M. N. Bojnordi, “Memristive data ranking,” in 2021 IEEE International Symposium on High Performance Computer Architecture (HPCA), (Seoul, South Korea), pp. 440–452, 2021.
  67. Z. Chu, Y. Luo, P. Jin, and S. Wan, “Nvmsorting: Efficient sorting on non-volatile memory,” in The 33rd International Conference on Software Engineering & Knowledge Engineering (SEKE 2021), 2021.
  68. M. R. Alam, M. H. Najafi, and N. Taherinejad, “Sorting in memristive memory,” ACM Journal on Emerging Technologies in Computing Systems (JETC), vol. 18, no. 4, pp. 1–21, 2022.
  69. L. Yu, Z. Jing, Y. Yang, and Y. Tao, “Fast and scalable memristive in-memory sorting with column-skipping algorithm,” in 2022 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 590–594, IEEE, 2022.
  70. F. Zokaee, F. Chen, G. Sun, and L. Jiang, “Sky-sorter: A processing-in-memory architecture for large-scale sorting,” IEEE Transactions on Computers, vol. 72, no. 2, pp. 480–493, 2022.
  71. M. Lenjani, A. Ahmed, and K. Skadron, “Pulley: An algorithm/hardware co-optimization for in-memory sorting,” IEEE Computer Architecture Letters, vol. 21, no. 2, pp. 109–112, 2022.
  72. M. Lenjani, P. Gonzalez, E. Sadredini, S. Li, Y. Xie, A. Akel, S. Eilert, M. R. Stan, and K. Skadron, “Fulcrum: A simplified control and access mechanism toward flexible and practical in-situ accelerators,” in 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp. 556–569, IEEE, 2020.
  73. Y. Liu, Y. Ou, W. Chen, Z. Chen, and N. Xiao, “Lazysort: A customized sorting algorithm for non-volatile memory,” Info. Sci., vol. 641, p. 119137, 2023.
  74. A. Rjabov, “Hardware-based systems for partial sorting of streaming data,” in 2016 15th Biennial Baltic Electronics Conference (BEC), pp. 59–62, 2016.
  75. J. M. Chambers, “Algorithm 410: Partial sorting,” Commun. ACM, vol. 14, p. 357–358, may 1971.
  76. M. H. Najafi, D. J. Lilja, M. Riedel, and K. Bazargan, “Power and area efficient sorting networks using unary processing,” in 2017 IEEE Intern. Conf. on Computer Design (ICCD), pp. 125–128, 2017.
  77. S. Ghosh, S. Dasgupta, and S. S. Ray, “A comparison-free hardware sorting engine,” in 2019 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), pp. 586–591, IEEE, 2019.
  78. A. H. Jalilvand, M. H. Najafi, and M. Fazeli, “Fuzzy-logic using unary bit-stream processing,” in 2020 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1–5, IEEE, 2020.
  79. M. Najafi, A. H. Jalilvand, and M. Fazeli, “Method and architecture for fuzzy-logic using unary processing,” Dec. 9 2021. US Patent App. 17/340,834.
  80. M. Yoon, “A novel architecture of asynchronous sorting engine module for asic design,” JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, vol. 22, no. 4, pp. 224–233, 2022.
  81. X. Wu, V. Kumar, J. Ross Quinlan, J. Ghosh, Q. Yang, H. Motoda, G. J. McLachlan, A. Ng, B. Liu, P. S. Yu, Z.-H. Zhou, M. Steinbach, D. J. Hand, and D. Steinberg, “Top 10 algorithms in data mining,” Knowledge and Information Systems, vol. 14, pp. 1–37, Jan. 2008.
  82. B. Yuce, H. F. Ugurdag, S. Gören, and G. Dundar, “A fast circuit topology for finding the maximum of n k-bit numbers,” in 2013 IEEE 21st Symposium on Computer Arithmetic, pp. 59–66, 2013.
  83. V. Seshadri, D. Lee, T. Mullins, H. Hassan, A. Boroumand, J. Kim, M. A. Kozuch, O. Mutlu, P. B. Gibbons, and T. C. Mowry, “Ambit: In-memory accelerator for bulk bitwise operations using commodity dram technology,” in 50th IEEE/ACM MICRO, pp. 273–287, 2017.
  84. S. Angizi and D. Fan, “Accelerating bulk bit-wise x(n)or operation in processing-in-dram platform,” 2019. arXiv, https://arxiv.org/abs/1904.05782.
  85. J. O. Cadenas, G. M. Megson, and R. S. Sherratt, “Median filter architecture by accumulative parallel counters,” IEEE Trans. on Circuits and Systems II: Express Briefs, vol. 62, no. 7, pp. 661–665, 2015.
  86. J. O. Cadenas, G. M. Megson, R. S. Sherratt, and P. Huerta, “Fast median calculation method,” Electronics Letters, vol. 48, pp. 558–560(2), May 2012.
  87. P. Mitra and H. Bokil, Observed brain dynamics. New York, NY: Oxford University Press, Jan. 2008.
  88. T. Zhang, C. Lammie, M. R. Azghadi, A. Amirsoleimani, M. Ahmadi, and R. Genov, “Toward a formalized approach for spike sorting algorithms and hardware evaluation,” 2022 IEEE MWSCAS, Aug 2022.
  89. S. Gibson, J. W. Judy, and D. Marković, “Spike sorting: The first step in decoding the brain: The first step in decoding the brain,” IEEE Signal Processing Magazine, vol. 29, no. 1, pp. 124–143, 2012.
  90. B. P. Christie, D. M. Tat, Z. T. Irwin, V. Gilja, P. Nuyujukian, J. D. Foster, S. I. Ryu, K. V. Shenoy, D. E. Thompson, and C. A. Chestek, “Comparison of spike sorting and thresholding of voltage waveforms for intracortical brain-machine interface performance,” J Neural Eng, vol. 12, p. 016009, Dec. 2014.
  91. M. Godfrey and D. Hendry, “The computer as von neumann planned it,” IEEE Annals of the History of Computing, vol. 15, pp. 11–21, 1993.
  92. P. Trancoso, “Moving to memoryland: in-memory computation for existing applications,” in Proceedings of the 12th ACM International Conference on Computing Frontiers, pp. 1–6, 2015.
  93. K. A. Ali, A. Baghdadi, E. Dupraz, M. Leonardon, M. Rizk, and J. Diguet, “Mol-based in-memory computing of binary neural networks,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 30, pp. 869–880, jul 2022.
  94. A. Laga, J. Boukhobza, F. Singhoff, and M. Koskas, “Montres : Merge on-the-run external sorting algorithm for large data volumes on ssd based storage systems,” IEEE Transactions on Computers, vol. 66, no. 10, pp. 1689–1702, 2017.
  95. S. D. Viglas, “Write-limited sorts and joins for persistent memory,” Proceedings of the VLDB Endowment, vol. 7, no. 5, pp. 413–424, 2014.
  96. A. Farmahini-Farahani, H. J. Duwe III, M. J. Schulte, and K. Compton, “Modular design of high-throughput, low-latency sorting units,” IEEE Transactions on Computers, vol. 62, no. 7, pp. 1389–1402, 2012.
  97. S. H. Pugsley, A. Deb, R. Balasubramonian, and F. Li, “Fixed-function hardware sorting accelerators for near data mapreduce execution,” in 2015 33rd IEEE International Conference on Computer Design (ICCD), pp. 439–442, IEEE, 2015.
  98. S. Zhou, C. Chelmis, and V. K. Prasanna, “High-throughput and energy-efficient graph processing on fpga,” in 2016 IEEE 24th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), pp. 103–110, IEEE, 2016.
  99. A. Srivastava, R. Chen, V. K. Prasanna, and C. Chelmis, “A hybrid design for high performance large-scale sorting on fpga,” in IEEE 2015 ReConFig, pp. 1–6, 2015.
  100. J. Borghetti, G. S. Snider, P. J. Kuekes, J. J. Yang, D. R. Stewart, and R. S. Williams, “Memristive switches enable stateful logic operations via material implication,” Nature, vol. 464, no. 7290, 2010.
  101. S. Kvatinsky, D. Belousov, S. Liman, G. Satat, N. Wald, E. G. Friedman, A. Kolodny, and U. C. Weiser, “Magic—memristor-aided logic,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 61, no. 11, pp. 895–899, 2014.
  102. S. Gupta, M. Imani, and T. Rosing, “Felix: Fast and energy-efficient logic in memory,” in 2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pp. 1–7, IEEE, 2018.
  103. M. Zuluaga, P. Milder, and M. Püschel, “Streaming sorting networks,” ACM Transactions on Design Automation of Electronic Systems, vol. 21, no. 4, 2016.
  104. K. E. Batcher, “Sorting networks and their applications,” p. 307–314, 1968.
  105. H. Stone, “Parallel processing with the perfect shuffle,” IEEE Transactions on Computers, vol. C-20, no. 2, pp. 153–161, 1971.
  106. D. E. Knuth, The art of computer programming. Addison-Wesley Pub. Co., 1968.
  107. M. Ajtai, J. Komlós, and E. Szemerédi, “An 0(n log n) sorting network,” in Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, p. 1–9, 1983.
  108. C. Y. Lee and J. M. Tsai, “A shift register architecture for high-speed data sorting,” Journal of VLSI signal processing systems for signal, image and video technology, vol. 11, pp. 273–280, Dec 1995.
  109. R. Perez-Andrade, R. Cumplido, C. Feregrino-Uribe, and F. Martin Del Campo, “A versatile linear insertion sorter based on an fifo scheme,” Microelectronics Journal, vol. 40, no. 12, pp. 1705–1713, 2009.
  110. J. Ortiz and D. Andrews, “A configurable high-throughput linear sorter system,” in 2010 IEEE International Symp. on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), pp. 1–8, 2010.
  111. I. Scherson and S. Sen, “Parallel sorting in two-dimensional vlsi models of computation,” IEEE Transactions on Computers, vol. 38, no. 2, pp. 238–249, 1989.
  112. R. Chen and V. K. Prasanna, “Computer generation of high throughput and memory efficient sorting designs on fpga,” IEEE Transactions on Parallel and Distributed Systems, vol. 28, no. 11, pp. 3100–3113, 2017.
  113. M. Petrović and V. Milovanović, “A chisel generator of parameterizable and runtime reconfigurable linear insertion streaming sorters,” in 2021 IEEE 32nd International Conference on Microelectronics (MIEL), pp. 251–254, 2021.
  114. M. H. Najafi, D. Jenson, D. J. Lilja, and M. D. Riedel, “Performing stochastic computation deterministically,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 27, no. 12, pp. 2925–2938, 2019.
  115. S. Aygun, M. S. Moghadam, M. H. Najafi, and M. Imani, “Learning from hypervectors: A survey on hypervector encoding,” arXiv preprint arXiv:2308.00685, 2023.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now