Thierry Garcia

  • Citations Per Year
Learn More
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//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 is very(More)
This paper presents a work-optimal CGM algorithm that solves the Longest Increasing Subsequence Problem. It can be implemented in the CGM with <i>P</i> processors in O(<i>N</i>2 &#247;<i>P</i>) time and O(<i>P</i>) communication steps. It is the first CGM algorithm for this problem and it is work-optimal since the sequential algorithm has a complexity of(More)
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( 2 P ) in time and O(P ) communication steps. It is the first CGM algorithm for this problem. We present also experimental results(More)
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 O(N2/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 is very(More)
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 out on(More)
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Longest Increasing Subsequence, Longest Common Subsequence, Longest Repeated Suffix Ending at each point in a word and Detection of Repetitions. We present also experimental results(More)
0965-9978/$ see front matter 2012 Civil-Comp Lt http://dx.doi.org/10.1016/j.advengsoft.2012.11.010 ⇑ Corresponding author. Tel.: +33 534322166; fax: E-mail addresses: mchau@advancedsolutionsaccele garcia@enseeiht.fr, thierry.garcia@uvsq.fr (T. Garci (P. Spiteri). This paper deals with the implementation on the Grid’5000 network, the French grid platform, of(More)