Victoria Sanz

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Discrete optimization problems are interesting due to their complexity and applications, particularly in robotics. In this paper, a parallel algorithm that allows finding solutions to these problems, is presented. Then, the modifications that can be applied to it to obtain a second parallel algorithm that finds suboptimal solutions, reducing computation(More)
An analysis of a parallel solution of N<sup>2</sup>-1 puzzle using clusters, is presented. This problem is interesting due to its complexity and related applications, particularly in the field of robotics. A variation of classic heuristics for forecasting the work to be done in order to reach a solution is analyzed, and it is shown that its use(More)
In this paper, a performance analysis of a matrix diagonalization algorithm with Jacobi method on a multicore architecture is presented. For this, a block-based sequential algorithm was implemented using the CBLAS library, which improves classic sequential algorithms, and then an algorithm for the parallel resolution of the problem with the shared memory(More)
This article presents a performance analysis of the symmetric encryption algorithm AES (Advanced Encryption Standard) on a machine with one GPU and a cluster of GPUs, for cases in which the memory required by the algorithm is more than that of a GPU. Two implementations were carried out, based on C language, that use the tool CUDA in the case of a single(More)
An analysis of a parallel solution of N 2-1 Puzzle using clusters, is presented. This problem is interesting due to its complexity and related applications, particularly in the field of robotics. A variation of classic heuristics for forecasting the work to be done in order to reach a solution is analyzed, and it is shown that its use significantly improves(More)
  • 1