Porfidio Hernández

Porfidio Hernández

Auto-generated profile, based on publicly available information

Porfidio Hernández

Universitat Autónoma de Barcelona

Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2013 in Procedia Computer Science
Verified
Journal Article
Open access
ACAlejandro Chacón
Alejandro Chacón
JMJuan Carlos Moure
Juan Carlos Moure
AEAntonio Espinosa
Antonio Espinosa
PHPorfidio Hernández
Porfidio Hernández
Fast pattern matching is a requirement for many problems, specially for bioinformatics sequence analysis like short read mapping applications. This work presents a variation of the FM-index method, denoted n-step FM-index, that is applied in exact match genome search.We propose an alternative two-dimensional FM-index structure that allows backward-search navigation giving steps of n symbols at a time. The main advantages of this arrangement are the reduction of the computational work, but most importantly, the reduction by n of the chain of dependent data accesses, and the increase in the temporal locality of the data access pattern. This benefit comes at the expense of increasing the total amount of data required for the index.We present an in-depth performance analysis of a multi-core implementation of the algorithm using large references (up to 1.5G). We identify memory latency as the major performance limiter for single-thread execution and memory bandwidth for multi-thread execution. Our proposal provides speedups ranging from 1.4× to 2.4×, when there is no limitation on DRAM capacity.We also analyse the trade-off of compacting the proposed data structure in order to reduce memory capacity requirements, now at the expense of increasing execution time. An extra 33% of DRAM space allows our proposal to improve performance by 1.2×, while doubling DRAM size enables an additional 1.5×.Our proposal of n-step algorithm provides an alternative for pseudo-random memory access algorithms to be redesigned to scale in current and future computer systems

27 April 2024 in Environmental Modelling & Software
Verified
Journal Article
Open access
EFEdigley Fraga
Edigley Fraga
ACAna Cortés
Ana Cortés
TMTomàs Margalef
Tomàs Margalef
PHPorfidio Hernández
Porfidio Hernández
CCCarles Carrillo
Carles Carrillo

1 June 2013 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
JLJosep L. Lerida
Josep L. Lerida
FSFrancesc Solsona
Francesc Solsona
PHPorfidio Hernandez
Porfidio Hernandez
FGFrancesc Gine
Francesc Gine
MHMauricio Hanzich
Mauricio Hanzich
JCJosep Conde
Josep Conde

1 January 2005
Verified
Book Chapter
Closed access
PDF file
MHMauricio Hanzich
Mauricio Hanzich
FGFrancesc Giné
Francesc Giné
PHPorfidio Hernández
Porfidio Hernández
FSFrancesc Solsona
Francesc Solsona
ELEmilio Luque
Emilio Luque

15 September 2013
Verified
Conference Paper
Open access
PDF file
ABAprigio Bezerra
Aprigio Bezerra
PHPorfídio Hernández
Porfídio Hernández
AEAntonio Espinosa
Antonio Espinosa
JMJuan Carlos Moure
Juan Carlos Moure

1 December 2010 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
XYX.Y. Yang
X.Y. Yang
FCF. Cores
F. Cores
PHP. Hernández
P. Hernández
ARA. Ripoll
A. Ripoll
ELE. Luque
E. Luque