Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints

Saved in:
Bibliographic Details
Published inAlgorithmica Vol. 32; no. 4; pp. 651 - 678
Main Authors SHACHNAI, H, TAMIR, T
Format Journal Article
LanguageEnglish
Published New York, NY Springer 01.04.2002
Subjects
Online AccessGet full text
ISSN0178-4617
1432-0541
DOI10.1007/s00453-001-0098-3

Cover

Author Tamir
Shachnai
Author_xml – sequence: 1
  givenname: H
  surname: SHACHNAI
  fullname: SHACHNAI, H
  organization: Department of Computer Science, The Technion, Haifa 32000, Israel
– sequence: 2
  givenname: T
  surname: TAMIR
  fullname: TAMIR, T
  organization: Department of Computer Science, The Technion, Haifa 32000, Israel
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=13462555$$DView record in Pascal Francis
BookMark eNp9kE1LAzEQhoNUsK3-AG978bg62WST7LEUv2CLgnpeptmsjaRJSVLEf--WCoIHD8Ncnvdl5pmRiQ_eEHJJ4ZoCyJsEwGtWAtBxGlWyEzKlnFUl1JxOyBSoVCUXVJ6RWUofI1fJRkxJu9q7bHcxaJNSiMWL3ph-76x_Lz5t3hQr1BvrTbFwLuSt8blA3xfPGNE542zaFsvgU45ofU7n5HRAl8zFz56Tt7vb1-VD2T7dPy4XbakZVLk0kvVqPKihUmqmqkEoBgLWuOYSGOsHPhhtOBOKGmSqH3BNoUGlOTZKCsHm5OrYu8Ok0Q0Rvbap20W7xfjVUcZFVdf1yNEjp2NIKZrhF4HuoK07autGHd1BW8fGjPyT0TZjtsEfnnT_JL8BSEpz1g
CitedBy_id crossref_primary_10_1016_j_tcs_2003_05_006
crossref_primary_10_1051_ita_2008027
crossref_primary_10_1287_moor_1110_0520
crossref_primary_10_4028_www_scientific_net_AMM_311_123
crossref_primary_10_1109_TPDS_2012_175
crossref_primary_10_1016_j_tcs_2008_01_001
crossref_primary_10_1145_1125994_1125999
ContentType Journal Article
Copyright 2002 INIST-CNRS
Copyright_xml – notice: 2002 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1007/s00453-001-0098-3
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1432-0541
EndPage 678
ExternalDocumentID 13462555
10_1007_s00453_001_0098_3
GroupedDBID -Y2
-~C
-~X
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
203
23M
28-
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
78A
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
AAYZH
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDPE
ABDZT
ABECU
ABFSG
ABFSI
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABLJU
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSTC
ACZOJ
ADHHG
ADHIR
ADHKG
ADIMF
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFEXP
AFGCZ
AFHIU
AFLOW
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHSBF
AHWEU
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
B-.
BA0
BBWZM
BDATZ
BGNMA
BSONS
CAG
CITATION
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
E.L
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
H~9
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
LAS
LLZTM
M4Y
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
P19
P9O
PF-
PT4
PT5
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TN5
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UQL
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WK8
YLTOR
Z45
ZMTXR
ZY4
~EX
IQODW
RIG
ID FETCH-LOGICAL-c302t-e73d80179177c382f683060bab47033df4fece43681ea38dfab109a8c4a987663
ISSN 0178-4617
IngestDate Mon Jul 21 09:16:01 EDT 2025
Thu Apr 24 23:02:13 EDT 2025
Wed Oct 01 03:10:07 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords Optimal algorithm
Program execution
Task scheduling
Scheduling
Makespan
Distributed computing
Workload
Polynomial time
Multiprocessor
Completeness
NP hard problem
Parallelism
Modem
Computer system
Single machine
Language English
License http://www.springer.com/tdm
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c302t-e73d80179177c382f683060bab47033df4fece43681ea38dfab109a8c4a987663
PageCount 28
ParticipantIDs pascalfrancis_primary_13462555
crossref_primary_10_1007_s00453_001_0098_3
crossref_citationtrail_10_1007_s00453_001_0098_3
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2002-04-01
PublicationDateYYYYMMDD 2002-04-01
PublicationDate_xml – month: 04
  year: 2002
  text: 2002-04-01
  day: 01
PublicationDecade 2000
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
PublicationTitle Algorithmica
PublicationYear 2002
Publisher Springer
Publisher_xml – name: Springer
SSID ssj0012796
Score 1.6743798
SourceID pascalfrancis
crossref
SourceType Index Database
Enrichment Source
StartPage 651
SubjectTerms Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Title Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints
Volume 32
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVLSH
  databaseName: SpringerLink Journals
  customDbUrl:
  mediaType: online
  eissn: 1432-0541
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012796
  issn: 0178-4617
  databaseCode: AFBBN
  dateStart: 19861101
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVAVX
  databaseName: SpringerLINK - Czech Republic Consortium
  customDbUrl:
  eissn: 1432-0541
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012796
  issn: 0178-4617
  databaseCode: AGYKE
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://link.springer.com
  providerName: Springer Nature
– providerCode: PRVAVX
  databaseName: SpringerLink Journals (ICM)
  customDbUrl:
  eissn: 1432-0541
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0012796
  issn: 0178-4617
  databaseCode: U2A
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://www.springerlink.com/journals/
  providerName: Springer Nature
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwELZguSChtrwEfSAfOIGCsrGdZI9LVYQqQEiAxG3lJyCF3VXYXvrrO7YTO4FSFS7RykpGSb7sjMee-T6E9iEIiFE2VImiTCaUEZ1A3AFAmDZmxAyMOLbPi_z0hv68ZbdRBNF1lyzEkfz9176S96AKY4Cr7ZJ9A7LBKAzAb8AXjoAwHP8LY9c9O_el_rPaMmpC4KjC8uq5K5TUh-OqmsVi8kteW_2UyqpjWLlOJxLh-ZwCHW11N6vBwmOnkOfqHqxN-UNM9R8f6t6aQdYpNWmWESF3pLnvmjzS3vVRAucxT0PV-sa49hgTf-fo8oYm1sfM3MvwvHDHvgLDErYykrjiLUtfSmLsaffbn4WkUCgYSJWdCVuAN7EmJmQZrWTgx9MBWhmfHB9fhJ2jrHCabOEJ253s1BPH9u6jNxdZm_Mn-FsYr2fSmWRcf0IfmuwAjz3U62hJTzfQx1Z5AzeOeBOd9ZHHEXlskccN8jggjwF53EEed5DfQjcnP66_nyaNLkYiSZotEl0QVVpPOiwKScrM5CUkfqnggoL_JspQo6W20gJDzUmpDBfDdMRLSfkIgl9OttFgOpvqHYRTQ4RJJS9ZpqgqpGBUaiUKSGwFE0ztorR9QxPZkMbbm6smryKziw7CJXPPmPKvk_d6rz1eQShk5ox9fou1L2g1fu1f0WBR_9LfYM64EHvNZ_IHWjNo6w
linkProvider Library Specific Holdings
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=Multiprocessor+Scheduling+with+Machine+Allotment+and+Parallelism+Constraints&rft.jtitle=Algorithmica&rft.au=Shachnai&rft.au=Tamir&rft.date=2002-04-01&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=32&rft.issue=4&rft.spage=651&rft.epage=678&rft_id=info:doi/10.1007%2Fs00453-001-0098-3&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00453_001_0098_3
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon