Issue |
ESAIM: M2AN
Volume 36, Number 5, September/October 2002
Special issue on Programming
|
|
---|---|---|
Page(s) | 837 - 861 | |
DOI | https://doi.org/10.1051/m2an:2002039 | |
Published online | 15 October 2002 |
Distributed Objects for Parallel Numerical Applications
OASIS, Joint Project CNRS, INRIA, University of Nice Sophia Antipolis, 2004 route des Lucioles,
BP 93, 06902 Valbonne Cedex, France. Denis.Caromel@sophia.inria.fr.
Received:
11
December
2001
Revised:
23
May
2002
The C++// language (pronounced C++ parallel) was designed and implemented with the aim of importing reusability into parallel and concurrent programming, in the framework of a mimd model. From a reduced set of rather simple primitives, comprehensive and versatile libraries are defined. In the absence of any syntactical extension, the C++// user writes standard C++ code. The libraries are themselves extensible by the final users, making C++// an open system. Two specific techniques to improve performances of a distributed object language such as C++// are then presented: Shared-on-Read and Overlapping of Communication and Computation. The appliance of those techniques is guided by the programmer at a very high-level of abstraction, so the additional work to yield those good performance improvements is kept to the minimum.
Mathematics Subject Classification: 68N15 / 68N19
Key words: Concurrency / data-driven synchronization / dynamic binding / inheritance / object-oriented concurrent programming / polymorphism / reusability / software development method / wait-by-necessity / overlap / object sharing.
© EDP Sciences, SMAI, 2002
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.