During recent years there have been many efforts aimed towards the elimination of the gap between shared memory and message passing parallel computers. Many researchers have addressed the problem by implementing distributed shared memory (DSM) systems. In this paper, we present a new approach to DSM, focusing on shared variables. An approach like this can operate complementary to message passing environments, taking over the complicated task of process synchronisation, or it can act as an integrated, autonomous system of interprocess communication, if the use of the offered shared memory is not heavy. We investigate the viability and efficiency of such a system in a massively parallel environment where non-contention is difficult. SVS (Shared Variable System) is an implementation of this idea, in the form of a runtime library on a massively parallel Parsytec GCel 3/512. We present the philosophy, inner-structure and the user interface of SVS, along with the first experience with its use.<<ETX>>
[1]
Anoop Gupta,et al.
The directory-based cache coherence protocol for the DASH multiprocessor
,
1990,
ISCA '90.
[2]
Paul Hudak,et al.
Memory coherence in shared virtual memory systems
,
1986,
PODC '86.
[3]
George K. Papakonstantinou,et al.
Distributed shared-memory implementation for multitransputer systems
,
1992,
Inf. Softw. Technol..
[4]
Henri E. Bal,et al.
Distributed programming with shared data
,
1988,
Proceedings. 1988 International Conference on Computer Languages.
[5]
Leslie Lamport,et al.
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
,
2016,
IEEE Transactions on Computers.