Table of Contents Author Guidelines Submit a Manuscript
International Journal of Reconfigurable Computing
Volume 2011, Article ID 963539, 12 pages
Research Article

A Streaming High-Throughput Linear Sorter System with Contention Buffering

1Information and Telecommunication Technology Center, The University of Kansas, 2335 Irving Hill Road, Lawrence, KS 66045, USA
2Computer Science and Computer Engineering, The University of Arkansas, 504 J. B. Hunt Building, Fayetteville, AR 72701, USA

Received 28 July 2010; Accepted 15 January 2011

Academic Editor: Aravind Dasu

Copyright © 2011 Jorge Ortiz and David Andrews. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. K. Batcher, “Sorting networks and their applications,” in Proceedings of the AFIPS Spring Joint Computer Conference, vol. 32, pp. 307–314, ACM, 1968.
  2. E. W. Dijkstra, “A heuristic explanation of Batcher's Baffler,” Science of Computer Programming, vol. 9, no. 3, pp. 213–220, 1987. View at Google Scholar · View at Scopus
  3. J. Ortiz and D. Andrews, “A configurable high-throughput linear sorter system,” in Proceedings of the 7th IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum (IPDPSW '10), Atlanta, Ga, USA, 2010. View at Publisher · View at Google Scholar
  4. D. E. Knuth, The Art of Computer Programming 3. Sorting and Searching, Addison-Wesley Longman, Amsterdam, The Netherlands, 2nd edition, 1998.
  5. M. de Prycker, Asynchronous Transfer Mode: Solution for Broadband ISDN, Ellis Horwood, Upper Saddle River, NJ, USA, 1991.
  6. R. O. Onvural, Asynchronous Transfer Mode Networks: Performance Issues, Artech House, Norwood, Ma, USA, 2nd edition, 1995.
  7. R. Kannan, “A pipelined single-bit controlled sorting network with O(Nlog2 N) bit complexity,” in Proceedings of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '97), vol. 1, pp. 253–260, April 1997.
  8. J. Martínez, R. Cumplido, and C. Feregrino, “An FPGA-based parallel sorting architecture for the Burrows wheeler transform,” in Proceedings of the International Conference on Reconfigurable Computing and FPGAs (ReConFig '05), pp. 7–13, September 2005. View at Publisher · View at Google Scholar
  9. N. Tabrizi and N. Bagherzadeh, “An ASIC design of a novel pipelined and parallel sorting accelerator for a multiprocessor-on-a-chip,” in Proceedings of the 6th International Conference on ASIC (ASICON '05), vol. 1, pp. 46–49, October 2005.
  10. D. Castells-Rufas, M. Monton, L. Ribas, and J. Carrabina, “High performance parallel linear sorter core design,” GSPx, The International Embedded Solutions Event, September 2004.
  11. C. Leiserson, “Systolic priority queues,” in Proceedings of the Conference on Very Large Scale Integration: Architecture, Design, Fabrication, pp. 199–214, 1979.
  12. B. Parhami and D. M. Kwai, “Data-driven control scheme for linear arrays: application to a stable insertion sorter,” IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 1, pp. 23–28, 1999. View at Google Scholar · View at Scopus
  13. Y. Zhang and S. Q. Zheng, “Design and analysis of a systolic sorting architecture,” in Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing, pp. 652–659, October 1995.
  14. M. Bednara, O. Beyer, J. Teich, and R. Wanka, “Hardware-supported sorting: design and Tradeoff analysis,” in System Design Automation: Fundamentals, Principles, Methods, Examples, p. 97, 1979. View at Google Scholar
  15. C.-S. Lin and B.-D. Liu, “Design of a pipelined and expandable sorting architecture with simple control scheme,” in Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS '02), vol. 4, pp. 217–220, 2002.
  16. R. Perez-Andrade, R. Cumplido, F. M. Del Campo, and C. Feregrino-Uribe, “A versatile linear insertion sorter based on a FIFO scheme,” in Proceedings of the IEEE Computer Society Annual Symposium on VLSI: Trends in VLSI Technology and Design (ISVLSI '08), pp. 357–362, April 2008. View at Publisher · View at Google Scholar
  17. C. Y. Lee and J. M. Tsai, “A shift register architecture for high-speed data sorting,” Journal of VLSI Signal Processing, vol. 11, no. 3, pp. 273–280, 1995. View at Publisher · View at Google Scholar · View at Scopus
  18. A. A. Colavita, A. Cicuttin, F. Fratnik, and G. Capello, “SORTCHIP: a VLSI implementation of a hardware algorithm for continuous data sorting,” IEEE Journal of Solid-State Circuits, vol. 38, no. 6, pp. 1076–1079, 2003. View at Publisher · View at Google Scholar · View at Scopus
  19. R. Marcelino, H. Neto, and J. Cardoso, “Sorting units for FPGA-based embedded systems,” in Proceedings of the IFIP 20th World Computer Congress, TC10 Working Conference on Distributed and Parallel Embedded Systems (DIPES '08), vol. 271, pp. 11–22, Springer, Milano, Italy, September 2008.
  20. L. Ribas, D. Castells, and J. Carrabina, “A linear sorter core based on a programmable register file,” in Proceedings of the 19th Conference on Design of Circuits and Integrated Systems (DCIS '04), pp. 635–640, 2004.
  21. J. Ortiz, “A reconfigurable superscalar processor architecture for FPGA-based designs,” in Proceedings of the International Conference on Computer Design (CDES '09), pp. 211–217, July 2009.
  22. J. Ortiz, Synthesis techniques for semi-custom dynamically reconfigurable superscalar processors, Ph.D. dissertation, University of Kansas, Department of Electrical Engineering and Computer Science, 2009.