Adaptive parallelism under Equus

Author

Kindberg, T. ; Sahiner, A.V. ; Paker, Y.

Author_Institution

Dept. of Comput. Sci., Queen Mary & Westfield Coll., London, UK

fYear

1994

fDate

21-23 Mar 1994

Firstpage

172

Lastpage

182

Abstract

The authors describe adaptively parallel computations under Equus (T. Kindberg, 1990; A. V. Sahiner, 1991). These computations execute on a processor pool, and expand and contract as the number of processor nodes allocated to them varies over their run-time. They are based upon a hierarchical master-worker structure. The number of worker processes changes with the number of allocated nodes, and so does the number of processes that act as servers to them (such as the masters). The authors use an image-processing example to describe how workers and servers are added and withdrawn at run-time. The affected processes are synchronised, communication linkages are changed, and in some cases, state is transferred between them. Reconfigurations are transparent to worker (and other client) processes, but not all can be made transparent to servers

Keywords

adaptive systems; image processing; parallel algorithms; parallel programming; reconfigurable architectures; resource allocation; Equus; adaptive parallelism; adaptively parallel computations; allocated nodes; client processes; communication linkages; hierarchical master-worker structure; image-processing example; processor nodes; processor pool; reconfigurable distributed computations; worker processes; Computer networks; Computer science; Contracts; Couplings; Distributed computing; Educational institutions; Parallel processing; Programming profession; Runtime; Workstations;

fLanguage

English

Publisher

ieee

Conference_Titel

Configurable Distributed Systems, 1994., Proceedings of 2nd International Workshop on

Conference_Location

Pittsburgh, PA

Print_ISBN

0-8186-5390-6

Type

conf

DOI

10.1109/IWCDS.1994.289925

Filename

289925