| Autor: |
Goos, G., Hartmanis, J., Brauer, W., Hansen, P. Brinch, Gries, D., Moler, C., Seegmüller, G., Stoer, J., Wirth, N., Händler, Wolfgang, Julliand, J., Perrin, G. R. |
| Zdroj: |
Conpar 81; 1981, p464-479, 16p |
| Abstrakt: |
We are interested with design and development of concurrent programs: these programs are constituted by a set of sequential processes which communicate information during their computation generally in an asynchronous way. Thus we obtain a maximal independence between these processes. Such a philosophy is applicable to numerical or non-numerical algorithms. We present in section 1 a method for analysing problems and designing a set of cooperating processes by three steps:-design of a statement constituted by a set of madules-definition of a data-dependency graph-specification of communications between modules. Section 2 proposes a numerical example to illustrate previous concepts. In section 3 we show how to express such algorithms by a concurrent program. In particular we define:-process structures-communication types which realize specified exchanges of data between processes. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
