Sciweavers

Share
IAJIT
2016

Optimization of position finding step of PCM-oMaRS algorithm with statistical information

3 years 6 months ago
Optimization of position finding step of PCM-oMaRS algorithm with statistical information
: The PCM- oMaRS algorithm guarantees the maximal reduction steps of the computation of the exact median in distributed datasets and proved that we can compute the exact median effectively with reduction of blocking time and without needing the usage of recursive or iterative methods anymore. This algorithm provided more efficient execution not only in distributed datasets even in local datasets with enormous data. We cannot reduce the steps of PCM- oMaRS algorithm any more but we have found an idea to optimize one step of it. The most important step of this algorithm is the step in which the position of exact median will be determinate. For this step we have development a strategy to achieve more efficiency in determination of position of exact median. Our aim in this paper to maximize the best cases of our algorithm and this was achieved through dividing the calculation of number of all value that smaller than or equal to temporary median in tow groups. The first one contains only th...
Ammar Balouch
Added 04 Apr 2016
Updated 04 Apr 2016
Type Journal
Year 2016
Where IAJIT
Authors Ammar Balouch
Comments (0)
books