Novel Apache Spark based Algorithm to Solve Dirichlet Problem for Poisson Equation in 3D Computational Domain

2016

Full text Open access: Hybrid Metadata (CSL-JSON)
DOI 10.3844/jcssp.2016.502.509
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Parallel computations are essential tool in solving large-scale computationally demanding problems.Due to large diversity and heterogeneity of the currently available parallel processing techniques and paradigms it is usually difficult to find the right solution that will perform well according to every performance metric.As one of the recent developments in parallel computing Apache Spark framework allows to process petabyte-scale data and possesses properties such as fault tolerance, scalability, load balancing and mechanisms of in memory computations across nodes of the cluster.All of these features are attractive for high performance scientific computing.It has been shown that Apache Spark outperforms Hadoop implementation of some machine learning algorithms by orders of magnitude.Since Hadoop platform is not well suited for iterative computing, typical for many computational problems, in this study we investigate performance characteristics of Apache Spark on scientific computing problems, particularly for solving Dirichlet problem for Poisson's equation.An algorithm for solving Dirichlet problem for Poisson's equation is described and analyzed and compared to optimized Hadoop-based implementations.Apache Spark uses new distributed data structure called RDD.Presented algorithm consists of operations on RDD such as mapping, grouping and partitioning.The benefits and drawbacks of the algorithm as well as applicability for stencil type computations are discussed and analyzed.