|
| |
|
|
Parallelization of Ray Tracing
Čižek, Martin ; Juránek, Roman (referee) ; Herout, Adam (advisor)
Ray tracing is widely used technique for realistic rendering of computer scenes. Its major drawback is time needed to compute the image, therefore it's usually parallelized. This thesis describes parallelization and ray tracing in general. It explains the possibility of how can be ray tracing parallelized as well as it defines the problems which may occur during the process. The result is parallel rendering application which uses selected ray tracing software and measurement of how successful this application is.
|
|
|
Parallel genetic algorithm
Trupl, Jan ; Kobliha, Miloš (referee) ; Jaroš, Jiří (advisor)
The thesis describes design and implementation of various evolutionary algorithms, which were enhanced to use the advantages of parallelism on the multiprocessor systems along with ability to run the computation on different machines in a computer network. The purpose of these algorithms is to find the global extreme of function of $n$ variables. In the thesis, there are demonstrated various optimization problems, and their effective solution with the help of evolutionary algorithms. There are also described interface libraries MPI(Message Passing Interface) and OpenMP, in the extent needed to understand the problematic of parallel evolutionary algorithms.
|
|
|
Parallel genetic algorithm
Trupl, Jan ; Kobliha, Miloš (referee) ; Jaroš, Jiří (advisor)
The thesis describes design and implementation of various evolutionary algorithms, which were enhanced to use the advantages of parallelism on the multiprocessor systems along with ability to run the computation on different machines in a computer network. The purpose of these algorithms is to find the global extreme of function of $n$ variables. In the thesis, there are demonstrated various optimization problems, and their effective solution with the help of evolutionary algorithms. There are also described interface libraries MPI(Message Passing Interface) and OpenMP, in the extent needed to understand the problematic of parallel evolutionary algorithms.
|
|
|
Optimization of the Distributed I/O Subsystem of the k-Wave Project
Vysocký, Ondřej ; Hrbáček, Radek (referee) ; Jaroš, Jiří (advisor)
This thesis deals with an effective solution of parallel writing of variable amounts of data on the Lustre file system. The work will be used by the k-Wave project designed for time domain acoustic and ultrasound simulations. Since the simulation is computationally and data intensive, the project requires to be implemented with libraries for parallel computig (Open MPI) and large data processing (HDF5) and it must run on a supercomputer. The application is implemented in C and uses previously mentioned libraries. The proper settings of the Lustre file system leads to the peak write bandwith of 2.5 GB/s that corresponds to a speedup factor of 5 compared to the reference settings. The data aggregation improved the write bandwidth by a factor of 3 compared to a naive version. Here, the achieved I/O bandwidth for certain block sizes hits the limits of the Anselm I/O subsytem (3GB/s).
|
|
| |
|
|
Parallelization of Ray Tracing
Čižek, Martin ; Juránek, Roman (referee) ; Herout, Adam (advisor)
Ray tracing is widely used technique for realistic rendering of computer scenes. Its major drawback is time needed to compute the image, therefore it's usually parallelized. This thesis describes parallelization and ray tracing in general. It explains the possibility of how can be ray tracing parallelized as well as it defines the problems which may occur during the process. The result is parallel rendering application which uses selected ray tracing software and measurement of how successful this application is.
|
|
|
Design and performance monitoring of a HPC cluster
Jiroušek, Ondřej
For high performance computing (HPC), clusters of workstations are becoming very popular platforms, but performance of these systems is harder to predict than on the traditional massively parallel machines. The process by which a low-cost, high performance Beowulf-style Linux cluster was built is discussed in the paper. The first tests of several parallel tasks and the estimation of the performance of the cluster is shortly described.
|
guest ::
