Publications

@proceedings{Llort2016,
title = {The Secrets of the Accelerators Unveiled: Tracing Heterogeneous Executions Through OMPT},
author = {Germán Llort and Antonio Filgu eras and Daniel Ji ménez-Gonzál ez and Harald Servat and Xavier Teruel and Estanislao Me rcadal and Carlos Álvare z and Judit Giménez and Xavier Martor ell and Eduard Aygua dé and Jesús Labarta},
url = {https://link.springer.com/chapter/10.1007/978-3-319-45550-1_16},
doi = {10.1007/97 8-3-319-45 550-1_16},
year = {2016},
date = {2016-09-21},
volume = {OpenMP: Memory, Devices and Tasks},
publisher = {Springer International Publishing},
abstract = {Heterogeneous systems are an important trend in the future of supercomputers, yet they can be hard to program and developers still lack powerful tools to gain understanding about how well their accelerated codes perform and how to improve them.

Having different types of hardware accelerators available, each with their own specific low-level APIs to program them, there is not yet a clear consensus on a standard way to retrieve information about the accelerator’s performance. To improve this scenario, OMPT is a novel performance monitoring interface that is being considered for integration into the OpenMP standard. OMPT allows analysis tools to monitor the execution of parallel OpenMP applications by providing detailed information about the activity of the runtime through a standard API. For accelerated devices, OMPT also facilitates the exchange of performance information between the runtime and the analysis tool. We implement part of the OMPT specification that refers to the use of accelerators both in the Nanos++ parallel runtime system and the Extrae tracing framework, obtaining detailed performance information about the execution of the tasks issued to the accelerated devices to later conduct insightful analysis.

Our work extends previous efforts in the field to expose detailed information from the OpenMP and OmpSs runtimes, regarding the activity and performance of task-based parallel applications. In this paper, we focus on the evaluation of FPGA devices studying the performance of two common kernels in scientific algorithms: matrix multiplication and Cholesky decomposition. Furthermore, this development is seamlessly applicable for the analysis of GPGPU accelerators and Intel® Xeon PhiTM co-processors operating under the OmpSs programming model.},
keywords = {},
pubstate = {published},
tppubtype = {proceedings}
}

@proceedings{Scordino2016,
title = {Sharing memory in modern distributed applications},
author = {Claudio Scordino and Bruno Morelli},
doi = {DOI:10.1145/2851613.2851950},
isbn = {978-1-4503-3739-7},
year = {2016},
date = {2016-04-04},
booktitle = {31st Annual ACM Symposium on Applied Computing},
pages = {1918-1921 },
abstract = {Traditionally, research on software distributed shared memory has been focused on optimizing the memory consistency models and the coherence protocols rather than the underlying run-time mechanisms. Thus, these systems have been often implemented on top of the paging functionalities offered by the operating system. This approach, however, introduces performance issues due to false sharing of data.

We propose an object-based approach that leverages the features of modern object-oriented programming to intercept single operations on data, hiding the underlying run-time mechanism. A possible implementation using the standard C++ programming language is shown and discussed.},
keywords = {},
pubstate = {published},
tppubtype = {proceedings}
}