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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of parallel and distributed computing Vol. 29; no. 1; pp. 91 - 95
Main Authors: Fan, X.Z., Abughazaleh, N.B., Wilsey, P.A.
Format: Journal Article
Language:English
Published: San Diego, CA Elsevier Inc 15.08.1995
Elsevier
Subjects:
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 Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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.
AbstractList 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.
Author Wilsey, P.A.
Abughazaleh, N.B.
Fan, X.Z.
Author_xml – sequence: 1
  givenname: X.Z.
  surname: Fan
  fullname: Fan, X.Z.
– sequence: 2
  givenname: N.B.
  surname: Abughazaleh
  fullname: Abughazaleh, N.B.
– sequence: 3
  givenname: P.A.
  surname: Wilsey
  fullname: Wilsey, P.A.
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3679372$$DView record in Pascal Francis
BookMark eNp1kDFPwzAQhS1UJNrCyuyBNcGOncQZUYFSqVWHwmw5zpm6SpPINoj-exKCGJC63El377vTezM0adoGELqlJKaEZPeHrtIxLYo0ppQUF2ja1ywigosJmpKcsyhnNL1CM-8PhFCa5mKKltsGhz3gRXvsaviy4YRbg3d6D9VHbZt3vFltHvG2A6eCbRuPTevwbpitmgCucxB-Ftfo0qjaw81vn6O356fXxUu03i5Xi4d1pPvfITJQJIqA4CrLoDSiUIlKk7zKUwNQ8EoJVYiEZjnTmkNW8qQsGTBtlOaUA7A5uhvvdsprVRunGm297Jw9KneSLMsLlie9LB5l2rXeOzB_CkrkkJYc0pJDWnJIqwf4P0Db0VlwytbnMTFi0Hv-tOCk1xYaDZV1oIOsWnsO_QaWMISJ
CitedBy_id crossref_primary_10_1006_jpdc_1998_1468
crossref_primary_10_1109_71_588621
ContentType Journal Article
Copyright 1995 Academic Press
1995 INIST-CNRS
Copyright_xml – notice: 1995 Academic Press
– notice: 1995 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1006/jpdc.1995.1109
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1096-0848
EndPage 95
ExternalDocumentID 3679372
10_1006_jpdc_1995_1109
S0743731585711094
GroupedDBID --K
--M
-~X
.~1
0R~
1B1
1~.
1~5
29L
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABFNM
ABFSI
ABJNI
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADFGL
ADHUB
ADJOM
ADMUD
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CAG
COF
CS3
DM4
DU5
E.L
EBS
EFBJH
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
H~9
IHE
J1W
JJJVA
K-O
KOM
LG5
LG9
LY7
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SET
SEW
SPC
SPCBC
SST
SSV
SSZ
T5K
TN5
TWZ
WUQ
XJT
XOL
XPP
ZMT
ZU3
ZY4
~G-
~G0
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
ID FETCH-LOGICAL-c315t-fe92a0e84a66ebf89a2a527d75fee94da8a9821673cc4e6b42bb3e3cfac414ee3
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1006_jpdc_1995_1109&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0743-7315
IngestDate Mon Jul 21 09:17:03 EDT 2025
Tue Nov 18 22:02:22 EST 2025
Sat Nov 29 03:03:27 EST 2025
Fri Feb 23 02:27:54 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Interpreter
Programming environment
SIMD computer
Programming
Scheduling
Interpretation
Optimization
Complexity
Parallel program
Parallel processing
NP complete problem
Hardware
MIMD computer
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c315t-fe92a0e84a66ebf89a2a527d75fee94da8a9821673cc4e6b42bb3e3cfac414ee3
PageCount 5
ParticipantIDs pascalfrancis_primary_3679372
crossref_primary_10_1006_jpdc_1995_1109
crossref_citationtrail_10_1006_jpdc_1995_1109
elsevier_sciencedirect_doi_10_1006_jpdc_1995_1109
PublicationCentury 1900
PublicationDate 1995-08-15
PublicationDateYYYYMMDD 1995-08-15
PublicationDate_xml – month: 08
  year: 1995
  text: 1995-08-15
  day: 15
PublicationDecade 1990
PublicationPlace San Diego, CA
PublicationPlace_xml – name: San Diego, CA
PublicationTitle Journal of parallel and distributed computing
PublicationYear 1995
Publisher Elsevier Inc
Elsevier
Publisher_xml – name: Elsevier Inc
– name: Elsevier
SSID ssj0011578
Score 1.4492576
Snippet Programming SIMD hardware to interpret (in parallel) programs and data resident in each PE is a technique for obtaining a cost-effective massively parallel...
SourceID pascalfrancis
crossref
elsevier
SourceType Index Database
Enrichment Source
Publisher
StartPage 91
SubjectTerms Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Electronics
Exact sciences and technology
Hardware
Software
Software engineering
Theoretical computing
Title On the Complexity of Scheduling MIMD Operations for SIMD Interpretation
URI https://dx.doi.org/10.1006/jpdc.1995.1109
Volume 29
WOSCitedRecordID wos10_1006_jpdc_1995_1109&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1096-0848
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0011578
  issn: 0743-7315
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZgywEJ8UYUKPIBiQPKsuvYiXNcoECR2q3UIq24RI4zbpFWabQPVPHrmYmdpAusVA5cosiJ85rPMxN75hvGXpFXgYbaRgJsEuH_hoiKOFaR0wAyc5SrOWqKTaRHR3o2y45DWNGyKSeQVpW-vMzq_ypqbENhU-rsP4i7uyg24D4KHbcodtxeS_BTH7hIA53ILn3ExQnKplw3qeeHB4cf3kxrWIQgOIozPKG2zfjDLV4rUYXP5-AJBkpi3aWCWdDkxtXrVWsIG3rHRqHNht-G_RrT-uzc_ESbdO6zvN51h4g20s-eHw8nw34uwud268hnYwaVRYSnaRyagn4NMxpXceSVpS_TFcyuL7X5h0JHpUAKvS4t5VWqhiC1N13tcv1vFq2LM_SczElO_XPqn1P_m2xHpCrTA7YzOdiffelWncbKW-72LVqSz1HydvMJtjkxd2qzxKHlfE2UK47K6X12N8iKTzwyHrAbUD1k99rqHTwo80fs07TiCBTeA4VfON4DhRNQeA8UjkDhBBS-CZTH7OvH_dP3n6NQViOy-E6ryEEmzAi0NEkChdOZEUaJtEyVA8hkabTJtBgnaWythKSQoihiiK0zVo4lQPyEDaqLCp4yDqXAIa1ciQdlOTKFRvVuhFTKxuSs77Ko_U65DZzzVPpknv9dMrvsdXd-7dlWtp45bj97HnxF7wPmiJytffY25NPdIk6IJVI8u_bdn7PbPfxfsMFqsYY9dsv-WH1fLl4GWP0CfjeS_A
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+Complexity+of+Scheduling+MIMD+Operations+for+SIMD+Interpretation&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Fan%2C+X.Z.&rft.au=Abughazaleh%2C+N.B.&rft.au=Wilsey%2C+P.A.&rft.date=1995-08-15&rft.issn=0743-7315&rft.volume=29&rft.issue=1&rft.spage=91&rft.epage=95&rft_id=info:doi/10.1006%2Fjpdc.1995.1109&rft.externalDBID=n%2Fa&rft.externalDocID=10_1006_jpdc_1995_1109
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon