By Topic

Efficient shared memory for testing parallel algorithms on distributed systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Atkins, M.S. ; Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada

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

Published in:

Workstation Operating Systems, 1989., Proceedings of the Second Workshop on

Date of Conference:

27-29 Sep 1989