Academic Journals Database
Disseminating quality controlled scientific knowledge

Parallel Algorithm “Conveyer Processing with a Minimal Memory Usage”

ADD TO MY LIST
 
Author(s): Atanaska Bosakova-Ardenska

Journal: Selçuk Journal of Applied Mathematics
ISSN 1302-7980

Volume: 9;
Issue: 2;
Start page: 53;
Date: 2008;
Original page

Keywords: Parallel algorithms | recursive method of scanning mask | filter ‘mean’ | MPI.

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.
RPA Switzerland

Robotic Process Automation Switzerland

    

Tango Rapperswil
Tango Rapperswil