|
|
Application for Alignment of DNA Parts
Kašpárek, Tomáš ; Žák, Jakub (referee) ; Rozman, Jaroslav (advisor)
This thesis deals with DNA sequences alignment methods with focus on execution speed of given task and its optimality. The outcome of this thesis results in multiple programs, which presents DNA alignment algorithms and their versions programmed with OpenCL libraries, which are optimized on calculation rate. Text of this thesis apprises reader with DNA alignment problematic and its importance in biology. Further, algorithms for DNA alignment and options of their speed-up using libraries like CUDA or OpenCL are presented.
|
|
|
Ray-Tracing Using SSE
Skoták, Jakub ; Švub, Miroslav (referee) ; Havel, Jiří (advisor)
Ray-tracing is one of realistic methods of computer visualization. This method is highly computationally intensive and there is no hardware accelerator for it. This labour describes the acceleration of ray-tracing using the SSE instruction set.
|
|
|
Compiler of Language of Mathematical Function
Junek, Lukáš ; Horáček, Petr (referee) ; Čermák, Martin (advisor)
In this thesis, we are dealing with construction of Interpreter of Language of Mathematical function. We constructed all parts of interpreter, which involved processing and execution of source code. The main part of my thesis is implementation of computer operations with matrices using SSE instructions. For this purpose, we used interface by Intel. There in a special header file are defined the functions corresponding to each instruction. However, functions not only to calculate, but perform support operations, which eliminate some annoying features of assembler.
|
|
|
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.
|
|
|
Library for Operations over Finite Automata
Bartůněk, Petr ; Puš, Viktor (referee) ; Kaštil, Jan (advisor)
This work deals with two basic operations over finite automata. Determination of nondeterministic finite automata and minimization of deterministic finite automata. For these two operations I proposed sequential algorithms that are parallelizable. I deal mainly with finding the speedup of SSE instructions, or use the OpenMP library. The trend today is mainly in increasing the number of processors, so I propose parallel algorithms for multiple processors. When searching for the optimal solution, I will be to examine other ways to achieve speedup, for example efficient saving of the data structures in memory.
|
|
|
Distributed Ray Tracing in Reasonable Time
Slovák, Radek ; Polok, Lukáš (referee) ; Herout, Adam (advisor)
This thesis deals with the method of distributed ray tracing focusing on optimalization of this method. The method uses simulation of some attributes of light by distributing rays of lights and it produces high quality and partly realistic images. The price for realitic effects is the high computational complexity of the method. The thesis analysis the theory connected with these aspects. A large part describes optimalizations of this method, i.e. searching for the nearest triangle intersection using kd-trees, quasi random sampling with faster convergence, the use of SSE instruction set and fast ray - triangle intersection. These optimalizations brought a noticable speed - up. The thesis includes description of implementation of these techniques. The implementation itself emphasises the practical usability including generating some advanced animations and universal description of objects.
|
|
|
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.
|
|
|
Information System Assesment
Menšík, Marek ; Ing.Kamil Macuch (referee) ; Koch, Miloš (advisor)
This diploma thesis deals with information systems evaluation from user and producer aspects. The theoretical part presents current trends and actual ways of using, including practical application used in real firms. The practical part is focused on proposals and changes for concrete producer of information system.
|
|
|
Intel Integrated Performance Primitives and their use in application development
Machač, Jiří ; Přinosil, Jiří (referee) ; Malý, Jan (advisor)
The aim of the presented work is to demonstrate and evaluate the contribution of computing system SIMD especially units MMX, SSE, SSE2, SSE3, SSSE3 and SSE4 from Intel company, by creation of demostrating applications with using Intel Integrated Performance Primitives library. At first, possibilities of SIMD programming using intrinsic function, vektorization and libraries Intel Integrated Performance Primitives are presented, as next are descibed options of evaluation of particular algorithms. Finally procedure of programing by using Intel Integrated Performance Primitives library are ilustrated.
|
|
|
Development of Chinese stock markets and their connection to the stock markets in the USA
Kociánová, Iva ; Taušer, Josef (advisor) ; Müller, Štěpán (referee)
This diploma thesis deals with the topic of development of Chinese stock markets and their connection to the stock markets in the USA. The primary purpose of this research is to investigate, through a historical analysis, this rather untraditional development. The other objective of this study is to clarify the reasons of such a fast development and, with the help of results of other used analyses, assess to what extent the following stock markets are influenced by each other. This part of the study focuses mainly on the development of mutual dependence between the Shanghai and the New York stock market and on predictions of the future development of Chinese stock markets, using several other economic variables of the USA markets. This diploma thesis also aims to analyze the position of China in holding of American bonds, as well as to define the motives of their purchase and describe the possible impacts of their sudden sale by the Chinese government.
|
guest ::
