Parallel algorithm conveyer processing with a minimal memory usage
Yükleniyor...
Dosyalar
Tarih
2008
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Selcuk University Research Center of Applied Mathematics
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
This paper analyses a parallel algorithm conveyer processing of recursive method of scanning mask and proposes a modification of it - conveyer processing with a minimal memory usage. This algorithm removes a doubling of output information and decreases the number of operations compared with the algorithm conveyer processing. For parallel implementation of algorithms we use MPI (Message Passing Interface). For execution of parallel programs, cluster of 4 computer systems (each with 2 processors) is used. It is made comparison between these two algorithms in sequential and parallel implementation.
Açıklama
http://sjam.selcuk.edu.tr/sjam/article/view/207
Anahtar Kelimeler
Paralel algoritmalar, Özyinelemeli tarama yöntemi maskesi, Parallel algorithms, Recursive method of scanning mask
Kaynak
Selcuk Journal of Applied Mathematics
WoS Q Değeri
Scopus Q Değeri
Cilt
9
Sayı
Künye
Bosakova-Ardenska, A. (2008). Parallel algorithm conveyer processing with a minimal memory usage. Selcuk Journal of Applied Mathematics, 9 (2), 53-64.
