Dynamic node reconfiguration in a parallel-distributed environment

Published

Conference Paper

© 1991 Association for Computing Machinery. All Rights Reserved. Idle workstations in a network represent a significant computing potential. In particular, their processing power can be used by parallel-distributed programs that treat the network as a loosely-coupled multiprocessor. But the set of machines free to participate in load sharing changes over time as users come and go from their workstations. To make full use of the available resources, parallel-distributed applications in the network must reconfigure to adapt to these changes as they run. This paper describes a node reconfiguration facility for Amber, an object-based parallel programming system for networks of multiprocessors. We describe system support that allows a parallel Amber application to adapt to changing network conditions by expanding to make use of new nodes as they become idle, and by contracting as nodes become busy. A key characteristic of Amber's node reconfiguration is that it is handled at the user level in the Amber runtime system it does not depend on a kernel-level process migration facility. Our experiments with Amber show that node reconfiguration can be implemented easily and efficiently in a runtime library.

Duke Authors

Cited Authors

  • Feeley, MJ; Bershad, BN; Chase, JS; Levy, HM

Published Date

  • April 1, 1991

Published In

  • Proceedings of the Acm Sigplan Symposium on Principles and Practice of Parallel Programming, Ppopp

Start / End Page

  • 114 - 121

International Standard Book Number 10 (ISBN-10)

  • 0897913906

Citation Source

  • Scopus