Pcm- Omars Algorithm: Parallel Computation of Median - Omniscient Maximal Reduction Steps
ثبت نشده
چکیده
The parallel execution of aggregations is an interesting area. It be growing recently and plays important roles, thanks emerging application fields such as, e.g. data mining or sensor networks. The goal of distributed aggregation is to compute an aggregation function on a multi set of distributed values.Typical aggregation functions are max, sum, count, average, median, variance, kth smallest, or largest values (median is a special case of kth smallest selection with ), or combinations thereof.
منابع مشابه
PCM- oMaRS Algorithm: Parallel computation of Median- Omniscient Maximal Reduction Steps
The goal of a distributed computation algorithm is to determine the result of a function of numerical elements, which are distributed in n multi sets.It is known that computation of holistic aggregation functions on distributed multi sets indeed requires more work than non holistic aggregation functions. But with this article we will prove that the computation of a holistic function, which name...
متن کامل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 w...
متن کاملOptimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm
Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...
متن کاملAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previou...
متن کاملAn Incremental RNC Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension∗
We show that for hypergraphs of bounded edge size, the problem of extending a given list of maximal independent sets is NC-reducible to the computation of an arbitrary maximal independent set for an induced sub-hypergraph. The latter problem is known to be in RNC. In particular, our reduction yields an incremental RNC dualization algorithm for hypergraphs of bounded edge size, a problem previou...
متن کامل