Dynamic task migration from SIMD to SPMD virtual machines

I
ICECCS
1995
First IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'95)
Abstract - Dynamic task migration from SIMD to SPMD virtual machines

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by J.B. Armstrong Articles by H.J. Siegel

First IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'95)

Ft. Lauderdale, Florida

November 06-November 10

ISBN: 0-8186-7123-8

	ASCII Text	x
	J.B. Armstrong, H.J. Siegel, "Dynamic task migration from SIMD to SPMD virtual machines," Engineering of Complex Computer Systems, IEEE International Conference on, pp. 326, First IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'95), 1995.

	BibTex	x
	@article{ 10.1109/ICECCS.1995.479353, author = {J.B. Armstrong and H.J. Siegel}, title = {Dynamic task migration from SIMD to SPMD virtual machines}, journal ={Engineering of Complex Computer Systems, IEEE International Conference on}, volume = {0}, year = {1995}, isbn = {0-8186-7123-8}, pages = {326}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICECCS.1995.479353}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Engineering of Complex Computer Systems, IEEE International Conference on TI - Dynamic task migration from SIMD to SPMD virtual machines SN - 0-8186-7123-8 SP EP A1 - J.B. Armstrong, A1 - H.J. Siegel, PY - 1995 KW - virtual machines; computational complexity; parallel machines; parallel programming; program compilers; dynamic task migration; virtual SIMD machine; virtual SPMD machine; parallelism; mode-independent programming language; program coding; compiler information; time complexity; memory space complexity; SIMD/SPMD mixed-machine heterogeneous systems VL - 0 JA - Engineering of Complex Computer Systems, IEEE International Conference on ER -

J.B. Armstrong, Sarnoff Real Time Corp., Princeton, NJ, USA

H.J. Siegel, Sarnoff Real Time Corp., Princeton, NJ, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICECCS.1995.479353

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.

Index Terms:

virtual machines; computational complexity; parallel machines; parallel programming; program compilers; dynamic task migration; virtual SIMD machine; virtual SPMD machine; parallelism; mode-independent programming language; program coding; compiler information; time complexity; memory space complexity; SIMD/SPMD mixed-machine heterogeneous systems

Citation:

J.B. Armstrong, H.J. Siegel, "Dynamic task migration from SIMD to SPMD virtual machines," iceccs, pp.326, First IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'95), 1995

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.