Browsing by Subject "OpenMP"
Now showing 1 - 5 of 5
- Results Per Page
- Sort Options
Item type:Article, Access status: Open Access , Hybrid implementation of the fastica algorithm for high-density eeg using the capabilities of the intel architecture and cuda programming(Wydawnictwa AGH, 2023) Gajos-Balińska, Anna; Wójcik, Grzegorz M.; Stpiczyński, PrzemysławHigh-density electroencephalographic (EEG) systems are utilized in the study of the human brain and its underlying behaviours. However, working with the EEG data requires a well-cleaned signal, which is often obtained using independent component analysis (ICA) methods. The longer the calculation time for these types of algorithms is, the more data is obtained. This paper presents a hybrid implementation of the fastICA algorithm that uses parallel programming techniques (libraries and extensions of the Intel processors and CUDA programming), which results in a significant acceleration of execution time on selected architectures.Item type:Article, Access status: Open Access , Implementacja równoległa, zastosowania i wyniki metody SPH w przypadku symulacji płynów nieściśliwych(Wydawnictwa AGH, 2008) Wróblewski, Paweł; Boryczko, KrzysztofThe SPH method for simulating incompressible fluids is presented in the article. The background and principles of the SPH method are explained and its application to incompressible fluids simulations is discussed. Next, two methods of neighbor search for the SPH algorithm based on a constant number of neighbors and a constant cut-off radius are presented. Firts, feasible methods of comparison are analyzed. Then the methods are compared visually and computationally. The obtained results suggest that the method with a constant cut-off radius is better than that with a constant number of neighbors. Subsequently, adaptations of the SPH method for simulating mcompressible fluids which focus on surface tension are presented. The modification for surface tension simulation, which relies on incorporating additional forces into the model, as well as the methodology are suggested. The results obtained with the method are presented and discussed. Finally, the parallel implementation of the SPH simulation with OpenMP environment is demonstrated and analyzed.Item type:Article, Access status: Open Access , Parallelized algorithms for finding similar images and object recognition(Wydawnictwa AGH, 2013) Frączek, Rafał; Cyganek, Bogusław; Wiatr, KazimierzThe paper addresses the issue of searching for similar images and objects in arepository of information. The contained images are annotated with the help of the sparse descriptors. In the presented research, different color and edge histogram descriptors were used. To measure similarities among images,various color descriptors are compared. For this purpose different distance measures were employed. In order to decrease execution time, several code optimization and parallelization methods are proposed. Results of these experiments, as well as discussion of the advantages and limitations of different combinations of metods are presented.Item type:Article, Access status: Open Access , The comparison of parallel sorting algorithms implemented on different hardware platforms(Wydawnictwa AGH, 2013) Żurek, Dominik; Pietroń, Marcin; Wielgosz, Maciej; Wiatr, KazimierzSorting is a common problem in computer science. There are a lot of well-known sorting algorithms created for sequential execution on a single processor. Recently, many-core and multi-core platforms have enabled the creation of wide parallel algorithms. We have standard processors that consist of multiple cores and hardware accelerators, like the GPU. Graphic cards, with their parallel architecture, provide new opportunities to speed up many algorithms. In this paper, we describe the results from the implementation of a few different parallel sorting algorithms on GPU cards and multi-core processors. Then, a hybrid algorithm will be presented, consisting of parts executed on both platforms (a standard CPU and GPU). In recent literature about the implementation of sorting algorithms in the GPU, a fair comparison between many core and multi-core platforms is lacking. In most cases, these describe the resulting time of sorting algorithm executions on the GPU platform and a single CPU core.Item type:Thesis, Access status: Restricted , Zastosowanie biblioteki OpenMP do zwiększenia efektywności obliczeniowej algorytmu wyszukiwania sąsiadów w przestrzeni 3D(Data obrony: 2020-01-20) Duda, Klaudiusz
Wydział Inżynierii Metali i Informatyki Przemysłowej
