Eduard Ayguadé

Prof. Eduard Ayguadé

Universitat Politècnica de Catalunya - Barcelona Tech
+1

Research Focus & Metrics

Academic Career Length

38Years (1989-Present)

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

Representative Publications

View All Publications
1 June 2011 in Parallel Processing Letters
Verified
Journal Article
Closed access
ADAlejandro Duran
Alejandro Duran
EAEduard Ayguadé
Eduard Ayguadé
RBRosa M. Badia
Rosa M. Badia
JLJesús Labarta
Jesús Labarta
LMLuis Martinell
Luis Martinell
JPJudit Planas
Judit Planas

27 June 2008 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
EAEduard Ayguadé
Eduard Ayguadé
NCNawal Copty
Nawal Copty
ADAlejandro Duran
Alejandro Duran
JHJay Hoeflinger
Jay Hoeflinger
YLYuan Lin
Yuan Lin
GZGuansong Zhang
Guansong Zhang
OpenMP has been very successful in exploiting structured parallelism in applications. With increasing application complexity, there is a growing need for addressing irregular parallelism in the presence of complicated control structures. This is evident in various efforts by the industry and research communities to provide a solution to this challenging problem. One of the primary goals of OpenMP 3.0 is to define a standard dialect to express and efficiently exploit unstructured parallelism. This paper presents the design of the OpenMP tasking model by members of the OpenMP 3.0 tasking sub-committee which was formed for this purpose. The paper summarizes the efforts of the sub-committee (spanning over two years) in designing, evaluating and seamlessly integrating the tasking model into the OpenMP specification. In this paper, we present the design goals and key features of the tasking model, including a rich set of examples and an in-depth discussion of the rationale behind various design choices. We compare a prototype implementation of the tasking model with existing models, and evaluate it on a wide range of applications. The comparison shows that the OpenMP tasking model provides expressiveness, flexibility, and huge potential for performance and scalability.

1 September 2009
Verified
Conference Paper
Closed access
ADAlejandro Duran
Alejandro Duran
XTXavier Teruel
Xavier Teruel
RFRoger Ferrer
Roger Ferrer
XMXavier Martorell
Xavier Martorell
EAEduard Ayguadé
Eduard Ayguadé
Traditional parallel applications have exploited regular parallelism, based on parallel loops. Only a few applications exploit sections parallelism. With the release of the new OpenMP specification (3.0), this programming model supports tasking. Parallel tasks allow the exploitation of irregular parallelism, but there is a lack of benchmarks exploiting tasks in OpenMP. With the current (and projected) multicore architectures that offer many more alternatives to execute parallel applications than traditional SMP machines, this kind of parallelism is increasingly important. And so, the need to have some set of benchmarks to evaluate it. In this paper, we motivate the need of having such a benchmarks suite, for irregular and/or recursive task parallelism. We present our proposal, the Barcelona OpenMP Tasks Suite (BOTS), with a set of applications exploiting regular and irregular parallelism, based on tasks. We present an overall evaluation of the BOTS benchmarks in an Altix system and we discuss some of the different experiments that can be done with the different compilation and runtime alternatives of the benchmarks.

2 June 2009 in The International Journal of High Performance Computing Applications
Verified
Journal Article
Closed access
PDF file
JPJudit Planas
Judit Planas
RBRosa M. Badia
Rosa M. Badia
EAEduard Ayguadé
Eduard Ayguadé
JLJesus Labarta
Jesus Labarta
Programming models for multicore and many-core systems are listed as one of the main challenges in the near future for computing research. These programming models should be able to exploit the underlying platform, but also should have good programmability to enable programmer productivity. With respect to the heterogeneity and hierarchy of the underlying platforms, the programming models should take them into account but they should also enable the programmer to be unaware of the complexity of the hardware. In this paper we present an extension of the StarSs syntax to support task hierarchy. A motivation for such a hierarchical approach is presented through experimentation with CellSs. A prototype implementation of such a hierarchical task-based programming model that combines a first task level with SMPSs and a second task level with CellSs is presented. The preliminary results obtained when executing a matrix multiplication and a Cholesky factorization show the viability and potential of the approach and the current issues raised.

1 May 2012
Verified
Conference Paper
Closed access
JBJavier Bueno
Javier Bueno
JPJudit Planas
Judit Planas
ADAlejandro Duran
Alejandro Duran
RBRosa M. Badia
Rosa M. Badia
XMXavier Martorell
Xavier Martorell
JLJesus Labarta
Jesus Labarta
Clusters of GPUs are emerging as a new computational scenario. Programming them requires the use of hybrid models that increase the complexity of the applications, reducing the productivity of programmers. We present the implementation of OmpSs for clusters of GPUs, which supports asynchrony and heterogeneity for task parallelism. It is based on annotating a serial application with directives that are translated by the compiler. With it, the same program that runs sequentially in a node with a single GPU can run in parallel in multiple GPUs either local (single node) or remote (cluster of GPUs). Besides performing a task-based parallelization, the runtime system moves the data as needed between the different nodes and GPUs minimizing the impact of communication by using affinity scheduling, caching, and by overlapping communication with the computational task. We show several applications programmed with OmpSs and their performance with multiple GPUs in a local node and in remote nodes. The results show good tradeoff between performance and effort from the programmer.

1 January 2010
Verified
Conference Paper
Closed access
JPJorda Polo
Jorda Polo
DCDavid Carrera
David Carrera
YBYolanda Becerra
Yolanda Becerra
MSMalgorzata Steinder
Malgorzata Steinder
IWIan Whalley
Ian Whalley
EAEduard Ayguadé
Eduard Ayguadé
MapReduce is a data-driven programming model proposed by Google in 2004 which is especially well suited for distributed data analytics applications. We consider the management of MapReduce applications in an environment where multiple applications share the same physical resources. Such sharing is in line with recent trends in data center management which aim to consolidate workloads in order to achieve cost and energy savings. In a shared environment, it is necessary to predict and manage the performance of workloads given a set of performance goals defined for them. In this paper, we address this problem by introducing a new task scheduler for a MapReduce framework that allows performance-driven management of MapReduce tasks. The proposed task scheduler dynamically predicts the performance of concurrent MapReduce jobs and adjusts the resource allocation for the jobs. It allows applications to meet their performance objectives without over-provisioning of physical resources.