A sparse parallel hybrid Monte Carlo algorithm for matrix computations

In this paper we introduce a new algorithm, based on the successful work of Fathi and Alexandrov, on hybrid Monte Carlo algorithms for matrix inversion and solving systems of linear algebraic equations. This algorithm consists of two parts, approximate inversion by Monte Carlo and iterative refinement using a deterministic method. Here we present a parallel hybrid Monte Carlo algorithm, which uses Monte Carlo to generate an approximate inverse and that improves the accuracy of the inverse with an iterative refinement. The new algorithm is applied efficiently to sparse non-singular matrices. When we are solving a system of linear algebraic equations, Bx = b, the inverse matrix is used to compute the solution vector x = B(-1)b. We present results that show the efficiency of the parallel hybrid Monte Carlo algorithm in the case of sparse matrices.

Handling single node failures using agents in computer clusters

The work reported in this paper is motivated towards handling single node failures for parallel summation algorithms in computer clusters. An agent based approach is proposed in which a task to be executed is decomposed to sub-tasks and mapped onto agents that traverse computing nodes. The agents intercommunicate across computing nodes to share information during the event of a predicted node failure. Two single node failure scenarios are considered. The Message Passing Interface is employed for implementing the proposed approach. Quantitative results obtained from experiments reveal that the agent based approach can handle failures more efficiently than traditional failure handling approaches.

Parallel rule induction with information theoretic pre-pruning

In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to inducing classification rules, one is the divide and conquer approach, also known as the top down induction of decision trees; the other approach is called the separate and conquer approach. A considerable amount of work has been done on scaling up the divide and conquer approach. However, very little work has been conducted on scaling up the separate and conquer approach.In this work we describe a parallel framework that allows the parallelisation of a certain family of separate and conquer algorithms, the Prism family. Parallelisation helps the Prism family of algorithms to harvest additional computer resources in a network of computers in order to make the induction of classification rules scale better on large datasets. Our framework also incorporates a pre-pruning facility for parallel Prism algorithms.

EXPLOITING A GENERIC APPROACH TO CONSTRUCT COMPONENT-BASED SYSTEMS SOFTWARE IN LINUX ENVIRONMENTS

Component-based software engineering has recently emerged as a promising solution to the development of system-level software. Unfortunately, current approaches are limited to specific platforms and domains. This lack of generality is particularly problematic as it prevents knowledge sharing and generally drives development costs up. In the past, we have developed a generic approach to component-based software engineering for system-level software called OpenCom. In this paper, we present OpenComL an instantiation of OpenCom to Linux environments and show how it can be profiled to meet a range of system-level software in Linux environments. For this, we demonstrate its application to constructing a programmable router platform and a middleware for parallel environments.

FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Effect of refrigeration systems upon frozen bull sperm viability assessed by computer-assisted sperm analysis and fluorescent probes

Sperm cryopreservation success depends upon the maintenance of spermatozoa fertility potential. Sperm cells must preserve both integrity and functionality of several cell structures. The stabilization phase must allow the exit of water from the sperm cells via osmosis. This study aimed to compare the effect of refrigeration in the commercial refrigerator (CR) and the transport/refrigeration box (TRB) upon the viability of frozen bull sperm diluted in three different extenders (A, B and C). Ten Nellore bulls, Bos taurus indicus maintained in Artificial Insemination Center were used and the spermatozoa samples was assessed for Plasma Membrane Integrity and CASA evaluation. The stabilization phase (5 degrees C/4 hours) was performed in the CR as well as in the TRB, and then samples were exposed to nitrogen vapor during 20 minutes and then plunged into nitrogen. The statistical analysis was done using the variance analysis and the significance level was set at 5%. In the CR the post-thawing parameters for PM and ALH were higher (p < 0.05) in the extender A (glicine egg-yolk) and extender B (glicine egg-free) when compared with extender C (TRIS egg-yolk). As for BCF, STR and LIN, the parameters were higher (p < 0.05) in extender B than in C. Samples that were stabilized in the TRB presented higher post-thawing parameters (p < 0.05) for PM and LIN in extender A and extender B when compared with C. BCF and STR parameters were higher (p < 0.05) in extemder B when compared with C. Extender B samples had higher (p < 0.05) PMI when stabilized in CR. The findings in this experiment enable us to say that both CR and TRB were effective in keeping the viability of post-thawing bull semen.

Theoretical studies of liquids by computer simulations: the water-acetone mixture.

