Dynamic task migration from SIMD to SPMD virtual machines

Author

Armstrong, James B. ; Siegel, Howard Jay

Author_Institution

Sarnoff Real Time Corp., Princeton, NJ, USA

fYear

1995

fDate

6-10 Nov 1995

Firstpage

326

Lastpage

333

Abstract

A method to migrate a task dynamically from a virtual SIMD machine to a virtual SPMD machine is proposed. It is assumed that the SIMD and SPMD virtual machine models only differ to support the different modes of parallelism, and that the program was coded in a mode-independent programming language. The difficulty of performing an SIMD to SPMD migration arises from the fact that some SIMD PEs may be disabled at the point in the program at which the migration occurs. Furthermore, each of the disabled PEs may need to be re-enabled at different points in the SPMD program. The compiler information that should be furnished to the task migration procedure is given. The time and memory space complexities of the task migration procedure are also presented. The work solves part of the general problem of task migration in SIMD/SPMD mixed-machine heterogeneous systems

Keywords

computational complexity; parallel machines; parallel programming; program compilers; virtual machines; SIMD/SPMD mixed-machine heterogeneous systems; compiler information; dynamic task migration; memory space complexity; mode-independent programming language; parallelism; program coding; time complexity; virtual SIMD machine; virtual SPMD machine; Computer languages; Contracts; Fault tolerance; Laboratories; Load management; NASA; Parallel machines; Parallel processing; Shape; Virtual machining;

fLanguage

English

Publisher

ieee

Conference_Titel

Engineering of Complex Computer Systems, 1995. Held jointly with 5th CSESAW, 3rd IEEE RTAW and 20th IFAC/IFIP WRTP, Proceedings., First IEEE International Conference on

Conference_Location

Ft. Lauderdale, FL

Print_ISBN

0-8186-7123-8

Type

conf

DOI

10.1109/ICECCS.1995.479353

Filename

479353