Efficient shared memory for testing parallel algorithms ondistributed systems
Atkins, M.S.
Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC;
This paper appears in: Workstation Operating Systems, 1989., Proceedings of the Second Workshop on
Publication Date: 27-29 Sep 1989
On page(s): 13-15
Meeting Date: 09/27/1989 - 09/29/1989
Location: Pacific Grove, CA, USA
References Cited: 6
INSPEC Accession Number: 3614101
Digital Object Identifier: 10.1109/WWOS.1989.109260
Current Version Published: 2002-08-06
Abstract
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
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
