|
|
Acceleration of Particle Swarm Optimization Using GPUs
Krézek, Vladimír ; Schwarz, Josef (referee) ; Jaroš, Jiří (advisor)
This work deals with the PSO technique (Particle Swarm Optimization), which is capable to solve complex problems. This technique can be used for solving complex combinatorial problems (the traveling salesman problem, the tasks of knapsack), design of integrated circuits and antennas, in fields such as biomedicine, robotics, artificial intelligence or finance. Although the PSO algorithm is very efficient, the time required to seek out appropriate solutions for real problems often makes the task intractable. The goal of this work is to accelerate the execution time of this algorithm by the usage of Graphics processors (GPU), which offers higher computing potential while preserving the favorable price and size. The boolean satisfiability problem (SAT) was chosen to verify and benchmark the implementation. As the SAT problem belongs to the class of the NP-complete problems, any reduction of the solution time may broaden the class of tractable problems and bring us new interesting knowledge.
|
|
|
Acceleration of Data Compression Algorithms on Sony PS3 Platform
Breitenbacher, Dominik ; Jaroš, Jiří (referee) ; Šimek, Václav (advisor)
This paper presents the use of PlayStation 3 device for accelerating compression algorithms and tries to show the potencial of PlayStation 3 for use on these tasks. For a demonstration was selected compression method based on the Burrows-Wheeler transformation. The output of the transformation is further transformed by using the Move-To-Front transformation and subsequently encoded by the static Huffman encoding. The compression algorithm has been called PS3BWT. It performs compression by using each of tasks and tries to always use the maximum number of avaible processor units, so the compression is carried out as quickly as possible.
|
|
|
Automatization of Analysis of Performance and Power Consumption
Rudolf, Tomáš ; Jaroš, Jiří (referee) ; Nikl, Vojtěch (advisor)
This thesis deals with increasing efficiency of supercomputers. Higher efficiency can be achieved by reducing frequency of processor if the algorithm does not slow down significantly. This thesis presents set of scripts designed to monitor consumption of processor along with scripts that visualize these measured values. It also allows easy control of processor frequency. The created solution gives user a capability to measure given algorithm efficiency and optimize computing power of specific computer exactly for the algorithm. Due to this work the user will be informed about whether it is advantageous to run his algorithm on one or other frequency of the processor.
|
|
| |
|
|
Performance Analysis of IBM POWER8 Processors
Jelen, Jakub ; Kešner, Filip (referee) ; Jaroš, Jiří (advisor)
This paper describes the IBM Power8 system in comparison to the Intel Xeon processors, widely used in today’s solutions. The performance is not evaluated only on the whole system level but also on the level of threads, cores and a memory. Different metrics are demonstrated on typical optimized algorithms. The benchmarked Power8 processor provides extremely fast memory providing sustainable bandwidth up to 145 GB/s between main memory and processor, which Intel is unable to compete. Computation power is comparable (Matrix multiplication) or worse (N-body simulation, division, more complex algorithms) in comparison with current Intel Haswell-EP. The IBM Power8 is able to compete Intel processors these days and it will be interesting to observe the future generation of Power9 and its performance in comparison to current and future Intel processors.
|
|
|
Fast Reconstruction of Photoacoustic Images
Kukliš, Filip ; Dvořák, Václav (referee) ; Jaroš, Jiří (advisor)
The ability of reconstruction of photoacoustic images is important requirement to study soft tissues or vascular and lymphatic systems in high resulution but in small space. Today solution needs extensive computing power and it is noticeably time-consuming. In this study we would like to introduce a new solution which would be a way much faster and easy to use. My solution is up to 20x faster and needs forty percent less memory. This solution may be a better alternative for scietnist who study soft tissues by photoacoustic imaging.
|
|
| |
|
|
Graphical Vizualization of Routing Algorithms
Hanzély, Oskár ; Bidlo, Michal (referee) ; Jaroš, Jiří (advisor)
This thesis deals with routing processes of computer networks, overview of netwrok topologies and commonly used routing algorythms. It includes detailed description of created application to graphycal dysplay of networks schemes and routing. It contains transformation process of some schemes and the visualisation of all routing steps like an animation. The potency of usage and future development is commented briefly.
|
|
|
The Parallel Genetic Algorithm for Multicore Systems
Vrábel, Lukáš ; Šimek, Václav (referee) ; Jaroš, Jiří (advisor)
Genetický algoritmus je optimalizačná metóda zameraná na efektívne hľadanie riešení rozličných problémov. Je založená na princípe evolúcie a prirodzeného výberu najschopnejších jedincov v prírode. Keďže je táto metóda výpočtovo náročná, bolo vymyslených veľa spôsobov na jej paralelizáciu. Avšak väčšina týchto metód je z historických dôvodov založená na superpočítačoch alebo rozsiahlych počítačových systémoch. Moderný vývoj v oblasti informačných technológií prináša na trh osobných počítačov stále lacnejšie a výkonnejšie viacjadrové systémy. Táto práca sa zaoberá návrhom nových metód paralelizácie genetického algoritmu, ktoré sa snažia naplno využiť možnosti práve týchto počítačových systémov. Tieto metódy sú následne naimplementované v programovacom jazyku C za využitia knižnice OpenMP určenej na paralelizáciu. Implementácia je následne použitá na experimentálne ohodnotenie rozličných charakteristík každej z prezentovaných metód (zrýchlenie oproti sekvenčnej verzii, závislosť konvergencie výsledných hodnôt od miery paralelizácie alebo od vyťaženia procesoru, ...). V poslednej časti práce sú prezentované porovnania nameraných hodnôt a závery vyplývajúce z týchto meraní. Následne sú prediskutované možné vylepšenia daných metód vyplývajúce z týchto záverov, ako aj možnosti spracovania väčšieho množstva charakteristík na presnejšie ohodnotenie efektivity paralelizácie genetických algoritmov.
|
|
|
Acceleration of Lattice-Boltzmann Algorithms for Bloodflow Modeling
Kompová, Radmila ; Kešner, Filip (referee) ; Jaroš, Jiří (advisor)
This thesis aims to explore possible implementations and optimizations of the lattice-Boltzmann method. This method allows modeling of fluid flow using a simulation of fictive particles. The thesis focuses on possible improvements of the existing tool HemeLB which is designed and optimized for bloodflow modeling. Several vectorization and paralellization approaches that could be included in this tool are explored. An application focused on comparing chosen algorithms including optimizations for the lattice-Boltzmann method was implemented as a part of the thesis. A group of tests focused on comparing this algorithms according to performance, cache usage and overall memory usage was performed. The best performance achieved was 150 millions of lattice site updates per second.
|
guest ::
RSS feed.