|
ABSTRACT
In this paper, we discuss one of our experiments using the coordination language MANIFOLD to restructure an existing sequential numerical application into a concurrent application. The application was written in ANSI C and deals with a sparse-grid method for a transport problem. Our approach is simple and is in fact acut-and-paste method. First, we try to identify and isolate components in the legacy source code (the cut). Second, we glue them together by writing coordinator modules (glue modules) with the help of a coordination language (the paste). We also give some performance results.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
[2] F. Arbab. Manifold version 2: Language reference manual. Technical report, Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, 1996. Available on-line http://www.cwi.nl/ftp/manifold/refman.ps.Z.
|
| |
3
|
|
| |
4
|
|
| |
5
|
[5] C. Everaars, F. Arbab, and B. Koren. Dynamic process composition and communication patterns in irregularly structured applications. Concurrency: Practice and Experience, 12:157-174, spring 2000. Extended version.
|
| |
6
|
[6] C. Everaars, F. Arbab, and B. Koren. Parallel, distributed-memory implementation of a sparse-grid methods for time-dependent advection-diffusion problems. Technical Report SEN-R0306, Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, August 2003.
|
| |
7
|
|
| |
8
|
[8] A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM 3 user's guide and reference manual. Technical Report ORNL/TM-12187, Oak Ridge National Laboratory, September 1994.
|
 |
9
|
|
 |
10
|
|
| |
11
|
|
|