On the Complexity of Scheduling MIMD Operations for SIMD Interpretation

Programming SIMD hardware to interpret (in parallel) programs and data resident in each PE is a technique for obtaining a cost-effective massively parallel MIMD processing environment. The performance of the synthesized MIMD environment can be greatly improved by with a variable instruction interpre...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of parallel and distributed computing Jg. 29; H. 1; S. 91 - 95
Hauptverfasser: Fan, X.Z., Abughazaleh, N.B., Wilsey, P.A.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: San Diego, CA Elsevier Inc 15.08.1995
Elsevier
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Electronics
Exact sciences and technology
Hardware
Software
Software engineering
Theoretical computing
Interpreter
Programming environment
SIMD computer
Programming
Scheduling
Interpretation
Optimization
Complexity
Parallel program
Parallel processing
NP complete problem
Hardware
MIMD computer
ISSN:0743-7315, 1096-0848
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Programming SIMD hardware to interpret (in parallel) programs and data resident in each PE is a technique for obtaining a cost-effective massively parallel MIMD processing environment. The performance of the synthesized MIMD environment can be greatly improved by with a variable instruction interpreter that delays the interpretation of infrequent operations. In this paper, the process of building a variable instruction interpreter that optimizes an objective function is examined. Two different objective functions are considered, namely, maximizing the total instruction throughput (called Maximal MIMD Instruction Throughput, MMIT) and maximizing overall PE utilization (called Maximal MIMD PE Utilization, MMPU). We show that the decision version of both the MMIT and MMPU problems is NP-complete.
ISSN:0743-7315
1096-0848
DOI:10.1006/jpdc.1995.1109