Bioinformatics is one of the areas affected by current HPC problems due to the exponential growth of biological data in the last years and the increasing number of bioinformatics applications demanding HPC to meet performance requirements. One of these applications is sequence alignment, which is considered to be fundamental procedure in biological sciences. The alignment process compares two or more biological sequences and its purpose is to identify regions of similarity among them. The Smith-Waterman (SW) algorithm is a popular method for local sequence alignment that has been used as the basis for many subsequent algorithms, and is often employed...
Software production and maintenance is one of the most widely studied topics in computer science. Taking into account that scientists were the first ones to perform this task, even before the Computer Science discipline obtained its name, scientific software production still remains a challenge. This phenomenon may stem from the fact that some authors realized that there is a "gap" between scientific production techniques and industry software techniques . This research work is founded on two relevant contributions to this subject. The first one, the Aristotelian analysis performed by Frederick Brooks on software essence that has been beautifully described in...
De Giusti, Laura Cristina; Leibovich, Fabiana Yael; Chichizola, Franco; Naiouf, Marcelo
Possible methodologies for teaching the concepts of processor heterogeneity and its impact on speedup and efficiency in a parallel system are discussed, as well as energy efficiency of parallel algorithms based on processor power.
CMRE (Concurrent Multi Robot Environment) is expanded to be able to consider different virtual clocks in each robot (processor), as well as the cost – both in relation to time and energy consumption – of the operations carried out by the robots (Move, Put Down / Pick Up / Message / Inform).
In this paper, we analyze some examples to show how concepts are introduced to students.
Riveros, Francisco; Benítez, Néstor; Paciello, Julio; Barán, Benjamín
Evolutionary algorithms present performance drawbacks when applied to Many-objective Optimization Problems (MaOPs). In this work, a novel approach based on Ant Colony Optimization theory (ACO), denominated ACO λ base-p algorithm, is proposed in order to handle Manyobjective instances of the well-known Traveling Salesman Problem (TSP). The proposed algorithm was applied to several Many-objective TSP instances, verifying the quality of the experimental results using the Hypervolume metric. A comparison with other state-of-the-art Multi Objective ACO algorithms as MAS, M3AS and MOACS as well as NSGA2 evolutionary algorithm was made, verifying that the best experimental results were obtained when the proposed algorithm...
Castro Lechtaler, Antonio; Cipriano, Marcelo; Malvacio, Eduardo
This article calculates the theoretical probability of finding repeated primes in a given sample of unbiased issued digital certificates. These values can be used as reference for developing a statistical procedure to audit and control the behavioral pattern of a Public Key Infrastructure (PKI), thus allowing the detection of operational anomalies and the prevention of vulnerabilities of this nature.
Basgall, María José; Hasperué, Waldo; Naiouf, Marcelo
Knowledge Discovery in Databases (KDD) techniques present limitations when the volume of data to process is very large. Any KDD algorithm needs to do several iterations on the complete set of data in order to carry out its work. For continuous data stream processing it is necessary to store part of it in a temporal window.
In this paper, we present a technique that uses the size of the temporal window in a dynamic way, based on the frequency of the data arrival and the response time of the KDD task. The obtained results show that this technique reaches a great...
Gómez Sánchez, Pilar; Encinas, Diego; Panadero, Javier; Bezerra, Aprigio; Méndez, Sandra; Naiouf, Marcelo; De Giusti, Armando Eduardo; Rexachs del Rosario, Dolores; Luque, e
In recent years, the use of public cloud platforms as infrastructure has been gaining popularity in many scientific areas and High Performance Computing (HPC) is no exception. These kinds of platforms can be used by system administrators as Test-Bed systems for evaluating and detecting performance inefficiencies in the I/O subsystem, and for taking decisions about the configuration parameters that have influence on the performance of an application, without compromising the performance of the production HPC system. In this paper, we propose a methodology to evaluate parallel applications by using virtual clusters as a test system.
Our experimental validation indicates that virtual...