CEDEX MIMD language(ID:8272/)
Unnamed language in Adelantado 1985 for MIMD work
Firstly, we briefly present our language characteristic and capabilities: in our approach, a program can be viewed as a collection of computational tasks, together with a sequencing task, which expresses dependences among them and thus shows concurrency and synchronization.
In order to illustrate the programming methodology in our MIMD environment, we consider a program, called PASFR, taken from actual applications in numerical areas (finite difference method). In this paper, our concern is to examine several possible descriptions of the same program, in terms of algorithmic tasks, and the corresponding expression of the flow of control between them. In other words, we present different decomposition schemes of this application into concurrent tasks, which essentially depend on the size of the elementary tasks.
We then compare the behaviour of each version, in terms of effective performance, running each one on our architecture simulator.
Finally, we propose some optimization strategies for speed enhancement, based on data-transfer improvement.
External link: Online copy