|
|
Environment for distributed computations
Dědeček, Jan ; Žemlička, Michal (advisor) ; Kruliš, Martin (referee)
In present work are analyzed possibilities of optimization special task. In this task is requested to generate all variants of word equal length n and test them by computation. The first part of work is analyzing possibility of precessing words more efficiently. Number of words is equal to 2n, then even for small lengths is not possible to compute task on one computer in satisfiable time. The advantage of this task is that computation of each word is independent, therefore task could be easily divided. The second part of work is analyzing possibility of dividing computing on multiple computers, so the overall time of computation is maximally decreased. Side way of this work is creation of distributive application.
|
|
|
Implementing incomplete inverse decomposition on graphical processing units
Dědeček, Jan ; Tůma, Miroslav (advisor) ; Hakl, František (referee)
The goal of this Thesis was to evaluate a possibility to solve systems of linear algebraic equations with the help of graphical processing units (GPUs). While such solvers for generally dense systems seem to be more or less a part of standard production libraries, the Thesis concentrates on this low-level parallelization of equations with a sparse system that still presents a challenge. In particular, the Thesis considers a specific algorithm of an approximate inverse decomposition of symmetric and positive definite systems combined with the conjugate gradient method. An important part of this work is an innovative parallel implementation. The presented experimental results for systems of various sizes and sparsity structures point out that the approach is rather promising and should be further developed. Summarizing our results, efficient preconditioning of sparse systems by approximate inverses on GPUs seems to be worth of consideration. Powered by TCPDF (www.tcpdf.org)
|
|
|
Environment for distributed computations
Dědeček, Jan ; Žemlička, Michal (advisor) ; Kruliš, Martin (referee)
In present work are analyzed possibilities of optimization special task. In this task is requested to generate all variants of word equal length n and test them by computation. The first part of work is analyzing possibility of precessing words more efficiently. Number of words is equal to 2n, then even for small lengths is not possible to compute task on one computer in satisfiable time. The advantage of this task is that computation of each word is independent, therefore task could be easily divided. The second part of work is analyzing possibility of dividing computing on multiple computers, so the overall time of computation is maximally decreased. Side way of this work is creation of distributive application.
|
guest ::
RSS feed.