José R. Herrero

Prof. José R. Herrero

orcid

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

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

Representative Publications

View All Publications
22 July 2009 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
RBRosa M. Badia
Rosa M. Badia
JHJosé R. Herrero
José R. Herrero
JLJesús Labarta
Jesús Labarta
JPJosep M. Pérez
Josep M. Pérez
EQEnrique S. Quintana‐Ortí
Enrique S. Quintana‐Ortí
GQGregorio Quintana‐Ortí
Gregorio Quintana‐Ortí

1 December 2012 in Applied Mathematics Letters
Verified
Journal Article
Closed access
MGMiquel Grau-Sánchez
Miquel Grau-Sánchez
MNMiquel Noguera
Miquel Noguera
ÀGÀngela Grau
Àngela Grau
JHJosé R. Herrero
José R. Herrero

1 June 2020 in Computers & Mathematics with Applications
Verified
Journal Article
Closed access
JAJuan A. Acebrón
Juan A. Acebrón
JHJosé R. Herrero
José R. Herrero
JMJose Monteiro
Jose Monteiro

6 March 2007 in Applicable Algebra in Engineering, Communication and Computing
Verified
Journal Article
Closed access
PDF file
JHJosé R. Herrero
José R. Herrero
JNJuan J. Navarro
Juan J. Navarro

31 January 2019 in IEEE Access
Verified
Journal Article
Open access
SCSandra Catalan
Sandra Catalan
JHJosé R. Herrero
José R. Herrero
EQEnrique S. Quintana-Orti
Enrique S. Quintana-Orti
RRRafael Rodriguez-Sanchez
Rafael Rodriguez-Sanchez
RGRobert Van De Geijn
Robert Van De Geijn
We propose two novel techniques for overcoming load-imbalance encountered when implementing so-called look-ahead mechanisms in relevant dense matrix factorizations for the solution of linear systems. Both techniques target the scenario where two thread teams are created/activated during the factorization, with each team in charge of performing an independent task/branch of execution. The first technique promotes worker sharing (WS) between the two tasks, allowing the threads of the task that completes first to be reallocated for use by the costlier task. The second technique allows a fast task to alert the slower task of completion, enforcing the early termination (ET) of the second task, and a smooth transition of the factorization procedure into the next iteration. The two mechanisms are instantiated via a new malleable thread-level implementation of the basic linear algebra subprograms, and their benefits are illustrated via an implementation of the LU factorization with partial pivoting enhanced with look-ahead. Concretely, our experimental results on an Intel-Xeon system with 12 cores show the benefits of combining WS+ET, reporting competitive performance in comparison with a task-parallel runtime-based solution.

1 January 2003
Verified
Book Chapter
Closed access
PDF file
JHJosé R. Herrero
José R. Herrero
JNJuan J. Navarro
Juan J. Navarro