|
|
Parallelisation of Ultrasound Simulations on Multi-GPU Clusters
Dujíček, Aleš ; Kula, Michal (referee) ; Jaroš, Jiří (advisor)
This work is part of the k-Wave project, which is a toolbox designed for time ultrasound simulations in complex and heterogeneous media. The simulation functions are based on the k-space pseudospectral method. The goal of this work is to compute these simulations on graphics cards using local domain decompostion. Thanks to decomposition we could compute these simulations faster, and on larger data grids. The main goal of this work is to achieve efficiency and scalability.
|
|
|
Acceleration of numerical computation of heat conduction in solids in inverse tasks
Ondruch, Tomáš ; Komínek, Jan (referee) ; Pohanka, Michal (advisor)
The master's thesis deals with possible ways of accelerating numerical computations, which are present in problems related to heat conduction in solids. The thesis summarizes basic characteristics of heat transfer phenomena with emphasis on heat conduction. Theoretical principles of control volume method are utilized to convert a direct heat conduction problem into a sparse linear system. Relevant fundamentals from the field of inverse heat conduction problems are presented with reference to intensive computations of direct problems of such kind. Numerical methods which are well-suited to find a solution of direct heat conduction problems are described. Remarks on practical implementation of time-efficient computations are made in relation with a two-dimensional heat conduction model. The results are compared and discussed with respect to obtained computational time for several tested methods.
|
|
| |
|
|
Desktop Game "Dáma"
Staněk, Ondřej ; Chmelař, Petr (referee) ; Kolář, Dušan (advisor)
This bachelor's thesis implements the draughts desktop game. Application allows to play according to different rules. It supports different ways of possible turns search of the player. One of them is the parallel computation.
|
|
|
The Efficient Implementation of the Genetic Algorithm Using Multicore Processors
Kouřil, Miroslav ; Žaloudek, Luděk (referee) ; Jaroš, Jiří (advisor)
This diploma thesis deals with acceleration of advanced genetic algorithm. For implementation, discrete and continuos versions of UMDA genetic algorithm were chosen. The main part of the acceleration is the utilization of SSE instruction set. Using this set, the functions for calculating fitness and new population sampling were accelerated in particular. Then the pseudorandom number generator that also uses SSE instruction set was implemented. The discrete algorithm reached the speed of up to 4,6 after this implementation. Finally, the algorithms were modified so that the system OpenMP could be used, which enables the running of blocks of code in more threads. The continuous version of algorithm is not convenient for parallelization, because computational complexity of that algorithm is low. In comparison, the discrete versions of algorithm are really appropriate for parallelization. Both the implemented versions reached the total acceleration of up to 4,9 and 7,2.
|
|
|
Simulation of Fracture Tests in Civil Engineering
Bordovský, Gabriel ; Vaverka, Filip (referee) ; Jaroš, Jiří (advisor)
In this thesis, a program for fracture test in civil engineering has been optimized. The simulation is used for a validation of the fracture characteristics for blocks of construct material used for historic buildings reconstructure. This thesis illustrates the possibilities of an effective usage of the processor’s potential without the loss of the output quality. The individual parts of the simulation are analyzed and this thesis proposes for the critical sections some possible optimizations such as vectorization or parallel processing. The techniques used in this thesis may be used on similar computing problems and help shorten the required runtime. The prototype of the simulation was able to process the simulation in 7.7 hours. Optimized version is capable to process the same simulation in 2.1 hours on one core or 21 minutes on eight cores. The parallel optimized version is 21 times faster than the prototype.
|
|
|
Stochastic Programming Algorithms
Klimeš, Lubomír ; Mrázková, Eva (referee) ; Popela, Pavel (advisor)
Stochastické programování a optimalizace jsou mocnými nástroji pro řešení široké škály inženýrských problémů zahrnujících neurčitost. Algoritmus progressive hedging je efektivní dekompoziční metoda určená pro řešení scénářových stochastických úloh. Z důvodu vertikální dekompozice je možno tento algoritmus implementovat paralelně, čímž lze významně ušetřit výpočetní čas a ostatní prostředky. Teoretická část této diplomové práce se zabývá matematickým a zejména pak stochastickým programováním a detailně popisuje algoritmus progressive hedging. V praktické části je navržena a diskutována původní paralelní implementace algoritmu progressive hedging, která je pak otestována na jednoduchých úlohách. Dále je uvedená paralelní implementace použita pro řešení inženýrského problému plynulého odlévání ocelové bramy a na závěr jsou získané výsledky zhodnoceny.
|
|
|
Compiler for Multicore Systems
Barteček, Jakub ; Přikryl, Zdeněk (referee) ; Masařík, Karel (advisor)
This bachelor´s thesis deals with parallel processing programs at the platform EdkDSP. The most important parts of this thesis are an analyzation of the target platform and a design of the translator. The design is aimed at translation of the OpenMP pragmas to a multithreaded code and a transformation of the specific types of cycles. The translator was implemented using the framework ROSE compiler and than tested.
|
|
|
Search for People in Recordings from Security Cameras
Jezerský, Matouš ; Hradiš, Michal (referee) ; Smrž, Pavel (advisor)
This thesis deals with the design and implementation of a system, which allows to search for and recognize people in video recordings. The presented design is based on a preceding research in theory relating to the topics of face and people recognition. Furthermore, the system design is implemented using convolutional neural networks for face recognition, while the implementation primarily utilizes the libraries dlib and OpenFace. The design and implementation use parallelization and distribution of tasks among multiple devices to reduce computation time, while also bearing in mind the practical applications of such system, such as working with limited amounts of available information regarding the person we seek. The precision of people detection and recognition of the implemented system is about 70% to 80%, based on the performed task. Among other uses, the system can be utilized to find a particular person in a video recording, to estimate the number of passes through the monitored space of one person, or the number of passes in total, or to find unknown people in the monitored space.
|
|
|
Text document plagiarism detector
Kořínek, Lukáš ; Horák, Karel (referee) ; Petyovský, Petr (advisor)
This diploma thesis is concerned with research on available methods of plagiarism detection and then with design and implementation of such detector. Primary aim is to detect plagiarism within academic works or theses issued at BUT. The detector uses sophisticated preprocessing algorithms to store documents in its own corpus (document database). Implemented comparison algorithms are designed for parallel execution on graphical processing units and they compare a single subject document against all other documents within the corpus in the shortest time possible, enabling near real-time detection while maintaining acceptable quality of output.
|
guest ::
