DocumentCode
2980801
Title
Multilevel models for data processing
Author
Sklyarov, Valery ; Skliarova, Iouliia ; Mihhailov, Dmitri ; Sudnitson, Alexander
Author_Institution
DETI/IEETA, Univ. of Aveiro, Aveiro, Portugal
fYear
2011
fDate
19-22 Feb. 2011
Firstpage
136
Lastpage
139
Abstract
The paper suggests multilevel models for data processing and demonstrates advantages of such models on examples of data sorting. Three different techniques are discussed, namely graph walk, using tree-like structures and sorting networks. The relevant implementations were done on the basis of hierarchical finite state machines and verified in commercially available FPGAs. Experiments and comparisons demonstrate that the results enable the performance of processing for different types of data to be increased compared to known implementations.
Keywords
data models; field programmable gate arrays; sorting; tree data structures; FPGA; data model; data processing; data sorting; field programmable gate arrays; finite state machine; graph walk; multilevel model; sorting networks; tree-like structure; Computers; Data models; Data processing; Field programmable gate arrays; Hardware; Indexes; Sorting; Algorithms; Data models; Data processing; Field programmable gate arrays; Trees;
fLanguage
English
Publisher
ieee
Conference_Titel
GCC Conference and Exhibition (GCC), 2011 IEEE
Conference_Location
Dubai
Print_ISBN
978-1-61284-118-2
Type
conf
DOI
10.1109/IEEEGCC.2011.5752494
Filename
5752494
Link To Document