Implementation of Discrete Search Optimization Algorithms in Parallel and Their Performance Analysis Article Swipe

View

Related Concepts

Asynchronous communication Computer science Parallel computing Parallel algorithm Window (computing) Iterative deepening depth-first search Analysis of parallel algorithms Iterative method Algorithm Search algorithm Best-first search Beam search Computer network Operating system

Muhammad Hanif Durad , Mohammad Zulqurnain , Anila Usman , Idrees Ahmad ·

YOU? · · 2020 · Open Access · · DOI: https://doi.org/10.21015/vtm.v8i1.576 · OA: W3112766006

The present paper discusses the implementation of the discrete search optimization techniques on a parallel platform (SGI-Altix 450 shared memory 64 processors system). We show that the combination of Asynchronous Parallel Iterative Deepening and Parallel Window Search technique tends to give more challenging speedups, memory consumption, and efficiency with less resource consumption as compared to the rest of the techniques. In general 5 techniques are compared with Parallel Asynchronous Window Search technique among which includes Depth First Search, Parallel Iterative Deepening, Parallel A*, Parallel Window Search and Parallel Asynchronous Iterative Deepening A*.