A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms

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 showing that our method is efficient.

• Type: Conference
• Year: 2006
• Where: CATA
• Authors: Thierry Garcia, David Semé
• Keywords: CATA 2006, CATA 2007, Load Balancing Method, Longest Increasing Subsequence, Longest Repeated Suffix