Ing. Mgr. Maroš Lipták

Bachelor's thesis

Paralelizace optimalizačních algoritmů

Parallelization of optimization algorithms
Abstract:
The goal of this thesis is to propose parallel version of hill-climbing algorithm for scheduling in grid environment. This work contains analyses and comparison of parallel and sequence version of algorithm. We analyzed algorithms with experiments in simulator Alea, grid scheduling simulator.
Abstract:
Cieľom práce je návrh paralelnej verzie horolezeckého algoritmu pre plánovanie v gridovom prostredí. Práca obsahuje analýzu a porovnanie paralelnej verzie algoritmu s pôvodnou sekvenčnou. Algoritmy sme analyzovali na základe experimentov v simulátore Alea, ktorý slúži na simulovanie reálnych podmienok plánovania v gridovom prostredí.
 

Keywords

lokálne prehľadávanie Grid horolezecký algoritmus paralelizácia Alea plánovanie rozvrh
 
Language used: Slovak
Date on which the thesis was submitted / produced: 23. 5. 2011
Identifier: https://is.muni.cz/th/he2yw/

Thesis defence

  • Date of defence: 23. 6. 2011
  • Supervisor: RNDr. Dalibor Klusáček, Ph.D.
  • Reader: RNDr. Jiří Filipovič, Ph.D.

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Bachelor programme / field:
Informatics / Programmable Technical Structures

Theses on a related topic

List of theses with an identical keyword.