Gregorio Quintana-Ortí
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gregorio Quintana-Ortí has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Enrique S. Quintana Orti
Universitat Politécnica de Valencia, Valencia, Spain
5 shared publications - Francisco D. Igual
Universidad Complutense de Madrid
4 shared publications - Fernando Hernando
Instituto Universitario de Matemáticas y Aplicaciones de Castellón and Departamento de Matemáticas, Universitat Jaume I, Castelló, Spain
2 shared publications - Maribel Castillo
Universidad Jaume I
2 shared publications - Mercedes Marqués
Universidad Jaime I
2 shared publications - Robert A. van de Geijn
Department of Computer Science & Oden Institute The University of Texas at Austin Austin 78712 TX U. S. A
2 shared publications
Latest Publications
- Open Access
Parallel Implementations for Computing the Minimum Distance of a Random Linear Code on Multicomputers
The minimum distance of a linear code is a key concept in information theory. Therefore, the time required by its computation is very important to many problems in this area. In this paper, we introduce a family of implementations of the Brouwer-Zimmermann algorithm for distributed-memory architectures for computing the minimum distance of a random linear code over F2. Both current commercial and public-domain software only work on either unicore architectures or shared-memory architectures, which are limited in the number of cores/processors employed in the computation. Our implementations focus on distributed-memory architectures, thus being able to employ hundreds or even thousands of cores in the computation of the minimum distance. Our experimental results show that our implementations are much faster, even up to several orders of magnitude, than current implementations widely used nowadays.
Open AccessParallel Implementations for Computing the Minimum Distance of a Random Linear Code on Multicomputers
The minimum distance of a linear code is a key concept in information theory. Therefore, the time required by its computation is very important to many problems in this area. In this paper, we introduce a family of implementations of the Brouwer-Zimmermann algorithm for distributed-memory architectures for computing the minimum distance of a random linear code over F2. Both current commercial and public-domain software only work on either unicore architectures or shared-memory architectures, which are limited in the number of cores/processors employed in the computation. Our implementations focus on distributed-memory architectures, thus being able to employ hundreds or even thousands of cores in the computation of the minimum distance. Our experimental results show that our implementations are much faster, even up to several orders of magnitude, than current implementations widely used nowadays.
- Open Access
Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code
The minimum distance of a code is an important concept in information theory. Hence, computing the minimum distance of a code with a minimum computational cost is a crucial process to many problems in this area. In this paper, we present and evaluate a family of algorithms and implementations to compute the minimum distance of a random linear code over $\mathbb{F}_{2}$ that are faster than different current implementations. In addition to the basic sequential implementations, we present parallel and vectorized implementations that render high performances on modern architectures. The attained performance results show the benefits of the developed optimized algorithms, which obtain remarkable performance improvements compared with state-of-the-art implementations widely used nowadays.Open AccessFast Algorithms for the Computation of the Minimum Distance of a Random Linear Code
The minimum distance of a code is an important concept in information theory. Hence, computing the minimum distance of a code with a minimum computational cost is a crucial process to many problems in this area. In this paper, we present and evaluate a family of algorithms and implementations to compute the minimum distance of a random linear code over $\mathbb{F}_{2}$ that are faster than different current implementations. In addition to the basic sequential implementations, we present parallel and vectorized implementations that render high performances on modern architectures. The attained performance results show the benefits of the developed optimized algorithms, which obtain remarkable performance improvements compared with state-of-the-art implementations widely used nowadays. - Open Access
Towards an Efficient Use of the BLAS Library for Multilinear Tensor Contractions
Mathematical operators whose transformation rules constitute the building blocks of a multi-linear algebra are widely used in physics and engineering applications where they are very often represented as tensors. In the last century, thanks to the advances in tensor calculus, it was possible to uncover new research fields and make remarkable progress in the existing ones, from electromagnetism to the dynamics of fluids and from the mechanics of rigid bodies to quantum mechanics of many atoms. By now, the formal mathematical and geometrical properties of tensors are well defined and understood; conversely, in the context of scientific and high-performance computing, many tensor- related problems are still open. In this paper, we address the problem of efficiently computing contractions among two tensors of arbitrary dimension by using kernels from the highly optimized BLAS library. In particular, we establish precise conditions to determine if and when GEMM, the kernel for matrix products, can be used. Such conditions take into consideration both the nature of the operation and the storage scheme of the tensors, and induce a classification of the contractions into three groups. For each group, we provide a recipe to guide the users towards the most effective use of BLAS.
Open AccessTowards an Efficient Use of the BLAS Library for Multilinear Tensor Contractions
Mathematical operators whose transformation rules constitute the building blocks of a multi-linear algebra are widely used in physics and engineering applications where they are very often represented as tensors. In the last century, thanks to the advances in tensor calculus, it was possible to uncover new research fields and make remarkable progress in the existing ones, from electromagnetism to the dynamics of fluids and from the mechanics of rigid bodies to quantum mechanics of many atoms. By now, the formal mathematical and geometrical properties of tensors are well defined and understood; conversely, in the context of scientific and high-performance computing, many tensor- related problems are still open. In this paper, we address the problem of efficiently computing contractions among two tensors of arbitrary dimension by using kernels from the highly optimized BLAS library. In particular, we establish precise conditions to determine if and when GEMM, the kernel for matrix products, can be used. Such conditions take into consideration both the nature of the operation and the storage scheme of the tensors, and induce a classification of the contractions into three groups. For each group, we provide a recipe to guide the users towards the most effective use of BLAS.
- 10 March 2012
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 25 (3) , 367-384
Scheduling algorithms‐by‐blocks on small clusters
SUMMARY: The arrival of multicore architectures has generated an interest in reformulating dense matrix computations as algorithms‐by‐blocks, where submatrices are units of data and computations with those blocks are units of computation. Rather than directly executing such an algorithm, a directed acyclic graph is generated at runtime that is then scheduled by a runtime system such as SuperMatrix. The benefit is a clear separation of concerns between the library and the heuristics for scheduling. In this paper, we show that this approach can be taken one step further using the same methodology and an ad hoc runtime to map algorithms‐by‐blocks to small clusters. With no change to the library code, and the application that uses it, the computational power of such small clusters can be utilized. An impressive performance on a number of small clusters is reported. As a proof of the flexibility of the solution, we report performance results on accelerated clusters based on graphics processors. We believe this to be a possible step towards programming many‐core architectures, as demonstrated by a port of the solution to Intel's Single‐chip Cloud Computer (Intel, Santa Clara, CA, USA). Copyright © 2012 John Wiley & Sons, Ltd.
- 10 March 2012
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 25 (3) , 367-384
Scheduling algorithms‐by‐blocks on small clusters
SUMMARY: The arrival of multicore architectures has generated an interest in reformulating dense matrix computations as algorithms‐by‐blocks, where submatrices are units of data and computations with those blocks are units of computation. Rather than directly executing such an algorithm, a directed acyclic graph is generated at runtime that is then scheduled by a runtime system such as SuperMatrix. The benefit is a clear separation of concerns between the library and the heuristics for scheduling. In this paper, we show that this approach can be taken one step further using the same methodology and an ad hoc runtime to map algorithms‐by‐blocks to small clusters. With no change to the library code, and the application that uses it, the computational power of such small clusters can be utilized. An impressive performance on a number of small clusters is reported. As a proof of the flexibility of the solution, we report performance results on accelerated clusters based on graphics processors. We believe this to be a possible step towards programming many‐core architectures, as demonstrated by a port of the solution to Intel's Single‐chip Cloud Computer (Intel, Santa Clara, CA, USA). Copyright © 2012 John Wiley & Sons, Ltd.
- 12 February 2010
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 58 (2) , 145-150
Using desktop computers to solve large-scale dense linear algebra problems
- 12 February 2010
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 58 (2) , 145-150
Using desktop computers to solve large-scale dense linear algebra problems
- 30 November 2009
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 24 (6) , 521-538
Out-of-core solution of linear systems on graphics processors
We combine two high-level application programming interfaces to solve large-scale linear systems with the data stored on disk using current graphics processors (GPU). The result is a simple yet powerful tool that enables a fast development of object-oriented codes, implemented as Matlab M-scripts, for linear algebra operations. The approach enhances the programmability of the solutions in this problem domain while unleashing the high performance of GPU. Experimental results are reported from Octave, linked with the implementation of basic linear algebra subprograms by Nvidia; as an additional novelty, we evaluate the performance of our approach for the Nvidia new double-precision graphics hardware.
- 30 November 2009
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 24 (6) , 521-538
Out-of-core solution of linear systems on graphics processors
We combine two high-level application programming interfaces to solve large-scale linear systems with the data stored on disk using current graphics processors (GPU). The result is a simple yet powerful tool that enables a fast development of object-oriented codes, implemented as Matlab M-scripts, for linear algebra operations. The approach enhances the programmability of the solutions in this problem domain while unleashing the high performance of GPU. Experimental results are reported from Octave, linked with the implementation of basic linear algebra subprograms by Nvidia; as an additional novelty, we evaluate the performance of our approach for the Nvidia new double-precision graphics hardware.
- 15 July 2008
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 48 (3) , 563-584
Blocked algorithms for the reduction to Hessenberg-triangular form revisited
- 15 July 2008
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 48 (3) , 563-584
Blocked algorithms for the reduction to Hessenberg-triangular form revisited
- 1 May 2008
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 48 (1) , 88-114
Toward the parallelization of GSL
- 1 May 2008
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 48 (1) , 88-114
Toward the parallelization of GSL
- 7 December 2005
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 28 (1) , 51-83
Solving Stable Sylvester Equations via Rational Iterative Schemes
- 7 December 2005
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 28 (1) , 51-83
Solving Stable Sylvester Equations via Rational Iterative Schemes