Jose Antonio Pascual
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jose Antonio Pascual has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Javier Navaridas
The University of Manchester
18 shared publications - Jose Miguel-Alonso
University of the Basque Country UPV/EHU
12 shared publications - Jose Antonio Lozano
Basque Center for Applied Mathematics (BCAM)
7 shared publications - Aitor Belenguer
Department of Computer Architecture and Technology, University of the Basque Country UPV/EHU, Manuel Lardizabal 1, 20018, Donostia-San Sebastian, Spain
3 shared publications Caroline Concatto
School of Computer Science University of Manchester Manchester UK
3 shared publicationsAndrew Attwood
School of Computer Science University of Manchester Manchester UK
2 shared publications
Latest Publications
- Open Access
- 19 October 2026
- Published by Elsevier in Journal of Systems Architecture
- Vol. 181
SNNorlax: Accelerating the training and inference of Spiking Neural Networks on FPGA
- 19 October 2026
- Published by Elsevier in Journal of Systems Architecture
- Vol. 181
Open AccessSNNorlax: Accelerating the training and inference of Spiking Neural Networks on FPGA
- Open Access
- 12 April 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 213
GLow - A Novel, Flower-Based Simulated Gossip Learning Strategy
- 12 April 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 213
Open AccessGLow - A Novel, Flower-Based Simulated Gossip Learning Strategy
- 1 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 148-155
On the Performance of Dragonfly Connection Rules
- 1 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 148-155
On the Performance of Dragonfly Connection Rules
- Open Access
Acceleration of Parallel Tempering for Markov Chain Monte Carlo methods
Markov Chain Monte Carlo methods are algorithms used to sample probability distributions, commonly used to sample the Boltzmann distribution of physical/chemical models (e.g., protein folding, Ising model, etc.). This allows us to study their properties by sampling the most probable states of those systems. However, the sampling capabilities of these methods are not sufficiently accurate when handling complex configuration spaces. This has resulted in the development of new techniques that improve sampling accuracy, usually at the expense of increasing the computational cost. One of such techniques is Parallel Tempering which improves accuracy by running several replicas which periodically exchange their states. Computationally, this imposes a significant slow-down, which can be counteracted by means of parallelization. These schemes enable MCMC/PT techniques to be run more effectively and allow larger models to be studied. In this work, we present a parallel implementation of Metropolis-Hastings with Parallel Tempering, using OpenMP and CUDA for the parallelization in modern CPUs and GPUs, respectively. The results show a maximum speed-up of 52x using OpenMP with 48 cores, and of 986x speed-up with the CUDA version. Furthermore, the results serve as a basic benchmark to compare a future quantum implementation of the same algorithm.
Open AccessAcceleration of Parallel Tempering for Markov Chain Monte Carlo methods
Markov Chain Monte Carlo methods are algorithms used to sample probability distributions, commonly used to sample the Boltzmann distribution of physical/chemical models (e.g., protein folding, Ising model, etc.). This allows us to study their properties by sampling the most probable states of those systems. However, the sampling capabilities of these methods are not sufficiently accurate when handling complex configuration spaces. This has resulted in the development of new techniques that improve sampling accuracy, usually at the expense of increasing the computational cost. One of such techniques is Parallel Tempering which improves accuracy by running several replicas which periodically exchange their states. Computationally, this imposes a significant slow-down, which can be counteracted by means of parallelization. These schemes enable MCMC/PT techniques to be run more effectively and allow larger models to be studied. In this work, we present a parallel implementation of Metropolis-Hastings with Parallel Tempering, using OpenMP and CUDA for the parallelization in modern CPUs and GPUs, respectively. The results show a maximum speed-up of 52x using OpenMP with 48 cores, and of 986x speed-up with the CUDA version. Furthermore, the results serve as a basic benchmark to compare a future quantum implementation of the same algorithm.
- Open Access
- 24 June 2025
- Published by Cambridge University Press (CUP) in Natural Language Processing
- Vol. 31 (6) , 1450-1469
Propagating machine translation traits to predict potential impact on the target language
Research suggests that the texts produced using machine translation (MT) do not fully represent the linguistic traits of the natural language. Yet, the ever-increasing quality and access to MT is resulting in its steady adoption by both language professionals and general users. According to contact linguistic theories, such adoption might result in MT-specific language traits permeating the target languages. This work takes a first step into considering the changes that a language might endure over time by observing the variation of linguistic trends along a series of MT generations. We train ten sequential engines using each to produce the target side of the training corpus of the following and calculate a number of metrics to observe linguistic diversity at a lexical, morphological, and syntactic level for a large, fixed test set. Quantitative results show an initial loss of lexical diversity, which, albeit gradually, only continues at a much slower pace in the following MT generations. In turn, structural variations and, in particular, morphological variations across generations are less marked, which might indicate a more stable behaviour regarding grammatical consistency. Overall, the resulting MT language seems increasingly homogeneous, marked by the reduced presence or disappearance of low-frequency words, and compact, with a decreasing proportion of function words relative to content words.
- 24 June 2025
- Published by Cambridge University Press (CUP) in Natural Language Processing
- Vol. 31 (6) , 1450-1469
Open AccessPropagating machine translation traits to predict potential impact on the target language
Research suggests that the texts produced using machine translation (MT) do not fully represent the linguistic traits of the natural language. Yet, the ever-increasing quality and access to MT is resulting in its steady adoption by both language professionals and general users. According to contact linguistic theories, such adoption might result in MT-specific language traits permeating the target languages. This work takes a first step into considering the changes that a language might endure over time by observing the variation of linguistic trends along a series of MT generations. We train ten sequential engines using each to produce the target side of the training corpus of the following and calculate a number of metrics to observe linguistic diversity at a lexical, morphological, and syntactic level for a large, fixed test set. Quantitative results show an initial loss of lexical diversity, which, albeit gradually, only continues at a much slower pace in the following MT generations. In turn, structural variations and, in particular, morphological variations across generations are less marked, which might indicate a more stable behaviour regarding grammatical consistency. Overall, the resulting MT language seems increasingly homogeneous, marked by the reduced presence or disappearance of low-frequency words, and compact, with a decreasing proportion of function words relative to content words.
- Open Access
- 20 May 2025
- Published by Elsevier in Computer Networks
- Vol. 267
Improving the performance of Dragonfly networks through restrictive Proxy routing strategies
- 20 May 2025
- Published by Elsevier in Computer Networks
- Vol. 267
Open AccessImproving the performance of Dragonfly networks through restrictive Proxy routing strategies
- Top Cited PapersOpen Access
- 5 January 2025
- Published by Elsevier in Computer Networks
- Vol. 258
A Review of Federated Learning Applications in Intrusion Detection Systems
- 5 January 2025
- Published by Elsevier in Computer Networks
- Vol. 258
Top Cited PapersOpen AccessA Review of Federated Learning Applications in Intrusion Detection Systems
- Open Access
- 7 February 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (9) , 12021-12042
On the parallelization of multipacting simulation codes for the design of particle accelerator components
Particle trajectory and collision simulation is a critical step of the design and construction of novel particle accelerator components. However it requires a huge computational effort which can slow down the design process. We started from a sequential simulation program which is used to study an event called Multipacting. Our work explains the physical problem that is simulated and the implications it can have on the behavior of the components. Then we analyze the original program’s operation to find the best options for parallelization. We first developed a parallel version of the Multipacting simulation and were able to accelerate the execution up to $$\sim 35\times $$ with 48 or 56 cores. In the best cases, parallelization efficiency was maintained up to 16 cores ( $$\sim 95$$ %) and the speed-up plateaus at around 40–48 cores. When this first parallelization effort was tried for multi-power simulations, we found that parallelism was severely limited with a maximum of $$20\times $$ speed-up. For this reason, we introduced a new method to improve the parallelization efficiency for this second use case. This method uses a shared processor pool for all simulations of electrons (OnePool). OnePool improved scalability by pushing the speed-up to over $$32\times $$ .- 7 February 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (9) , 12021-12042
Open AccessOn the parallelization of multipacting simulation codes for the design of particle accelerator components
Particle trajectory and collision simulation is a critical step of the design and construction of novel particle accelerator components. However it requires a huge computational effort which can slow down the design process. We started from a sequential simulation program which is used to study an event called Multipacting. Our work explains the physical problem that is simulated and the implications it can have on the behavior of the components. Then we analyze the original program’s operation to find the best options for parallelization. We first developed a parallel version of the Multipacting simulation and were able to accelerate the execution up to $$\sim 35\times $$ with 48 or 56 cores. In the best cases, parallelization efficiency was maintained up to 16 cores ( $$\sim 95$$ %) and the speed-up plateaus at around 40–48 cores. When this first parallelization effort was tried for multi-power simulations, we found that parallelism was severely limited with a maximum of $$20\times $$ speed-up. For this reason, we introduced a new method to improve the parallelization efficiency for this second use case. This method uses a shared processor pool for all simulations of electrons (OnePool). OnePool improved scalability by pushing the speed-up to over $$32\times $$ . - Open Access
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 35 (2) , 338-348
Understanding the Impact of Arbitration in MZI-Based Beneš Switching Fabrics
Top-of-rack switches based on photonic switching fabrics (PSF) could provide higher bandwidth and energy efficiency for datacenters (DC) and high-performance computers (HPC) than these with traditional electronic crossbars. However, because of their bufferless nature, PFS are affected by contention much more drastically than traditional packet-switched electronic networks where traffic can advance towards its destination, getting buffered upon encountering contention and resuming transmission once resources are freed. In contrast, PSFs stop the injection of all traffic that generate contention. Consequently, it is important to understand how the order in which flows are serviced affects performance metrics. Our contribution is to quantify this impact through a comprehensive simulation-based evaluation focusing on a recently fabricated PSF prototype. Our experiments include configurations with three routing algorithms, two switching methods, three ToR switch sizes and 9 representative workloads from the DC and HPC domains. We found that the effect of arbitration on raw throughput is negligible but, when considering more realistic loads, selecting an appropriate arbitration policy can improve communication time and energy efficiency. Indeed, the communication time can be reduced by between 10% and 30% by employing appropriate arbitration. Switching energy efficiency can also be improved between 4% and 13%. Finally, insertion loss is barely affected, with differences below 2%. LFU and ARR were found to obtain the best results. LFU is very good with regular workloads but one of the worse with irregular workloads. ARR obtains good results regardless of the type of workload.
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 35 (2) , 338-348
Open AccessUnderstanding the Impact of Arbitration in MZI-Based Beneš Switching Fabrics
Top-of-rack switches based on photonic switching fabrics (PSF) could provide higher bandwidth and energy efficiency for datacenters (DC) and high-performance computers (HPC) than these with traditional electronic crossbars. However, because of their bufferless nature, PFS are affected by contention much more drastically than traditional packet-switched electronic networks where traffic can advance towards its destination, getting buffered upon encountering contention and resuming transmission once resources are freed. In contrast, PSFs stop the injection of all traffic that generate contention. Consequently, it is important to understand how the order in which flows are serviced affects performance metrics. Our contribution is to quantify this impact through a comprehensive simulation-based evaluation focusing on a recently fabricated PSF prototype. Our experiments include configurations with three routing algorithms, two switching methods, three ToR switch sizes and 9 representative workloads from the DC and HPC domains. We found that the effect of arbitration on raw throughput is negligible but, when considering more realistic loads, selecting an appropriate arbitration policy can improve communication time and energy efficiency. Indeed, the communication time can be reduced by between 10% and 30% by employing appropriate arbitration. Switching energy efficiency can also be improved between 4% and 13%. Finally, insertion loss is barely affected, with differences below 2%. LFU and ARR were found to obtain the best results. LFU is very good with regular workloads but one of the worse with irregular workloads. ARR obtains good results regardless of the type of workload.
- Open Access
- 28 April 2023
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 217, 103653
GöwFed
- 28 April 2023
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 217, 103653
Open AccessGöwFed