Thierry Garcia

Thierry Garcia
Institut National Polytechnique de Toulouse | INPT · ENSEEIHT-IRIT

Associate Professor - PhD

About

27
Publications
1,925
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
92
Citations
Additional affiliations
February 2008 - November 2009
Ecole Nationale de l'Aviation Civile
Position
  • Porject ANR Istar
September 2006 - present
Université de Versailles Saint-Quentin
Position
  • Research activities
Education
September 2000 - November 2003
Université de Picardie Jules Verne
Field of study
  • Computer Science

Publications

Publications (27)
Article
Full-text available
The paper improves a preliminary experimental study on a cluster by adding both theoretical results and experimental tests on a grid platform. These algorithms solve univalued and multivalued pseudo-linear problems using parallel asynchronous multisplitting methods combined with Krylov’s methods. This paper also analyses these algorithms using cont...
Article
Full-text available
The present study deals with pseudo - linear problems solving using parallel asynchronous multisplitting methods combined with Krylov methods. With appropriate and realistic assumptions, the behavior of such parallel iterative algorithms will be analyzed by partial ordering techniques in relation with the discrete maximum principle. Applications to...
Article
This paper deals with the solution of fluid-structure interaction problems using an algorithm consisting in the coupling between two solvers, each one related to the fluid and the structure respectively. Due to the difficult decomposition of the domain into sub-domains, we consider for each environment a parallel multi-splitting algorithm which cor...
Article
This paper presents the behavior of general parallel synchronous and asynchronous multisplitting and two-stage methods for the numerical simulation of steel solidification in continuous casting. Thanks to the mathematical analysis and the implementation of these methods one can show the results of parallel experiments for the target application. Th...
Article
Full-text available
The present study deals with the solution of a problem, defined in a three-dimensional domain, arising in fluid mechanics. Such problem is modelled with unilateral constraints on the boundary. Then, the problem to solve consists in minimizing a functional in a closed convex set. The characterization of the solution leads to solve a time-dependent v...
Article
This paper deals with the parallel solution of the stationary obstacle problem with convection–diffusion operator. The obstacle problem can be formulated by various ways and in the present study it is formulated like a multivalued problem. Another formulation by complementary problem is also considered. Appropriate discretization schemes are consid...
Data
Full-text available
Article
This paper deals with the implementation on the Grid’5000 network, the French grid platform, of parallel simulations for the solution of a 3D coupled boundary value problem. This problem models continuous flow electrophoresis which is governed by Navier Stokes equations coupled with convection–diffusion and potential equations. The coupled boundary...
Conference Paper
The present study deals with the solution of problem arising in fluid mechanics with unilateral constraints on the boundary. The problem is defined in the three-dimensional domain. An implicit scheme is used for the time dependent part of the operator and the problem is then reduced to the solution of a sequence of stationary problems. The discreti...
Conference Paper
Full-text available
In the present study we consider the parallel simulation on a peer-topeer demonstrator for the computation of a 3D differential equations, which model the behavior of the continuous-flow electrophoresis problem. The physical model considered is constituted by the Navier-Stokes equation coupled with a convection-diffusion equation and a Laplacian eq...
Conference Paper
Full-text available
This paper deals with the numerical solution of financial applications, more specifically the computation of American and European options derivatives modeled by boundary value problems. In such applications we have to solve large-scale algebraic linear systems. We concentrate on synchronous and asynchronous parallel iterative algorithms carried ou...
Conference Paper
Full-text available
This paper deals with the numerical solution of financial applications, more specifically the computation of American and European options derivatives modelled by boundary values problems. In such applications we have to solve large-scale algebraic linear systems. We concentrate on synchronous and asynchronous parallel iterative algorithms carried...
Conference Paper
This paper deals with the implementation on the GRID'5000 network, the French grid platform, of parallel simulations for the solution of a 3D coupled boundary value problem of continuous flow electrophoresis which is governed by Navier Stokes equations coupled with convection-diffusion and potential equations. The coupled boundary value problems ar...
Conference Paper
This paper deals with the parallel solution of the stationary obstacle problem with convection-diffusion operator, occuring in constrained mechanical structures. The obstacle problem can be formulated by various ways and in the present study is formulated like a multivalued problem. Appropriate discretisation schemes are considered for the numerica...
Conference Paper
Full-text available
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic program- ming problems such as: Longest Increasing Subsequence, Longest Common Subsequence, Longest Repeated Suffix Ending at each point in a word and Detection of Repeti- tions. We present also experime...
Article
The paper presents a Coarse-Grained Multicomputer algorithm that solves the problem of detection of repetitions. This algorithm can be implemented in the CGM model with P processors in in time and O(P) communication steps. It is the first CGM algorithm for this problem. We present also experimental results showing that the CGM algorithm is very eff...
Article
Full-text available
We have all the intuition that a work can be completed in much less time if it is distributed between several people or on several machines. This concept names the parallelism which can be defined as the state of what develops in the same direction or at the same time. It is naturally that this concept of parallelism was applied to computers. So it...
Conference Paper
Full-text available
The paper presents a Coarse-Grained Multicomputer algorithm that solves the problem of finding the longest repeated suffix ending at each point in a word. This algorithm can be implemented in the CGM with P processors in \( O\left( {\frac{{N^2 }} {P}} \right) \) in time and O(P) communication steps. It is the first CGM algorithm for this problem. W...
Conference Paper
Full-text available
The paper presents a coarse-grained multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with P processors in O(N<sup>2</sup>/P) in time and O(P) communication steps. It is the first CGM algorithm for this problem. We present also experimental results showing that the CGM algorithm...
Article
DREAM is a super small distributed hard real-time micro-kernel based on LINDA concept. The key features of DREAM are: pseudo process and tuple migration, DSP hardware tuning and ease fault-tolerant applications implementation by using different approaches such as PB, DMR, TMR. In this paper, we present the basic concepts of DREAM that allow pseudo...
Article
The paper presents a Coarse-Grained Multicomputer algo- rithm that solves the problem of nding the longest repeated sux end- ing at each point in a word. This algorithm can be implemented in the CGM with P processors in O( N 2 P ) in time and O(P ) communication steps. It is the rst CGM algorithm for this problem. We present also experimental resul...

Network

Cited By