A High Performance MPI for Parallel and Distributed Computing

Message Passing Interface is widely used for Parallel and Distributed Computing. MPICH and LAM are popular open source MPIs available to the parallel computing community also there are commercial MPIs, which performs better than MPICH etc. In this paper, we discuss a commercial Message Passing Interface, CMPI (C-DAC Message Passing Interface). C-MPI is an optimized MPI for CLUMPS. It is found to be faster and more robust compared to MPICH. We have compared performance of C-MPI and MPICH on Gigabit Ethernet network.

Effects of Upflow Liquid Velocity on Performance of Expanded Granular Sludge Bed (EGSB) System

The effects of upflow liquid velocity (ULV) on performance of expanded granular sludge bed (EGSB) system were investigated. The EGSB reactor, made from galvanized steel pipe 0.10 m diameter and 5 m height, had been used to treat piggery wastewater, after passing through acidification tank. It consisted of 39.3 l working volume in reaction zone and 122 l working volume in sedimentation zone, at the upper part. The reactor was seeded with anaerobically digested sludge and operated at the ULVs of 4, 8, 12 and 16 m/h, consecutively, corresponding to organic loading rates of 9.6 – 13.0 kg COD/ (m3.d). The average COD concentrations in the influent were 9,601 – 13,050 mg/l. The COD removal was not significantly different, i.e. 93.0% - 94.0%, except at ULV 12 m/h where SS in the influent was exceptionally high so that VSS washout had occurred, leading to low COD removal. The FCOD and VFA concentrations in the effluent of all experiments were not much different, indicating the same range of treatment performance. The biogas production decreased at higher ULV and ULV of 4 m/h is suggested as design criterion for EGSB system.

Solving Facility Location Problem on Cluster Computing

Computation of facility location problem for every location in the country is not easy simultaneously. Solving the problem is described by using cluster computing. A technique is to design parallel algorithm by using local search with single swap method in order to solve that problem on clusters. Parallel implementation is done by the use of portable parallel programming, Message Passing Interface (MPI), on Microsoft Windows Compute Cluster. In this paper, it presents the algorithm that used local search with single swap method and implementation of the system of a facility to be opened by using MPI on cluster. If large datasets are considered, the process of calculating a reasonable cost for a facility becomes time consuming. The result shows parallel computation of facility location problem on cluster speedups and scales well as problem size increases.

Active Contours with Prior Corner Detection

Deformable active contours are widely used in computer vision and image processing applications for image segmentation, especially in biomedical image analysis. The active contour or “snake" deforms towards a target object by controlling the internal, image and constraint forces. However, if the contour initialized with a lesser number of control points, there is a high probability of surpassing the sharp corners of the object during deformation of the contour. In this paper, a new technique is proposed to construct the initial contour by incorporating prior knowledge of significant corners of the object detected using the Harris operator. This new reconstructed contour begins to deform, by attracting the snake towards the targeted object, without missing the corners. Experimental results with several synthetic images show the ability of the new technique to deal with sharp corners with a high accuracy than traditional methods.