| Abstract |
|---|
| In this article we concentrate on semantics of operations on synchronizing shared memory that provide useful primitives for shared memory access and update. The operations are a part of a new shared-memory programming model called mEDA. The main goal of this research is to provide a flexible, effective and relatively simple model of inter-process communication and synchronization via synchronizing shared memory. |
| Contact |
| Vladimir Vlassov Department of Teleinformatics,Royal Institute of Technology,Electrum 204,S-164 40 KISTA,Sweden vlad@it.kth.se |