A load balancing technique for some coarse-grained multicomputer algorithms

21st International Conference on Computers and Their Applications, CATA 2006

Volumn , Issue , 2006, Pages 301-306

  Garcia, Thierry ^a   Semé, David ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COARSE-GRAINED; DYNAMIC PROGRAMMING PROBLEMS; LOAD BALANCING METHODS; LOAD BALANCING TECHNIQUE; LONGEST COMMON SUBSEQUENCES; LONGEST INCREASING SUBSEQUENCES; MULTICOMPUTERS;

ALGORITHMS; DATA TRANSFER;

COMPUTER APPLICATIONS;

EID: 33745958744     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, and T. Von Eicken. Log"p":towards a realistic model of parallel computation. 4-th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming, pages 1- 12, 1996.
2. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry, 6(3):379-400, 1996.
3. T. Garcia, J.F. Myoupo, and D. Semé. A work-optimal cgm algorithm for the longest increasing subsequence problem. International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'01), 2001.
4. T. Garcia, J.F. Myoupo, and D. Semé. A coarsegrained multicomputer algorithm for the longest common subsequence problem. 11-th Euromicro Conference on Parallel Distributed and Network based Processing (PDP'03), 2003.
5. T. Garcia and D. Semé. A coarse-grained multicomputer algorithm for the longest repeated suffix ending at each point in a word. In International Conference of Computational Science and Its Applications (ICCSA'03), volume 2, pages 239-248, 2003.
6. T. Garcia and D. Semé. A coarse-grained multicomputer algorithm for the detection of repetitions problem. Information Processing Letters, (93):307-313, 2005.
7. M. Goudreau, S. Rao K. Lang, T. Suel, and T. Tsantilas. Towards efficiency and portability: Programming with the bsp model. 8th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA'96), pages 1-12, 1996.
8. L.G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.