Paralelno računanje totalno asinkronih iterativnih algoritama

Paralelno računanje povećalo je računsku moć računala i omogućila nam da rješavamo probleme koje smo smatrali nerješivima. Jedna od klasifikacija paralelnih algoritama je na sinkrone i asinkrone. Asinkrone paralelne algoritme dalje dijelimo na parcijalno i totalno asinkrone algoritme. Totalno asinkroni iterativni algoritmi su predmet analize ovog rada. Posebno, dokazujemo teorem o asinkronoj konvergenciji koji nam daje dovoljne uvjete za konvergenciju asinkronih algoritama. Dalje, analiziramo iterativne metode za rješavanje linearnih sustava i njihove sekvencijalne, sinkrone i totalno asinkrone implementacije. Dajemo i detaljan uvid u provedeno testiranje nad tim algoritmima.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