High performance large sparse PDEs with parabolic and elliptic types using AGE method on DPCS

The computational analysis of three case studies using parallelization of Alternating Group Explicit (AGE) solver is presented. Based on (2×2) block system and splitting strategy, AGE with Douglas-Richford and Brian variances are applied to simulate the large sparse PDEs applications with parabolic and elliptic types. The applications are heat equation, food dehydration for preservation and breast cancer growth. The AGE method has proved to be stable and suitable for parallel computing as it possesses separately and independently. The performance of AGE is compared with classical iterative methods such as Red Black Gauss Seidel (RBGS) and Jacobi (JB) methods. Since the PDEs applications are large sparse problems, we apply the AGE method in three different applications with three different mathematical models. The parallel implementation is based on SIMD model and supported by distributed memory architecture. Therefore, some numerical analysis and parallel performance indicators are used to validate the superior of parallel AGE method in terms of time execution, speedup, efficiency and effectiveness. As a result, the performances of numerical analysis and parallel evaluation of AGE are found to be effective for solving three case studies in reducing data storage accesses and minimizing communication time on a distributed parallel computer system

Parallelization of multidimensional hyperbolic partial differential equation on détente instantanée contrôlée dehydration process

The purpose of this research is to propose some new modified mathematical models to enhance the previous model in simulating, visualizing and predicting the heat and mass transfer in dehydration process using instant controlled pressure drop (DIC) technique. The main contribution of this research is the mathematical models which are formulated from the regression model (Haddad et al., 2007) to multidimensional hyperbolic partial differential equation (HPDE) involving dependent parameters; moisture content, temperature, and pressure, and independent parameters; time and dimension of region. The HPDE model is performed in multidimensional; one, two and three dimensions using finite difference method with central difference formula is used to discretize the mathematical models. The implementation of numerical methods such as Alternating Group Explicit with Brian (AGEB) and Douglas-Rachford (AGED) variances, Red Black Gauss Seidel (RBGS) and Jacobi (JB) method to solve the system of linear equation is another contribution of this research. The sequential algorithm is developed by using Matlab R2011a software. The numerical results are analyzed based on execution time, number of iterations, maximum error, root mean square error, and computational complexity. The grid generation process involved a fine grained large sparse data by minimizing the size of interval, increasing the dimension of the model and level of time steps. Another contribution is the implementation of the parallel algorithm to increase the speedup of computation and to reduce computational complexity problem. The parallelization of the mathematical model is run on Matlab Distributed Computing Server with Linux operating system. The parallel performance evaluation of multidimensional simulation in terms of execution time, speedup, efficiency, effectiveness, temporal performance, granularity, computational complexity and communication cost are analyzed for the performance of parallel algorithm. As a conclusion, the thesis proved that the multidimensional HPDE is able to be parallelized and PAGEB method is the alternative solution for the large sparse simulation. Based on the numerical results and parallel performance evaluations, the parallel algorithm is able to reduce the execution time and computational complexity compared to the sequential algorithm

High performance computing of explicit schemes for electrofusion jointing process based on message-passing paradigm

The research focused on heterogeneous cluster workstations comprising of a number of CPUs in single and shared architecture platform. The problem statements under consideration involved one dimensional parabolic equations. The thermal process of electrofusion jointing was also discussed. Numerical schemes of explicit type such as AGE, Brian, and Charlies Methods were employed. The parallelization of these methods were based on the domain decomposition technique. Some parallel performance measurement for these methods were also addressed. Temperature profile of the one dimensional radial model of the electrofusion process were also given

D-SPACE4Cloud: A Design Tool for Big Data Applications

The last years have seen a steep rise in data generation worldwide, with the development and widespread adoption of several software projects targeting the Big Data paradigm. Many companies currently engage in Big Data analytics as part of their core business activities, nonetheless there are no tools and techniques to support the design of the underlying hardware configuration backing such systems. In particular, the focus in this report is set on Cloud deployed clusters, which represent a cost-effective alternative to on premises installations. We propose a novel tool implementing a battery of optimization and prediction techniques integrated so as to efficiently assess several alternative resource configurations, in order to determine the minimum cost cluster deployment satisfying QoS constraints. Further, the experimental campaign conducted on real systems shows the validity and relevance of the proposed method

Acceleration computing process in wavelength scanning interferometry

The optical interferometry has been widely explored for surface measurement due to the advantages of non-contact and high accuracy interrogation. Eventually, some interferometers are used to measure both rough and smooth surfaces such as white light interferometry and wavelength scanning interferometry (WSI). The WSI can be used to measure large discontinuous surface profiles without the phase ambiguity problems. However, the WSI usually needs to capture hundreds of interferograms at different wavelength in order to evaluate the surface finish for a sample. The evaluating process for this large amount of data needs long processing time if CPUs traditional programming is used. This paper presents a parallel programming model to achieve the data parallelism for accelerating the computing analysis of the captured data. This parallel programming is based on CUDATM C program structure that developed by NVIDIA. Additionally, this paper explains the mathematical algorithm that has been used for evaluating the surface profiles. The computing time and accuracy obtained from CUDA program, using GeForce GTX 280 graphics processing unit (GPU), were compared to those obtained from sequential execution Matlab program, using Intel® Core™2 Duo CPU. The results of measuring a step height sample shows that the parallel programming capability of the GPU can highly accelerate the floating point calculation throughput compared to multicore CPU

LUNES: Agent-based Simulation of P2P Systems (Extended Version)

We present LUNES, an agent-based Large Unstructured NEtwork Simulator, which allows to simulate complex networks composed of a high number of nodes. LUNES is modular, since it splits the three phases of network topology creation, protocol simulation and performance evaluation. This permits to easily integrate external software tools into the main software architecture. The simulation of the interaction protocols among network nodes is performed via a simulation middleware that supports both the sequential and the parallel/distributed simulation approaches. In the latter case, a specific mechanism for the communication overhead-reduction is used; this guarantees high levels of performance and scalability. To demonstrate the efficiency of LUNES, we test the simulator with gossip protocols executed on top of networks (representing peer-to-peer overlays), generated with different topologies. Results demonstrate the effectiveness of the proposed approach.Comment: Proceedings of the International Workshop on Modeling and Simulation of Peer-to-Peer Architectures and Systems (MOSPAS 2011). As part of the 2011 International Conference on High Performance Computing and Simulation (HPCS 2011

A parallel genetic algorithm for the Steiner Problem in Networks

This paper presents a parallel genetic algorithm to the Steiner Problem in Networks. Several previous papers have proposed the adoption of GAs and others metaheuristics to solve the SPN demonstrating the validity of their approaches. This work differs from them for two main reasons: the dimension and the characteristics of the networks adopted in the experiments and the aim from which it has been originated. The reason that aimed this work was namely to build a comparison term for validating deterministic and computationally inexpensive algorithms which can be used in practical engineering applications, such as the multicast transmission in the Internet. On the other hand, the large dimensions of our sample networks require the adoption of a parallel implementation of the Steiner GA, which is able to deal with such large problem instances