Coordination of distributed/parallel multiple-grid domain decomposition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1117, Issue , 1996, Pages 131-144

  Everaars, C T H ^a   Arbab, F ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS;

ADAPTIVE PARTITIONING; CLASSICAL OPTIMIZATION; COORDINATION LANGUAGE; DOMAIN DECOMPOSITIONS; EXECUTABLE CODES; IRREGULAR GRIDS; PARALLEL ENVIRONMENT; SUB-PROBLEMS;

DOMAIN DECOMPOSITION METHODS;

EID: 84947935764     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030103     Document Type: Conference Paper

References (5)

1. F. Arbab. Coordination of massively concurrent activities. Technical Report CS-R9565, Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, november 1995. Available on-line: http://www.cwi.n1/ftp/CWIreports/IS/CS-R9565.ps.Z.
2. F. Arbab The IWIM model for coordination of concurrent activities. In P. Ciancarini and C. Hankin (eds.), Coordination '96, Lecture Notes in Computer Science #1061, Springer-Verlag, April 1996.
3. F. Arbab, C.L. Blom, F.J. Burger, and C.T.H. Everaars. Reusable coordinator modules for massively concurrent applications. In Euro-Par '96, Lecture Notes in Computer Science, Springer-Verlag, August 1996.
4. P. Bouvry and F. Arbab. Visifold: A visual environment for a coordination language. In Coordination '96, Lecture Notes in Computer Science, Springer-Verlag, April 1996.
5. D. Gelernter and N. Carriero. Coordination languages and their significance. Communication of the ACM, 35(2):97-107, February 1992.