Jesús Alastruey Benedé

@article{navarro2023balancer,

title = {BALANCER: bandwidth allocation and cache partitioning for multicore processors},

author = {Agustín Navarro-Torres and Jesús Alastruey-Benedé and Pablo Ibáñez and Víctor Viñals-Yúfera},

url = {https://doi.org/10.1007/s11227-023-05070-0},

doi = {10.1007/s11227-023-05070-0},

year  = {2023},

date = {2023-01-01},

urldate = {2023-01-01},

journal = {The Journal of Supercomputing},

pages = {1--25},

publisher = {Springer},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{LOPEZVILLELLAS2023108742,

title = {Accurate and efficient constrained molecular dynamics of polymers using Newton's method and special purpose code},

author = {Lorién López-Villellas and Carl Christian Kjelgaard Mikkelsen and Juan José Galano-Frutos and Santiago Marco-Sola and Jesús Alastruey-Benedé and Pablo Ibáñez and Miquel Moretó and Javier Sancho and Pablo García-Risueño},

url = {https://www.sciencedirect.com/science/article/pii/S0010465523000875},

doi = {https://doi.org/10.1016/j.cpc.2023.108742},

issn = {0010-4655},

year  = {2023},

date = {2023-01-01},

journal = {Computer Physics Communications},

volume = {288},

pages = {108742},

abstract = {In molecular dynamics simulations we can often increase the time step by imposing constraints on bond lengths and bond angles. This allows us to extend the length of the time interval and therefore the range of physical phenomena that we can afford to simulate. We examine the existing algorithms and software for solving nonlinear constraint equations in parallel and we explain why it is necessary to advance the state-of-the-art. We present ILVES-PC, a new algorithm for imposing bond constraints on proteins accurately and efficiently. It solves the same system of differential algebraic equations as the celebrated SHAKE algorithm, but ILVES-PC solves the nonlinear constraint equations using Newton's method rather than the nonlinear Gauss-Seidel method. Moreover, ILVES-PC solves the necessary linear systems using a specialized linear solver that exploits the structure of the protein. ILVES-PC can rapidly solve constraint equations as accurately as the hardware will allow. The run-time of ILVES-PC is proportional to the number of constraints. We have integrated ILVES-PC into GROMACS and simulated proteins of different sizes. Compared with SHAKE, we have achieved speedups of up to 4.9× in single-threaded executions and up to 76× in shared-memory multi-threaded executions. Moreover, ILVES-PC is more accurate than P-LINCS algorithm. Our work is a proof-of-concept of the utility of software designed specifically for the simulation of polymers.},

keywords = {},

pubstate = {published},

tppubtype = {article}

}

@article{DBLP:journals/tcbb/LangaritaASIAM22,

title = {Compressed Sparse FM-Index: Fast Sequence Alignment Using Large K-Steps},

author = {Rubén Langarita and Adrià Armejach and Javier Setoain and Pablo Ibáñez-Marín and Jesús Alastruey-Benedé and Miquel Moretó},

url = {https://doi.org/10.1109/TCBB.2020.3000253},

doi = {10.1109/TCBB.2020.3000253},

year  = {2022},

date = {2022-01-01},

journal = {IEEE ACM Trans. Comput. Biol. Bioinform.},

volume = {19},

number = {1},

pages = {355--368},

keywords = {},

pubstate = {published},

tppubtype = {article}

}