Paralelno računanje totalno asinkronih iterativnih algoritama

Grbić, Ante (2014) Paralelno računanje totalno asinkronih iterativnih algoritama. Diploma thesis, Faculty of Science > Department of Mathematics.

[img] PDF
Restricted to Registered users only
Language: Croatian

Download (318kB) | Request a copy
[img] Archive (dodatni materijali)
Restricted to Registered users only
Language: English

Download (3MB) | Request a copy

Abstract

Parallel computing has increased the computational power of a computer and allowed us to solve problems that were considered intractable. One of the classifications of parallel algorithms is the division on synchronous and asynchronous. Asynchronous parallel algorithms can be divided on partially and totally asynchronous algorithms. Totally asynchronous iterative algorithms are our subject of analysis. In particular, we prove the theorem of asynchronous convergence, which gives us sufficient conditions for the convergence of asynchronous algorithms. Furthermore, we analyze iterative methods for solving systems of linear equations and their sequential, synchronous and totally asynchronous implementations. We give a detailed overview of the tests carried out over these algorithms.

Item Type: Thesis (Diploma thesis)
Supervisor: Grubišić, Luka
Date: 2014
Number of Pages: 33
Subjects: NATURAL SCIENCES > Mathematics
Divisions: Faculty of Science > Department of Mathematics
Depositing User: Iva Prah
Date Deposited: 02 Jun 2015 11:37
Last Modified: 02 Jun 2015 11:37
URI: http://digre.pmf.unizg.hr/id/eprint/3944

Actions (login required)

View Item View Item