Monte Carlo simulation results for pure liquid acetone and water-acetone mixtures calculated in the isothermal and isobaric (NPT) ensemble at T=298K and p=1.0atm are presented. The TIP4P model was used for water and optimized potential for liquid simulation (OPLS) force field parameters used for acetone. The results obtained for the average configurational energy as a function of the mole fraction are in good accord with experimental data. Energy partitioning and co-ordination numbers results calculated for equimolar water-acetone solution are compared to similar data obtained for other water-organic liquid mixtures. These results show an increase in water-water interaction energy and co-ordination numbers when the interaction between water and organic liquid molecules decrease. Distribution functions for pure liquid acetone and water-acetone mixtures are presented. Dipole-dipole angular correlation functions obtained for pure liquid acetone show a predominance of dimers with parallel alignment of dipole moments. Radial distribution functions from water-acetone interaction show characteristic features of hydrogen bonded liquids. Radial and angular distribution functions for water-water correlation calculated in pure water and in equimolar water-acetone mixture are compared, showing very similar features in both systems. (C) 1999 Elsevier B.V. B.V. All rights reserved.

Harmonic identification using parallel neural networks in single-phase systems

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Computer tools to aid the learning and design steps for photovoltaic systems

This paper presents novel simulation tools to assist the lecturers about learning processes on renewable energy sources, considering photovoltaic (PV) systems. The PV behavior, functionality and its interaction with power electronic converters are investigated in the simulation tools. The main PV output characteristics, I (current) versus V (voltage) and P (power) versus V (voltage), were implemented in the tools, in order to aid the users for the design steps. In order to verify the effectiveness of the developed tools the simulation results were compared with Matlab. Finally, a prototype was implemented with the purpose to compare the experimental results with the results from the proposed tools, validating its operational feasibility. © 2011 IEEE.

A novel strategy for building interoperable MPI environment in heterogeneous high performance systems

Breakthrough advances in microprocessor technology and efficient power management have altered the course of development of processors with the emergence of multi-core processor technology, in order to bring higher level of processing. The utilization of many-core technology has boosted computing power provided by cluster of workstations or SMPs, providing large computational power at an affordable cost using solely commodity components. Different implementations of message-passing libraries and system softwares (including Operating Systems) are installed in such cluster and multi-cluster computing systems. In order to guarantee correct execution of message-passing parallel applications in a computing environment other than that originally the parallel application was developed, review of the application code is needed. In this paper, a hybrid communication interfacing strategy is proposed, to execute a parallel application in a group of computing nodes belonging to different clusters or multi-clusters (computing systems may be running different operating systems and MPI implementations), interconnected with public or private IP addresses, and responding interchangeably to user execution requests. Experimental results demonstrate the feasibility of this proposed strategy and its effectiveness, through the execution of benchmarking parallel applications.

An online data access prediction and optimization approach for distributed systems

Current scientific applications have been producing large amounts of data. The processing, handling and analysis of such data require large-scale computing infrastructures such as clusters and grids. In this area, studies aim at improving the performance of data-intensive applications by optimizing data accesses. In order to achieve this goal, distributed storage systems have been considering techniques of data replication, migration, distribution, and access parallelism. However, the main drawback of those studies is that they do not take into account application behavior to perform data access optimization. This limitation motivated this paper which applies strategies to support the online prediction of application behavior in order to optimize data access operations on distributed systems, without requiring any information on past executions. In order to accomplish such a goal, this approach organizes application behaviors as time series and, then, analyzes and classifies those series according to their properties. By knowing properties, the approach selects modeling techniques to represent series and perform predictions, which are, later on, used to optimize data access operations. This new approach was implemented and evaluated using the OptorSim simulator, sponsored by the LHC-CERN project and widely employed by the scientific community. Experiments confirm this new approach reduces application execution time in about 50 percent, specially when handling large amounts of data.

IDM - A New Parallel Methodology to Calculate the Determinant of Matrices of the Order n, with Computational Complexity O(n)

This paper presents a new parallel methodology for calculating the determinant of matrices of the order n, with computational complexity O(n), using the Gauss-Jordan Elimination Method and Chio's Rule as references. We intend to present our step-by-step methodology using clear mathematical language, where we will demonstrate how to calculate the determinant of a matrix of the order n in an analytical format. We will also present a computational model with one sequential algorithm and one parallel algorithm using a pseudo-code.