EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 3.0

FPGA-based Accelerators for Parallel Data Sort

Valery Sklyarov, Iouliia Skliarova, Alexander Sudnitson

Applied Computer Systems · 2014

DOI: 10.1515/acss-2014-0013 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Applied Computer Systems, 2014. Verfasst von Valery Sklyarov und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 3.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The paper is dedicated to parallel data sort based on sorting networks. The proposed methods and circuits have the following characteristics: 1) using two-level parallel comparators in even-odd transition networks with feedback to a register keeping input/intermediate data; 2) parallel merging of many sorted sequences; 3) using even-odd transition networks built from other sorting networks; 4) rational reuse of comparators in different types of networks, namely even-odd transition and for discovering maximum/minimum values. The experiments in FPGA, which were done for up to 16×2 20 32-bit data items, demonstrate very good results (as fast as 3-5 ns per data item).

Zitieren

APA

Sklyarov, V., Skliarova, I., & Sudnitson, A. (2014). FPGA-based Accelerators for Parallel Data Sort. Applied Computer Systems. https://doi.org/10.1515/acss-2014-0013

Vancouver

Sklyarov V, Skliarova I, Sudnitson A. FPGA-based Accelerators for Parallel Data Sort. Applied Computer Systems. 2014. doi:10.1515/acss-2014-0013

BibTeX
@article{Sklyarov2014,
  author = {Sklyarov, Valery and Skliarova, Iouliia and Sudnitson, Alexander},
  title = {FPGA-based Accelerators for Parallel Data Sort},
  journal = {Applied Computer Systems},
  year = {2014},
  doi = {10.1515/acss-2014-0013}
}
Kostenlos starten →