Fabio Verbosio

Fabio Verbosio

Auto-generated profile, based on publicly available information

Fabio Verbosio

Universita della Svizzera italiana, Institute of Computational Science, Lugano, Switzerland

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
1 September 2017 in Journal of Computational Science
Verified
Journal Article
Closed access
FVFabio Verbosio
Fabio Verbosio
ACArne De Coninck
Arne De Coninck
DKDrosos Kourounis
Drosos Kourounis
OSOlaf Schenk
Olaf Schenk

1 May 2016 in Genetics
Verified
Journal Article
Closed access
PDF file
ACArne De Coninck
Arne De Coninck
Bernard De BaetsBernard De Baets
Bernard De Baets
DKDrosos Kourounis
Drosos Kourounis
FVFabio Verbosio
Fabio Verbosio
OSOlaf Schenk
Olaf Schenk
JFJan Fostier
Jan Fostier
Genomic prediction relies on genotypic marker information to predict the agronomic performance of future hybrid breeds based on trial records. Because the effect of markers may vary substantially under the influence of different environmental conditions, marker-by-environment interaction effects have to be taken into account. However, this may lead to a dramatic increase in the computational resources needed for analyzing large-scale trial data. A high-performance computing solution, called Needles, is presented for handling such data sets. Needles is tailored to the particular properties of the underlying algebraic framework by exploiting a sparse matrix formalism where suited and by utilizing distributed computing techniques to enable the use of a dedicated computing cluster. It is demonstrated that large-scale analyses can be performed within reasonable time frames with this framework. Moreover, by analyzing simulated trial data, it is shown that the effects of markers with a high environmental interaction can be predicted more accurately when more records per environment are available in the training data. The availability of such data and their analysis with Needles also may lead to the discovery of highly contributing QTL in specific environmental conditions. Such a framework thus opens the path for plant breeders to select crops based on these QTL, resulting in hybrid lines with optimized agronomic performance in specific environmental conditions.

1 March 2015
Verified
Conference Paper
Open access
ACArne De Coninck
Arne De Coninck
DKDrosos Kourounis
Drosos Kourounis
FVFabio Verbosio
Fabio Verbosio
OSOlaf Schenk
Olaf Schenk
Bernard De BaetsBernard De Baets
Bernard De Baets
JFJan Fostier
Jan Fostier
Genomic prediction for plant breeding requires taking into account environmental effects and variations of genetic effects across environments. The latter can be modelled by estimating the effect of each genetic marker in every possible environmental condition, which leads to a huge amount of effects to be estimated. Nonetheless, the information about these effects is only sparsely present, due to the fact that plants are only tested in a limited number of environmental conditions. In contrast, the genotypes of the plants are a dense source of information and thus the estimation of both types of effects in one single step would require as well dense as sparse matrix formalisms. This paper presents a way to efficiently apply a high performance computing infrastructure for dealing with large-scale genomic prediction settings, relying on the coupling of dense and sparse matrix algebra.

1 September 2018
Verified
Conference Paper
Closed access
FVFabio Verbosio
Fabio Verbosio
JKJuraj Kardos
Juraj Kardos
MBMauro Bianco
Mauro Bianco
OSOlaf Schenk
Olaf Schenk
Selected inversion problems must be addressed in several research fields like physics, genetics, weather forecasting, and finance, in order to extract selected entries from the inverse of large, sparse matrices. State-of-the-art algorithms are either based on the LU factorization or on an iterative process. Both approaches present computational bottlenecks related to prohibitive memory requirements or extremely high running time for large-scale matrices. In recent years, in order to overcome such limitations, an alternative approach for computing stochastic estimates of the inverse entries has been developed. In this work, we present a stochastic estimator for the diagonal of the inverse and test its performance on a dataset of symmetric, positive semidefinite matrices coming from the field of atomistic quantum transport simulations with nonequilibrium Green's functions (NEGF) formalism. In such a framework, it is required to solve the Schrödinger equation thousands of times, demanding the computation of the diagonal of the retarded Green's function, i.e., the inverse of a large, sparse matrix including open boundary conditions. Given the nature and the structure of the NEGF matrices, our stochastic estimation framework exploits the capabilities of a stencil-based, matrix-free code, avoiding the fill-in and lack of scalability that the LV-based methods present for three-dimensional nanoelectronic devices. We also illustrate the impact of the stochastic estimator by comparing its accuracy against existing methods and demonstrate its scalability performance on the “Piz Daint” cluster at the Swiss National Supercomputing Center, preparing for postpetascale three-dimensional nanoscale calculations.

1 January 2015
Verified
Journal Article
Closed access
ACA De Coninck
A De Coninck
DKD Kourounis
D Kourounis
FVF Verbosio
F Verbosio
OSO Schenk
O Schenk
Bernard De BaetsBernard De Baets
Bernard De Baets
JFJan Fostier
Jan Fostier