|
|
Mapping of Match Tables from P4 Language to FPGA Technology
Kekely, Michal ; Matoušek, Jiří (referee) ; Kořenek, Jan (advisor)
This thesis deals with design and implementation of mapping of match action tables from P4 language to FPGA technology. Goal of the thesis was to describe key principles, which need to be understood in order to design such a mapping and function of algorithms needed, apply these principles by implementing them and analyze the speed and memory requirements of such an implementation. Outcome provides configurable hardware unit capable of classifying packets and connection between the unit and match action tables from P4 language. The implementation is based on DCFL algorithm and requires less memory compared to HiCuts and HyperCuts algorithms while being comparably fast at worst-case scenarios.
|
|
| |
|
|
Application for Detection of Plagiarism
Šalplachta, Pavel ; Techet, Jiří (referee) ; Lukáš, Roman (advisor)
Bachelor's thesis is focused on programming in language C and a method of detecting plagiarism in programs written in this language. The result of thesis is application in language C too, which according similarity source codes decides if it is a plagiarism or not. Application is first of all indicated for control plagiarism in homework in subject Algorithms at Fakulty of information technogy at Brno university of technology.
|
|
|
Comparison of Implementation Strategies of the DFA
Balgar, Marek ; Šimek, Václav (referee) ; Kaštil, Jan (advisor)
This bachelor thesis focuses upon the choices of methods, which are used to store automata on FPGA. There have been chosen these methods: bit-split, compress method and hash table. Then there are being compared the sizes of used memory, which are taken by automata in representation of these methods. The importaint part of this work is testing many kinds of samples. After the results have been achieved, I was able to examine the advantages and disadvantages of each method. Finally the analysis reveals which of the chosen methods is the best to store the automata on FPGA.
|
|
|
Practical Efficiency of Containers
Halámka, Jan ; Letko, Zdeněk (referee) ; Holík, Lukáš (advisor)
This thesis is about theorethical and practical comparrison of following data containers: vector, deque, list, hash table, avl-tree, rb-tree, splay-tree, sg-tree, treap, B-tree, binomial heap, fibonacci heap, rope and skiplist while implementing sets. Asymptotic, amortized and average-case complexity for each of those structures are noted, as well as details about their implementation and description of how are they stored in computer memory. There was also created a set of tests for comparrison purposes, its results are also part of this paper.
|
|
|
MHC And KIR Genotyping Of Macaques In HIV Infection Research
Matula, Jan
Modern research of viral diseases relies on genomic data processing. Not only is the sequence of a virus important, genomic sequence of specific receptors in affected organisms also plays an important role. In this paper, a novel package for processing of next generation sequencing data in infectious disease written using R/Bioconductor language is proposed. Functionality of the package, including implementation of advanced SSAHA algorithm for fast database searches, in demonstrated using genotyping of genes for MHC and KIR receptors of HIV positive macaques.
|
|
|
Interactive Data Structures
PRŠALA, Jan
The goal of this thesis is creating simple application for teaching dats structures - mostly focusing on data structures queue, stack, linked list, binary search tree and hash table. Each data structure is contained in its own modul and is shown on an example from the real world and in an abstract example, which can be modified by the user. This thesis itself contains the description of the data structures mentioned above. Instructions on how to add more modules are also there. The application itself with all the source code and the example of implementation of each data structure is located on the enclosed CD.
|
|
|
Mapping of Match Tables from P4 Language to FPGA Technology
Kekely, Michal ; Matoušek, Jiří (referee) ; Kořenek, Jan (advisor)
This thesis deals with design and implementation of mapping of match action tables from P4 language to FPGA technology. Goal of the thesis was to describe key principles, which need to be understood in order to design such a mapping and function of algorithms needed, apply these principles by implementing them and analyze the speed and memory requirements of such an implementation. Outcome provides configurable hardware unit capable of classifying packets and connection between the unit and match action tables from P4 language. The implementation is based on DCFL algorithm and requires less memory compared to HiCuts and HyperCuts algorithms while being comparably fast at worst-case scenarios.
|
|
|
Application for Detection of Plagiarism
Šalplachta, Pavel ; Techet, Jiří (referee) ; Lukáš, Roman (advisor)
Bachelor's thesis is focused on programming in language C and a method of detecting plagiarism in programs written in this language. The result of thesis is application in language C too, which according similarity source codes decides if it is a plagiarism or not. Application is first of all indicated for control plagiarism in homework in subject Algorithms at Fakulty of information technogy at Brno university of technology.
|
|
| |
guest ::
