|
|
Automatic Configuration of Utility Tools for FPGA Firmware
Perešíni, Martin ; Matoušek, Jiří (referee) ; Kučera, Jan (advisor)
This bachelor's thesis is about designing an automatic configuration of utility tools for FPGA firmware. The assignment is solved within CESNET research activity, which is devoted on the development of hardware-accelerated network interface cards based on FPGA technology. The aim of the thesis is to replace current inflexible system for describing the firmware structure used by NIC, HANIC and SDM projects. The system was based on a firmware description by XML file, which was created manually for each configuration. Based on negative aspects of system is created new design, which is using Device Tree. Device Tree is opening possibility to change NetCOPE build system for automatic generating firmware description. Description of hardware is distributed together with firmware. In the thesis, the design of the system was implemented and then verified by testing functionality on the ethctl tool. At the end of the work are mentioned possible system features and extensions for future.
|
|
|
Probabilistic Packet Classification Acceleration on FPGA
Kurka, Denis ; Matoušek, Jiří (referee) ; Kekely, Lukáš (advisor)
Klasifikace síťových paketů je klíčovým úkolem v síťových systémech, protože umožňuje efektivní směrování a filtrování dat. Pravděpodobnostní filtry jsou klasifikační metoda, která používá různé techniky k aproximaci členství paketu v sadě pravidel. Tato práce zkoumá tři algoritmy: Bloomův filtr, cuckoo filtr a xor filtr. Hlavním cílem je porovnat výkon těchto tří metod při implementaci jako hardwarové komponenty v FPGA systémech. Kritéria hodnocení zahrnují chybovost, maximální frekvenci a využití zdrojů FPGA se zameřením na paměť. Výsledky ukazují, že xor filtr překonává ostatní v oblasti chybovosti, ve všech kategoriích. Bloomův filtr je nejrychlejší volbou pro menší a rychlejší komponenty, kde je vyšší chybovost tolerovatelná. Cuckoo filtr je nejefektivnější z hlediska využití FPGA logiky. Tyto poznatky přispívají k vývoji optimalizovaných klasifikačních systémů a poskytují cenné informace o možnostech implementace pravděpodobnostních filtrů v hardwarových architekturách.
|
|
|
A Concept of Youth Football Practice in Dolní Bukovsko
MATOUŠEK, Jiří
The main goal of this bachelor thesis was to create a concept for youth football practice in TJ Dolni Bukovsko. The work is based on author's own experience as a head coach of the TJ Dolni Bukovsko youth football team. The first chapter analyses the situation in Dolni Bukovsko and the functioning of youth football in Dolni Bukovsko. The second chapter presents a concept for youth football practice in Dolni Bukovsko: its focus (orientation, values), categorization of players and teams in the conditions of village football, methodological, organizational and content dimensions of football practice. The third chapter presents an example of a football practice session for U13 category created within the framework of the concept introduced in the previous chapters
|
|
| |
|
|
Implementation of a Boot Controller for Intel FPGAs
Hak, Tomáš ; Fukač, Tomáš (referee) ; Matoušek, Jiří (advisor)
This thesis touches the topic of using FPGA technology in the field of computer networks, specifically for hardware acceleration of network traffic processing on a network card developed by the CESNET association. FPGA technology is popular mainly due to the possibility to easily reconfigure the chip and fix any errors or update the firmware. The thesis first discusses the design and implementation of a new unit for Intel FPGA, which will be able to communicate with the external configuration flash memory of the chip featured on the card mentioned above. It then goes on to address the design and implementation of a software tool that will allow, via the newly implemented firmware unit, to load new configuration data into the flash memory and force reconfiguration of the FPGA chip using this newly loaded data. Towards the end of the thesis, the functionality of the newly implemented system is tested in practice.
|
|
|
Network Traffic Monitoring Using the P4 Language
Patová, Pavlína ; Matoušek, Jiří (referee) ; Martínek, Tomáš (advisor)
Today we often encounter the need to monitor network and service quality. For this purpose we can use for example INT. Our goal is to find the optimal platform and associated compiler for implementing INT. We will try to find an alternative to the existing solutions (T4P4S, BMv2). However, we will also mention these two platforms and discuss their advantages and disadvantages. The result of this work is an overview of the capabilities of each compiler and the performance of the described implementations.
|
|
|
Measuring Parameters of Communication over PCI Express
Matějka, Martin ; Martínek, Tomáš (referee) ; Matoušek, Jiří (advisor)
This bachelor thesis describes designing a unit capable of measuring throughput on a PCI Express bus. The described unit is designed for an FPGA chip on an acceleration card with PCI Express 3.0 interface. At the same time, the thesis describes software implemented in C language used for its control. In the last section of this bachelor thesis are experiments conducted with the designed and implemented unit.
|
|
|
Věty Hellyho typu a zlomkového Hellyho typu
Tancer, Martin ; Matoušek, Jiří (advisor) ; Kaiser, Tomáš (referee)
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Classical Helly's Theorem states that if a d-representable complex contains all the possible faces of dimension d then it is already a full simplex. Helly's Theorem has many extensions and we give a brief survey of some of them. The class of d-representable complexes is a subclass of d-collapsible complexes, and the latter is a subclass of d-Leray complexes. For d 1 we give an example of complexes that are 2d-Leray but not (3d 1)-collapsible. For d 2 we give an example of complexes that are d-Leray but not (2d 2)-representable. We show that for d 3 the complexes from the last example are also d-collapsible. We also give a simple proof of the Combinatorial Alexander Duality, which is a useful topological tool for combinatorics, e.g., for topological versions of Helly's Theorem.
|
|
|
Samodlážditelné simplexy
Safernová, Zuzana ; Matoušek, Jiří (advisor) ; Cibulka, Josef (referee)
In the present work we study tetrahedral k-reptiles. A d-dimensional simplex is called a k-reptile if it can be tiled in k simplices with disjoint interiors that are all congruent and similar to S. For d = 2, triangular k-reptiles exist for many values of k and they have been completely characterized. On the other hand, the only simplicial k-reptiles that are known for d 3 have k = md, where m 2 (Hill simplices). We prove that for d = 3, tetrahedral k-reptiles exist only for k = m3. This partially confirms the Hertel's conjecture, asserting that the only tetrahedral k-reptiles are the Hill tetrahedra. We conjecture that k = md is necessary condition for existence of d-dimensional simplicial k-reptiles, d > 3.
|
|
|
Perfect tilings of simplices
Safernová, Zuzana ; Matoušek, Jiří (advisor) ; Cibulka, Josef (referee)
In the present work we study the problem of k-reptile d-dimensional simplices. A simplex is called a k-reptile if it can be tiled in k simplices with disjoint interiors that are all congruent and similar to S. The only k-reptile simplices that are known for d 3 have k = md, where m 2. We also show an idea of Matoušek's proof of nonexistence of 2-reptile simplices of dimensions d 3. We correct a mistake in the proof. Then we give several geometric observations for k = 2. At the end we prove that there is no 3-reptile simplex for d = 3.
|
guest ::
RSS feed.