|
|
Evolution algorithms in network elements
Braciník, Roman ; Sobek, Jiří (referee) ; Vychodil, Petr (advisor)
This semestral project deals wtih genetic algorithm issues and its utilization in network elements. The author analyses basic and improved genetic algorithm methods. The different way of adaptation of the algorithm on certain issues and their errors in usage will be discused further. In the conclusion the author discusses about the possible use of genetic algorithms in network elements.
|
|
|
Simulation of the Heat Diffusion with a Time-Varying Source on GPUs
Hála, Pavel ; Záň, Drahoslav (referee) ; Jaroš, Jiří (advisor)
This bachelor's thesis deals with the simulation of the heat transfer inside human tissue injected by an external time varying heat source. The proposed implemented simulation is based on a 4th order in space and 1st order in time finite-difference time domain method. First, a multithreaded CPU version was implemented. Subsequently, several GPU accelerated versions were implemented taking into account architecture aspect of the GPU. The experimental results showed that the fastest GPU kernel was the naive one using only the GPU global memory. Next, the usefulness of the Gauss-Seidel's method was investigated. The CPU implementation of the method was evaluated as usable because of being only 13% slower while saving up to 50% of memory resources. However, the GPU implementation was twice as slow as the naive version mainly due to shared memory size limits. The peak performance in terms of GFLOPS reached 32 and 135 on CPU and GPU, respectively. This corresponds to 10% and 9% of the theoretical potential of given architectures.
|
|
|
Object Tracking in Video Using CUDA
Schery, Miroslav ; Polok, Lukáš (referee) ; Herout, Adam (advisor)
This bachelors thesis is focused on implementation of particle filter algorithm in CUDA technology for the purpose of computation acceleration. It describes object tracking methods in video and is especialy aimed at particle filter. It also describes the CUDA architecture. Implementation and optimalization techniques used in application are explained. The work ends with performing speed tests and the tracking ability of the algorithm is verified on various videos.
|
|
|
Diffusion Evolutionary Algorithm
Žundálek, Zbyněk ; Puš, Viktor (referee) ; Jaroš, Jiří (advisor)
This bachelor thesis deals with a parallelization of cellular evolutionary algorithms using OpenMP. The theoretical part of the thesis contains an introduction to evolutionary and genetic algorithms followed by the description of their parallel implementation on shared memory systems. This part is completed with the OpenMP key features analysis. The practical part of this thesis describes two possible implementations of a diffusion evolutionary algorithm; synchronous and asynchronous. The comparison of achievable performance of these two methods carried out on the N-Queen problem is provided in the experimental part of the thesis. The quality of found solutions is further examined with respect to the neighborhood size, topology and the replacement operator of the diffusion evolutionary algorithm.
|
|
|
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.
|
|
|
The Parallelization of a Compilation and Linking Process
Koláček, Vojtěch ; Vašíček, Zdeněk (referee) ; Slaný, Karel (advisor)
This bachelor's thesis deals with the parallelization of a compilation and linking process. Various tools for the automatization of the compilation process are discussed. The main criteria is focused on the ability of parallelization of the compilation process. Three systems which are able to parallelize the compilation process have been implemented. The implemented systems cooperate with Microsoft C/C++ Compiler and Intel C++ Compiler.
|
|
|
Ray-tracing Using IPP Library
Kukla, Michal ; Havel, Jiří (referee) ; Hradiš, Michal (advisor)
Master thesis is dealing with design and implementation of ray-tracing and path-tracing using IPP library. Theoretical part discusses current trends in acceleration of selected algorithms and also possibilities of parallelization. Design of ray-tracing and path-tracing algorithm and form of parallelization are described in proposal. This part also discusses implementation of adaptive sampling and importance sampling with Monte Carlo method to accelerate path-tracing algorithm. Next part is dealing with particular steps in implementation of selected rendering methods regarding IPP library. Implementation of network interface using Boost library is also discussed. At the end, implemented methods are subjected to performance and quality test. Final product of this thesis is server aplication capable of handling multiple connections which provides visualisation and client application which implements ray-tracing and path-tracing.
|
|
|
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.
|
|
|
Implemenation of a Game Theory Library
Židek, Stanislav ; Peringer, Petr (referee) ; Hrubý, Martin (advisor)
Game theory has become very powerful tool for modelling decision-making situations of rational players. However, practical applications are strongly limited by the size of particular game, which is connected to the computational power of computers nowadays. Aim of this master's thesis is to design and implement a library, which would be able to find correlated equilibria in as complex non-cooperative games as possible.
|
|
|
Optimized Ray Tracing
Brich, Radek ; Herout, Adam (referee) ; Zemčík, Pavel (advisor)
Goal of this work is to write an optimized program for visualization of 3D scenes using ray tracing method. First, the theory of ray tracing together with particular techniques are presented. Next part focuses on different approaches to accelerate the algorithm. These are space partitioning structures, fast ray-triangle intersection technique and possibilities to parallelize the whole ray tracing method. A standalone chapter addresses the design and implementation of the ray tracing program.
|
guest ::
