Parallel algorithm conveyer processing with a minimal memory usage
dc.contributor.author | Bosakova-Ardenska, Atanaska | |
dc.date.accessioned | 2017-01-17T10:25:20Z | |
dc.date.available | 2017-01-17T10:25:20Z | |
dc.date.issued | 2008 | |
dc.description | http://sjam.selcuk.edu.tr/sjam/article/view/207 | en_US |
dc.description.abstract | 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. | en_US |
dc.identifier.citation | Bosakova-Ardenska, A. (2008). Parallel algorithm conveyer processing with a minimal memory usage. Selcuk Journal of Applied Mathematics, 9 (2), 53-64. | en_US |
dc.identifier.endpage | 64 | |
dc.identifier.issn | 1302-7980 | en_US |
dc.identifier.startpage | 53 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12395/3899 | |
dc.identifier.volume | 9 | |
dc.language.iso | en | en_US |
dc.publisher | Selcuk University Research Center of Applied Mathematics | en_US |
dc.relation.ispartof | Selcuk Journal of Applied Mathematics | en_US |
dc.relation.publicationcategory | Makale - Kategori Belirlenecek | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.selcuk | 20240510_oaig | en_US |
dc.subject | Paralel algoritmalar | en_US |
dc.subject | Özyinelemeli tarama yöntemi maskesi | en_US |
dc.subject | Parallel algorithms | en_US |
dc.subject | Recursive method of scanning mask | en_US |
dc.title | Parallel algorithm conveyer processing with a minimal memory usage | en_US |
dc.type | Article | en_US |