Efficient shared memory for testing parallel algorithms ondistributed systems
Atkins, M.S.
Workstation Operating Systems, 1989., Proceedings of the Second Workshop on
Volume , Issue , 27-29 Sep 1989 Page(s):13 - 15
Digital Object Identifier 10.1109/WWOS.1989.109260
Summary:A distributed data structure called a MOOSE (modifiable object
structure), which is both efficient enough and general enough to be used
by a wide variety of parallel algorithms, is outlined. The MOOSE
structure is aimed at a loosely coupled distributed system in which
several processors are connected over a local area network. It is
implemented in the high-level distributed programming language SR on
several Sun-2 and Sun-3 workstations running the Unix operating system
and connected by an Ethernet. The MOOSE shared memory has been designed
with customizable features for efficiency of implementation in such an
environment. This enables the communication and computation performance
of parallel algorithms on non-shared-memory hardware to be studied. If
the application is run in the background on several network nodes,
automatic load balancing is achieved and the programs may be tolerant of
node failure during the computation
View citation and abstract |
Cart
