Jose Daniel Garcia

Jose Daniel Garcia

Auto-generated profile, based on publicly available information

Jose Daniel Garcia

Universidad Carlos III de Madrid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
1 December 2003 in Reliability Engineering & System Safety
Verified
Journal Article
Closed access
Jesus CarreteroJesus Carretero
Jesus Carretero
JPJosé M. Pérez
José M. Pérez
FGFélix Garcı́a-Carballeira
Félix Garcı́a-Carballeira
ACAlejandro Calderón
Alejandro Calderón
JFJavier Fernández
Javier Fernández
PPPierre Prete
Pierre Prete

29 May 2017 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Open access
PDF file
DADavid del Rio Astorga
David del Rio Astorga
MDManuel F. Dolz
Manuel F. Dolz
JFJavier Fernández
Javier Fernández
GAGarcía
García
JDJ. Daniel
J. Daniel
Summary: Current parallel programming frameworks aid developers to a great extent in implementing applications that exploit parallel hardware resources. Nevertheless, developers require additional expertise to properly use and tune them to operate efficiently on specific parallel platforms. On the other hand, porting applications between different parallel programming models and platforms is not straightforward and demands considerable efforts and specific knowledge. Apart from that, the lack of high‐level parallel pattern abstractions, in those frameworks, further increases the complexity in developing parallel applications. To pave the way in this direction, this paper proposesGRPPI, a generic and reusable parallel pattern interface for both stream processing and data‐intensive C++ applications.GRPPIaccommodates a layer between developers and existing parallel programming frameworks targeting multi‐core processors, such as C++ threads, OpenMP and Intel TBB, and accelerators, as CUDA Thrust. Furthermore, thanks to its high‐level C++ application programming interface and pattern composability features,GRPPIallows users to easily expose parallelism via standalone patterns or patterns compositions matching in sequential applications. We evaluate this interface using an image processing use case and demonstrate its benefits from the usability, flexibility, and performance points of view. Furthermore, we analyze the impact of using stream and data pattern compositions on CPUs, GPUs and heterogeneous configurations.

9 May 2013 in Personal and Ubiquitous Computing
Verified
Journal Article
Closed access
PDF file
Jesus CarreteroJesus Carretero
Jesus Carretero
JGJ. Daniel García
J. Daniel García

17 March 2009 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
ANAlberto Núñez
Alberto Núñez
JFJavier Fernández
Javier Fernández
JGJose D. Garcia
Jose D. Garcia
FGFélix Garcia
Félix Garcia
Jesus CarreteroJesus Carretero
Jesus Carretero

1 January 2007 in Future Generation Computer Systems
Verified
Journal Article
Closed access
FGFélix García-Carballeira
Félix García-Carballeira
Jesus CarreteroJesus Carretero
Jesus Carretero
ACAlejandro Calderón
Alejandro Calderón
JGJ. Daniel García
J. Daniel García
LSLuis. M. Sanchez
Luis. M. Sanchez

1 February 2016
Verified
Conference Paper
Closed access
VJV. Janjic
V. Janjic
CBC. Brown
C. Brown
KMK. Mackenzie
K. Mackenzie
KHK. Hammond
K. Hammond
MDM. Danelutto
M. Danelutto
JGJ. Daniel Garcia
J. Daniel Garcia
Parallelising sequential applications is usually a very hard job, due to many different ways in which an application can be parallelised and a large number of programming models (each with its own advantages and disadvantages) that can be used. In this paper, we describe a method to semi-automatically generate and evaluate different parallelisations of the same application, allowing programmers to find the best parallelisation without significant manual reengineering of the code. We describe a novel, high-level domain-specific language, Refactoring Pattern Language (RPL), that is used to represent the parallel structure of an application and to capture its extra-functional properties (such as service time). We then describe a set of RPL rewrite rules that can be used to generate alternative, but semantically equivalent, parallel structures (parallelisations) of the same application. We also describe the RPL Shell that can be used to evaluate these parallelisations, in terms of the desired extra-functional properties. Finally, we describe a set of C++ refactorings, targeting OpenMP, Intel TBB and FastFlow parallel programming models, that semi-automatically apply the desired parallelisation to the application's source code, therefore giving a parallel version of the code. We demonstrate how the RPL and the refactoring rules can be used to derive efficient parallelisations of two realistic C++ use cases (Image Convolution and Ant Colony Optimisation).