Efficient task scheduling algorithms for heterogeneous multi-cloud environment

Cloud Computing has grown exponentially in the business and research community over the last few years. It is now an emerging field and becomes more popular due to recent advances in virtualization technology. In Cloud Computing, various applications are submitted to the datacenters to obtain some s...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:The Journal of supercomputing Ročník 71; číslo 4; s. 1505 - 1533
Hlavní autori: Panda, Sanjaya K., Jana, Prasanta K.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer US 01.04.2015
Predmet:
ISSN:0920-8542, 1573-0484
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Cloud Computing has grown exponentially in the business and research community over the last few years. It is now an emerging field and becomes more popular due to recent advances in virtualization technology. In Cloud Computing, various applications are submitted to the datacenters to obtain some services on pay-per-use basis. However, due to limited resources, some workloads are transferred to other data centers to handle peak client demands. Therefore, scheduling workloads in heterogeneous multi-cloud environment is a hot topic and very challenging due to heterogeneity of the cloud resources with varying capacities and functionalities. In this paper, we present three task scheduling algorithms, called MCC, MEMAX and CMMN for heterogeneous multi-cloud environment, which aim to minimize the makespan and maximize the average cloud utilization. The proposed MCC algorithm is a single-phase scheduling whereas rests are two-phase scheduling. We perform rigorous experiments on the proposed algorithms using various benchmark as well as synthetic datasets. Their performances are evaluated in terms of makespan and average cloud utilization and experimental results are compared with that of existing single-phase and two-phase scheduling algorithms to demonstrate the efficacy of the proposed algorithms.
AbstractList Cloud Computing has grown exponentially in the business and research community over the last few years. It is now an emerging field and becomes more popular due to recent advances in virtualization technology. In Cloud Computing, various applications are submitted to the datacenters to obtain some services on pay-per-use basis. However, due to limited resources, some workloads are transferred to other data centers to handle peak client demands. Therefore, scheduling workloads in heterogeneous multi-cloud environment is a hot topic and very challenging due to heterogeneity of the cloud resources with varying capacities and functionalities. In this paper, we present three task scheduling algorithms, called MCC, MEMAX and CMMN for heterogeneous multi-cloud environment, which aim to minimize the makespan and maximize the average cloud utilization. The proposed MCC algorithm is a single-phase scheduling whereas rests are two-phase scheduling. We perform rigorous experiments on the proposed algorithms using various benchmark as well as synthetic datasets. Their performances are evaluated in terms of makespan and average cloud utilization and experimental results are compared with that of existing single-phase and two-phase scheduling algorithms to demonstrate the efficacy of the proposed algorithms.
Author Panda, Sanjaya K.
Jana, Prasanta K.
Author_xml – sequence: 1
  givenname: Sanjaya K.
  surname: Panda
  fullname: Panda, Sanjaya K.
  organization: Department of Computer Science and Engineering, Veer Surendra Sai University of Technology
– sequence: 2
  givenname: Prasanta K.
  surname: Jana
  fullname: Jana, Prasanta K.
  email: prasantajana@yahoo.com
  organization: Indian School of Mines
BookMark eNp9kDtPwzAURi1UJNrCD2DLyGLwM05GVJWHVMECs-U6duqS2MV2kPj3pISJodNdzvl0dRZg5oM3AFxjdIsREncJY0IERJhBTEUJyzMwx1xQiFjFZmCOaoJgxRm5AIuU9gghRgWdg5e1tU4743ORVfookt6ZZuicbwvVtSG6vOtTYUMsdiabGFrjTRhS0Q9ddlB3YWgK479cDL4fRy7BuVVdMld_dwneH9Zvqye4eX18Xt1voKY1ztDwkhJd8RJza4QWaFsq1FREM1ExRWuLSq5tjWor6q0SdKtMozlRllMrLBN0CW6m3UMMn4NJWfYuadN16vc9icuKV6gWjIyomFAdQ0rRWKldVtkFn6NyncRIHgvKqaAcC8pjQVmOJv5nHqLrVfw-6ZDJSSPrWxPlPgzRjy1OSD9PWYaE
CitedBy_id crossref_primary_10_1007_s10586_019_02956_8
crossref_primary_10_1007_s11227_016_1952_z
crossref_primary_10_1007_s12652_020_02063_2
crossref_primary_10_1080_19393555_2017_1407848
crossref_primary_10_1007_s12652_020_02166_w
crossref_primary_10_1016_j_comcom_2019_12_050
crossref_primary_10_1007_s10586_020_03071_9
crossref_primary_10_1007_s11227_019_02767_z
crossref_primary_10_3390_f15071187
crossref_primary_10_1109_TNSM_2021_3072296
crossref_primary_10_1007_s10346_024_02310_z
crossref_primary_10_1007_s11036_018_1062_7
crossref_primary_10_1007_s13369_016_2069_7
crossref_primary_10_1109_TSC_2019_2906870
crossref_primary_10_1080_01605682_2023_2195426
crossref_primary_10_1155_2022_5324202
crossref_primary_10_1016_j_simpat_2023_102819
crossref_primary_10_1016_j_jpdc_2024_104920
crossref_primary_10_1007_s10723_019_09476_0
crossref_primary_10_1007_s11277_020_07807_z
crossref_primary_10_1007_s10586_018_2858_8
crossref_primary_10_1007_s11277_021_08634_6
crossref_primary_10_1155_2019_6543957
crossref_primary_10_1016_j_procs_2015_04_081
crossref_primary_10_1109_TCC_2020_3019952
crossref_primary_10_1109_TETCI_2020_3037918
crossref_primary_10_1007_s13369_018_3261_8
crossref_primary_10_1007_s41870_018_0148_6
crossref_primary_10_1016_j_procs_2023_01_136
crossref_primary_10_4018_IJNCR_2018010102
crossref_primary_10_1016_j_infsof_2019_01_003
crossref_primary_10_3390_make7030069
crossref_primary_10_1002_dac_4302
crossref_primary_10_1016_j_cosrev_2018_08_002
crossref_primary_10_1109_ACCESS_2021_3074833
crossref_primary_10_1007_s11227_018_2345_2
crossref_primary_10_1109_TASE_2017_2693688
crossref_primary_10_1016_j_jss_2016_07_006
crossref_primary_10_1515_comp_2020_0215
crossref_primary_10_1080_00207543_2022_2163431
crossref_primary_10_1016_j_jksuci_2018_10_001
crossref_primary_10_1007_s10723_019_09490_2
crossref_primary_10_1007_s41870_025_02490_4
crossref_primary_10_1155_2020_3504642
crossref_primary_10_1007_s11227_021_04016_8
crossref_primary_10_4018_IJITWE_2019010102
crossref_primary_10_3390_toxics12020118
crossref_primary_10_1016_j_micpro_2020_103607
crossref_primary_10_1007_s12652_020_01747_z
crossref_primary_10_1007_s10586_021_03464_4
crossref_primary_10_32604_cmes_2023_022287
crossref_primary_10_3390_f16020253
crossref_primary_10_1007_s40435_020_00737_5
crossref_primary_10_1109_ACCESS_2017_2750209
crossref_primary_10_1007_s10586_021_03275_7
crossref_primary_10_1007_s13369_017_2766_x
crossref_primary_10_3390_sym17040503
crossref_primary_10_1007_s10586_016_0682_6
crossref_primary_10_1007_s11227_022_04539_8
crossref_primary_10_1109_ACCESS_2019_2946216
crossref_primary_10_1007_s11227_017_1995_9
crossref_primary_10_3390_electronics11091451
crossref_primary_10_1016_j_oceaneng_2023_116477
crossref_primary_10_1007_s12652_021_03482_5
crossref_primary_10_1016_j_procs_2023_12_044
crossref_primary_10_32604_cmc_2021_015026
crossref_primary_10_3390_app13021101
crossref_primary_10_1109_TIM_2024_3497179
crossref_primary_10_1007_s41870_017_0022_y
crossref_primary_10_1007_s44213_025_00046_7
crossref_primary_10_1007_s11227_017_2112_9
crossref_primary_10_1007_s10586_023_04216_2
crossref_primary_10_1007_s13369_017_2798_2
crossref_primary_10_1186_s12859_019_3131_8
crossref_primary_10_1109_ACCESS_2024_3355092
crossref_primary_10_1002_ett_4277
crossref_primary_10_1155_2024_1444493
crossref_primary_10_1007_s10668_024_05566_6
crossref_primary_10_3390_buildings15091446
crossref_primary_10_1109_ACCESS_2020_3026875
crossref_primary_10_4018_IJKBO_2018010104
crossref_primary_10_1080_14498596_2024_2386317
crossref_primary_10_1007_s10796_017_9742_6
crossref_primary_10_1007_s41870_020_00529_2
crossref_primary_10_1007_s00607_021_01030_9
crossref_primary_10_1002_spe_3370
crossref_primary_10_1007_s10586_020_03095_1
crossref_primary_10_1016_j_matpr_2020_10_082
crossref_primary_10_1007_s10796_016_9683_5
crossref_primary_10_1007_s11227_022_04684_0
crossref_primary_10_1007_s13198_022_01685_3
crossref_primary_10_1007_s13369_017_2926_z
crossref_primary_10_4018_IJRSDA_2017100102
crossref_primary_10_1007_s11227_024_06557_0
crossref_primary_10_1007_s11227_019_03038_7
crossref_primary_10_1016_j_engappai_2025_110963
crossref_primary_10_1109_ACCESS_2019_2948704
crossref_primary_10_3390_rs15112788
crossref_primary_10_1109_ACCESS_2021_3077901
crossref_primary_10_1186_s43251_024_00119_3
crossref_primary_10_1007_s11227_019_02874_x
crossref_primary_10_1080_23311916_2024_2328355
crossref_primary_10_3390_app15074003
crossref_primary_10_1007_s41870_020_00594_7
crossref_primary_10_1007_s10586_020_03186_z
crossref_primary_10_1007_s11227_017_2094_7
crossref_primary_10_1007_s10115_019_01327_4
crossref_primary_10_1155_2021_6631752
crossref_primary_10_1007_s40747_021_00365_2
crossref_primary_10_1109_TNSM_2022_3227767
crossref_primary_10_1007_s10586_025_05405_x
crossref_primary_10_1016_j_eswa_2025_127400
crossref_primary_10_1109_IOTM_0001_1900101
Cites_doi 10.1007/s11227-010-0424-0
10.1109/TPDS.2008.260
10.1016/S1007-0214(10)70065-1
10.1007/s11227-011-0625-1
10.1006/jpdc.2000.1714
10.1145/344588.344618
10.1007/s00453-007-9004-y
10.1007/s11227-014-1089-x
10.1145/322003.322011
10.1007/s11227-014-1097-x
10.1016/j.jpdc.2012.02.002
10.1016/j.cor.2013.06.012
10.4304/jsw.6.6.1146-1153
10.1109/TPDS.2004.1264795
10.1016/j.future.2011.05.016
10.1006/jpdc.1999.1581
10.1007/BF01585745
10.1504/IJWGS.2007.012635
10.1016/j.parco.2013.03.002
10.1109/MCOM.2012.6295710
10.1109/71.503776
10.1007/s11227-011-0667-4
10.1016/j.future.2013.12.004
10.1016/S0022-0000(75)80008-0
10.1016/j.future.2013.09.006
10.1109/71.265940
10.1007/BF01215349
10.1109/71.954632
10.1504/IJWGS.2007.014075
10.1145/322092.322101
10.1109/71.993206
10.1016/j.parco.2005.04.002
10.1016/j.future.2008.12.001
10.1109/HCW.1998.666558
10.1109/NCM.2009.218
10.1145/1383422.1383434
10.1145/1980422.1980437
10.1109/HCW.1998.666547
10.1109/EMEIT.2011.6022888
10.1109/IPDPS.2000.845974
10.1145/2391229.2391244
ContentType Journal Article
Copyright Springer Science+Business Media New York 2015
Copyright_xml – notice: Springer Science+Business Media New York 2015
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1007/s11227-014-1376-6
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Business
EISSN 1573-0484
EndPage 1533
ExternalDocumentID 10_1007_s11227_014_1376_6
GroupedDBID -4Z
-59
-5G
-BR
-EM
-Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
123
199
1N0
1SB
2.D
203
28-
29L
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5QI
5VS
67Z
6NX
78A
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYOK
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDBF
ABDPE
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACUHS
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADMLS
ADQRH
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHSBF
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
B0M
BA0
BBWZM
BDATZ
BGNMA
BSONS
CAG
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EAD
EAP
EAS
EBD
EBLON
EBS
EDO
EIOEI
EJD
EMK
EPL
ESBYG
ESX
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
H~9
I-F
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
LAK
LLZTM
M4Y
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P9O
PF0
PT4
PT5
QOK
QOS
R4E
R89
R9I
RHV
RNI
ROL
RPX
RSV
RZC
RZE
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
TEORI
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WH7
WK8
YLTOR
Z45
Z7R
Z7X
Z7Z
Z83
Z88
Z8M
Z8N
Z8R
Z8T
Z8W
Z92
ZMTXR
~8M
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABJCF
ABRTQ
ACSTC
ADHKG
ADKFA
AEZWR
AFDZB
AFFHD
AFHIU
AFKRA
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ARAPS
ATHPR
AYFIA
BENPR
BGLVJ
CCPQU
CITATION
HCIFZ
K7-
M7S
PHGZM
PHGZT
PQGLB
PTHSS
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c391t-e5632c85615fe7c70b6a0d82c4784a39f065cf909f79ba73baedc52af53f7f473
IEDL.DBID RSV
ISICitedReferencesCount 140
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000352360300015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0920-8542
IngestDate Thu Jul 10 22:59:42 EDT 2025
Tue Nov 18 20:00:22 EST 2025
Sat Nov 29 06:13:07 EST 2025
Fri Feb 21 02:27:41 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords Multi-cloud environment
Task scheduling
Cloud computing
Makespan
Cloud utilization
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c391t-e5632c85615fe7c70b6a0d82c4784a39f065cf909f79ba73baedc52af53f7f473
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
PQID 1685809742
PQPubID 23500
PageCount 29
ParticipantIDs proquest_miscellaneous_1685809742
crossref_citationtrail_10_1007_s11227_014_1376_6
crossref_primary_10_1007_s11227_014_1376_6
springer_journals_10_1007_s11227_014_1376_6
PublicationCentury 2000
PublicationDate 2015-04-01
PublicationDateYYYYMMDD 2015-04-01
PublicationDate_xml – month: 04
  year: 2015
  text: 2015-04-01
  day: 01
PublicationDecade 2010
PublicationPlace Boston
PublicationPlace_xml – name: Boston
PublicationSubtitle An International Journal of High-Performance Computer Design, Analysis, and Use
PublicationTitle The Journal of supercomputing
PublicationTitleAbbrev J Supercomput
PublicationYear 2015
Publisher Springer US
Publisher_xml – name: Springer US
References Ibarra, Kim (CR10) 1977; 24
Kwok, Ahmad (CR32) 1999; 31
Zhang, Cao, Li, Khan, Hwang (CR46) 2014; 37
Begnum (CR6) 2012; 61
Tsai, Fang, Chou (CR4) 2013; 40
CR19
Li, Qiu, Ming, Quan, Qin, Gu (CR16) 2012; 72
CR18
CR17
Xhafa, Barolli, Durresi (CR30) 2007; 3
Ullman (CR7) 1975; 10
Xu, Hu, Yihe (CR26) 2010; 15
Kumar, Marathe, Parthasarathy, Srinivasan (CR37) 2009; 55
Leighton, Maggs, Rao (CR39) 1994; 14
Liu, Yang (CR36) 2011; 6
CR12
Braun, Siegel, Beck, Boloni, Maheswaran, Reuther, Robertson, Theys, Yao, Hensgen, Freund (CR8) 2001; 61
CR11
Kwok, Ahmad (CR13) 1996; 7
CR31
Wang, Wang, Cui (CR48) 2014; 36
Ergu, Kou, Peng, Shi, Shi (CR20) 2013; 64
Gil, Park, Jeong (CR45) 2013; 66
Su, Li, Huang, Huang, Shuang, Wang (CR47) 2013; 39
Bajaj, Agrawal (CR15) 2004; 15
CR3
Hagras, Janecek (CR34) 2005; 31
Nathani, Chaudhary, Somani (CR28) 2012; 28
CR5
Zhang, Sivasubramaniam, Moreira, Franke (CR33) 2001; 12
Maheswaran, Ali, Siegel, Hensgen, Freund (CR9) 1999; 59
Durao, Carvalho, Fonseka, Garcia (CR2) 2014; 68
CR24
CR23
CR22
CR21
Lawler, Labetoulle (CR35) 1978; 25
CR42
Bittencourt, Madeira, Fonseca (CR27) 2012; 50
CR41
CR40
Buyya, Yeo, Venugopal, Broberg, Brandic (CR1) 2009; 25
Topcuoglu, Hariri, Wu (CR14) 2002; 13
Xhafa, Carretero, Barolli, Durresi (CR29) 2007; 3
Lenstra, Shmoys, Tardos (CR38) 1990; 46
Bozdag, Ozguner, Catalyurek (CR25) 2009; 20
Hou, Ansari, Ren (CR43) 1994; 5
Yang, Peng, Zhao, Yu, Zhou, Wang, Du (CR44) 2014; 68
1376_CR21
1376_CR22
1376_CR23
1376_CR24
T Hagras (1376_CR34) 2005; 31
1376_CR40
F Durao (1376_CR2) 2014; 68
F Xhafa (1376_CR30) 2007; 3
1376_CR41
1376_CR42
Y Kwok (1376_CR13) 1996; 7
J Gil (1376_CR45) 2013; 66
FT Leighton (1376_CR39) 1994; 14
1376_CR3
A Nathani (1376_CR28) 2012; 28
LF Bittencourt (1376_CR27) 2012; 50
M Maheswaran (1376_CR9) 1999; 59
JK Lenstra (1376_CR38) 1990; 46
1376_CR5
JD Ullman (1376_CR7) 1975; 10
TD Braun (1376_CR8) 2001; 61
1376_CR11
OH Ibarra (1376_CR10) 1977; 24
1376_CR12
1376_CR31
X Wang (1376_CR48) 2014; 36
E Hou (1376_CR43) 1994; 5
F Xhafa (1376_CR29) 2007; 3
Y Zhang (1376_CR33) 2001; 12
C Liu (1376_CR36) 2011; 6
K Begnum (1376_CR6) 2012; 61
Y Kwok (1376_CR32) 1999; 31
R Bajaj (1376_CR15) 2004; 15
D Ergu (1376_CR20) 2013; 64
R Buyya (1376_CR1) 2009; 25
D Bozdag (1376_CR25) 2009; 20
Y Xu (1376_CR26) 2010; 15
S Su (1376_CR47) 2013; 39
1376_CR18
F Zhang (1376_CR46) 2014; 37
J Tsai (1376_CR4) 2013; 40
1376_CR19
H Topcuoglu (1376_CR14) 2002; 13
EL Lawler (1376_CR35) 1978; 25
Q Yang (1376_CR44) 2014; 68
J Li (1376_CR16) 2012; 72
1376_CR17
VSA Kumar (1376_CR37) 2009; 55
References_xml – volume: 61
  start-page: 251
  issue: 2
  year: 2012
  end-page: 266
  ident: CR6
  article-title: Simplified cloud-oriented virtual machine management with MLN
  publication-title: J Supercomput
  doi: 10.1007/s11227-010-0424-0
– volume: 20
  start-page: 857
  issue: 6
  year: 2009
  end-page: 871
  ident: CR25
  article-title: Compaction of schedules and a two-stage approach for duplication-based DAG scheduling
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/TPDS.2008.260
– volume: 15
  start-page: 299
  issue: 3
  year: 2010
  end-page: 306
  ident: CR26
  article-title: Data dependence graph directed scheduling for clustered VLIW architectures
  publication-title: Tsinghua Sci Technol IEEE
  doi: 10.1016/S1007-0214(10)70065-1
– volume: 64
  start-page: 835
  year: 2013
  end-page: 848
  ident: CR20
  article-title: The analytic hierarchy process: task scheduling and resource allocation in cloud computing environment
  publication-title: J Supercomput Springer
  doi: 10.1007/s11227-011-0625-1
– ident: CR22
– volume: 61
  start-page: 810
  issue: 6
  year: 2001
  end-page: 837
  ident: CR8
  article-title: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
  publication-title: J Parallel Distrib Comput
  doi: 10.1006/jpdc.2000.1714
– ident: CR18
– volume: 31
  start-page: 406
  issue: 4
  year: 1999
  end-page: 471
  ident: CR32
  article-title: Static scheduling algorithms for allocating directed task graphs to multiprocessors
  publication-title: ACM Comput Surv (CSUR)
  doi: 10.1145/344588.344618
– volume: 55
  start-page: 205
  year: 2009
  end-page: 226
  ident: CR37
  article-title: Scheduling on unrelated machines under tree-like precedence constraints
  publication-title: Algorithmica
  doi: 10.1007/s00453-007-9004-y
– volume: 68
  start-page: 1321
  issue: 3
  year: 2014
  end-page: 1346
  ident: CR2
  article-title: A systematic review on cloud computing
  publication-title: J Supercomput
  doi: 10.1007/s11227-014-1089-x
– volume: 24
  start-page: 280
  issue: 2
  year: 1977
  end-page: 289
  ident: CR10
  article-title: Heuristic algorithms for scheduling independent tasks on nonidentical processors
  publication-title: J Assoc Comput Mach
  doi: 10.1145/322003.322011
– volume: 68
  start-page: 1402
  issue: 3
  year: 2014
  end-page: 1417
  ident: CR44
  article-title: A new method based on PSR and EA-GMDH for host load prediction in cloud computing system
  publication-title: J Supercomput
  doi: 10.1007/s11227-014-1097-x
– ident: CR12
– volume: 72
  start-page: 666
  year: 2012
  end-page: 677
  ident: CR16
  article-title: Online optimization for scheduling preemptable tasks on IaaS cloud system
  publication-title: J Parallel Distrib Comput Elsevier
  doi: 10.1016/j.jpdc.2012.02.002
– volume: 40
  start-page: 3045
  issue: 12
  year: 2013
  end-page: 3055
  ident: CR4
  article-title: Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm
  publication-title: Comput Oper Res Elsevier
  doi: 10.1016/j.cor.2013.06.012
– volume: 6
  start-page: 1146
  issue: 6
  year: 2011
  end-page: 1153
  ident: CR36
  article-title: A heuristic serial schedule algorithm for unrelated parallel machine scheduling with precedence constraints
  publication-title: J Softw
  doi: 10.4304/jsw.6.6.1146-1153
– volume: 15
  start-page: 107
  issue: 2
  year: 2004
  end-page: 118
  ident: CR15
  article-title: Improving scheduling of tasks in a heterogeneous environment
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/TPDS.2004.1264795
– volume: 28
  start-page: 94
  year: 2012
  end-page: 103
  ident: CR28
  article-title: Policy based resource allocation in IaaS cloud
  publication-title: Future Gen Comput Syst Elsevier
  doi: 10.1016/j.future.2011.05.016
– volume: 59
  start-page: 107
  year: 1999
  end-page: 131
  ident: CR9
  article-title: Dynamic mapping of a class of independent tasks onto heterogeneous computing systems
  publication-title: J Parallel Distrib Comput
  doi: 10.1006/jpdc.1999.1581
– volume: 46
  start-page: 259
  issue: 1–3
  year: 1990
  end-page: 271
  ident: CR38
  article-title: Approximation algorithms for scheduling unrelated parallel machines
  publication-title: Math Program
  doi: 10.1007/BF01585745
– volume: 3
  start-page: 19
  issue: 1
  year: 2007
  end-page: 37
  ident: CR30
  article-title: Batch mode scheduling in grid systems
  publication-title: Int J Web Grid Serv
  doi: 10.1504/IJWGS.2007.012635
– ident: CR40
– volume: 39
  start-page: 177
  issue: 4–5
  year: 2013
  end-page: 188
  ident: CR47
  article-title: Cost-efficient task scheduling for executing large programs in the cloud
  publication-title: Parallel Comput
  doi: 10.1016/j.parco.2013.03.002
– volume: 50
  start-page: 42
  issue: 9
  year: 2012
  end-page: 47
  ident: CR27
  article-title: Scheduling in hybrid clouds
  publication-title: IEEE Commun Mag
  doi: 10.1109/MCOM.2012.6295710
– ident: CR42
– ident: CR23
– volume: 7
  start-page: 506
  issue: 5
  year: 1996
  end-page: 521
  ident: CR13
  article-title: Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/71.503776
– volume: 66
  start-page: 1194
  issue: 3
  year: 2013
  end-page: 1214
  ident: CR45
  article-title: Data center selection based on neuro-fuzzy inference systems in cloud computing environments
  publication-title: J Supercomput
  doi: 10.1007/s11227-011-0667-4
– ident: CR21
– volume: 36
  start-page: 91
  year: 2014
  end-page: 101
  ident: CR48
  article-title: A new multi-objective Bi-level programming model for energy and locality aware multi-job scheduling in cloud computing
  publication-title: Future Gen Comput Syst Elsevier
  doi: 10.1016/j.future.2013.12.004
– ident: CR19
– ident: CR3
– volume: 10
  start-page: 384
  issue: 3
  year: 1975
  end-page: 393
  ident: CR7
  article-title: NP-complete scheduling problems
  publication-title: J Comput Syst Sci
  doi: 10.1016/S0022-0000(75)80008-0
– ident: CR17
– volume: 37
  start-page: 309
  year: 2014
  end-page: 320
  ident: CR46
  article-title: Multi-objective scheduling of many tasks in cloud platforms
  publication-title: Future Gen Comput Syst Elsevier
  doi: 10.1016/j.future.2013.09.006
– ident: CR31
– ident: CR11
– volume: 5
  start-page: 113
  issue: 2
  year: 1994
  end-page: 120
  ident: CR43
  article-title: A genetic algorithm for multiprocessor scheduling
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/71.265940
– volume: 14
  start-page: 167
  year: 1994
  end-page: 186
  ident: CR39
  article-title: Packet routing and job-shop scheduling in (Congestion + Dilation) steps
  publication-title: Combinatorica
  doi: 10.1007/BF01215349
– ident: CR5
– volume: 12
  start-page: 967
  issue: 9
  year: 2001
  end-page: 985
  ident: CR33
  article-title: Impact of workload and system parameters on next generation cluster scheduling mechanisms
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/71.954632
– volume: 3
  start-page: 219
  issue: 2
  year: 2007
  end-page: 236
  ident: CR29
  article-title: Immediate mode scheduling in grid systems
  publication-title: Int J Web Grid Serv
  doi: 10.1504/IJWGS.2007.014075
– volume: 25
  start-page: 612
  issue: 4
  year: 1978
  end-page: 619
  ident: CR35
  article-title: On preemptive scheduling of unrelated parallel processors by linear programming
  publication-title: J Assoc Comput Mach
  doi: 10.1145/322092.322101
– volume: 13
  start-page: 260
  issue: 3
  year: 2002
  end-page: 274
  ident: CR14
  article-title: Performance-effective and low-complexity task scheduling for heterogeneous computing
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/71.993206
– volume: 31
  start-page: 653
  issue: 7
  year: 2005
  end-page: 670
  ident: CR34
  article-title: A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems
  publication-title: Parallel Comput
  doi: 10.1016/j.parco.2005.04.002
– ident: CR41
– ident: CR24
– volume: 25
  start-page: 599
  year: 2009
  end-page: 616
  ident: CR1
  article-title: Cloud computing and emerging IT platforms: vision, hype and reality for delivering computing as the 5th utility
  publication-title: Future Gen Comput Syst Elsevier
  doi: 10.1016/j.future.2008.12.001
– ident: 1376_CR12
  doi: 10.1109/HCW.1998.666558
– volume: 13
  start-page: 260
  issue: 3
  year: 2002
  ident: 1376_CR14
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/71.993206
– ident: 1376_CR3
  doi: 10.1109/NCM.2009.218
– volume: 31
  start-page: 406
  issue: 4
  year: 1999
  ident: 1376_CR32
  publication-title: ACM Comput Surv (CSUR)
  doi: 10.1145/344588.344618
– ident: 1376_CR5
– volume: 46
  start-page: 259
  issue: 1–3
  year: 1990
  ident: 1376_CR38
  publication-title: Math Program
  doi: 10.1007/BF01585745
– volume: 25
  start-page: 599
  year: 2009
  ident: 1376_CR1
  publication-title: Future Gen Comput Syst Elsevier
  doi: 10.1016/j.future.2008.12.001
– ident: 1376_CR22
  doi: 10.1145/1383422.1383434
– volume: 50
  start-page: 42
  issue: 9
  year: 2012
  ident: 1376_CR27
  publication-title: IEEE Commun Mag
  doi: 10.1109/MCOM.2012.6295710
– volume: 5
  start-page: 113
  issue: 2
  year: 1994
  ident: 1376_CR43
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/71.265940
– volume: 36
  start-page: 91
  year: 2014
  ident: 1376_CR48
  publication-title: Future Gen Comput Syst Elsevier
  doi: 10.1016/j.future.2013.12.004
– volume: 39
  start-page: 177
  issue: 4–5
  year: 2013
  ident: 1376_CR47
  publication-title: Parallel Comput
  doi: 10.1016/j.parco.2013.03.002
– volume: 68
  start-page: 1321
  issue: 3
  year: 2014
  ident: 1376_CR2
  publication-title: J Supercomput
  doi: 10.1007/s11227-014-1089-x
– ident: 1376_CR24
  doi: 10.1145/1980422.1980437
– ident: 1376_CR42
  doi: 10.1109/NCM.2009.218
– volume: 59
  start-page: 107
  year: 1999
  ident: 1376_CR9
  publication-title: J Parallel Distrib Comput
  doi: 10.1006/jpdc.1999.1581
– ident: 1376_CR11
  doi: 10.1109/HCW.1998.666547
– volume: 40
  start-page: 3045
  issue: 12
  year: 2013
  ident: 1376_CR4
  publication-title: Comput Oper Res Elsevier
  doi: 10.1016/j.cor.2013.06.012
– volume: 61
  start-page: 251
  issue: 2
  year: 2012
  ident: 1376_CR6
  publication-title: J Supercomput
  doi: 10.1007/s11227-010-0424-0
– ident: 1376_CR17
– volume: 28
  start-page: 94
  year: 2012
  ident: 1376_CR28
  publication-title: Future Gen Comput Syst Elsevier
  doi: 10.1016/j.future.2011.05.016
– ident: 1376_CR19
– volume: 31
  start-page: 653
  issue: 7
  year: 2005
  ident: 1376_CR34
  publication-title: Parallel Comput
  doi: 10.1016/j.parco.2005.04.002
– ident: 1376_CR18
  doi: 10.1109/EMEIT.2011.6022888
– volume: 64
  start-page: 835
  year: 2013
  ident: 1376_CR20
  publication-title: J Supercomput Springer
  doi: 10.1007/s11227-011-0625-1
– volume: 20
  start-page: 857
  issue: 6
  year: 2009
  ident: 1376_CR25
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/TPDS.2008.260
– ident: 1376_CR23
– volume: 3
  start-page: 219
  issue: 2
  year: 2007
  ident: 1376_CR29
  publication-title: Int J Web Grid Serv
  doi: 10.1504/IJWGS.2007.014075
– volume: 55
  start-page: 205
  year: 2009
  ident: 1376_CR37
  publication-title: Algorithmica
  doi: 10.1007/s00453-007-9004-y
– volume: 61
  start-page: 810
  issue: 6
  year: 2001
  ident: 1376_CR8
  publication-title: J Parallel Distrib Comput
  doi: 10.1006/jpdc.2000.1714
– volume: 14
  start-page: 167
  year: 1994
  ident: 1376_CR39
  publication-title: Combinatorica
  doi: 10.1007/BF01215349
– ident: 1376_CR40
  doi: 10.1109/IPDPS.2000.845974
– volume: 68
  start-page: 1402
  issue: 3
  year: 2014
  ident: 1376_CR44
  publication-title: J Supercomput
  doi: 10.1007/s11227-014-1097-x
– volume: 10
  start-page: 384
  issue: 3
  year: 1975
  ident: 1376_CR7
  publication-title: J Comput Syst Sci
  doi: 10.1016/S0022-0000(75)80008-0
– volume: 3
  start-page: 19
  issue: 1
  year: 2007
  ident: 1376_CR30
  publication-title: Int J Web Grid Serv
  doi: 10.1504/IJWGS.2007.012635
– volume: 37
  start-page: 309
  year: 2014
  ident: 1376_CR46
  publication-title: Future Gen Comput Syst Elsevier
  doi: 10.1016/j.future.2013.09.006
– volume: 72
  start-page: 666
  year: 2012
  ident: 1376_CR16
  publication-title: J Parallel Distrib Comput Elsevier
  doi: 10.1016/j.jpdc.2012.02.002
– volume: 15
  start-page: 299
  issue: 3
  year: 2010
  ident: 1376_CR26
  publication-title: Tsinghua Sci Technol IEEE
  doi: 10.1016/S1007-0214(10)70065-1
– volume: 12
  start-page: 967
  issue: 9
  year: 2001
  ident: 1376_CR33
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/71.954632
– volume: 25
  start-page: 612
  issue: 4
  year: 1978
  ident: 1376_CR35
  publication-title: J Assoc Comput Mach
  doi: 10.1145/322092.322101
– ident: 1376_CR41
– volume: 24
  start-page: 280
  issue: 2
  year: 1977
  ident: 1376_CR10
  publication-title: J Assoc Comput Mach
  doi: 10.1145/322003.322011
– volume: 15
  start-page: 107
  issue: 2
  year: 2004
  ident: 1376_CR15
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/TPDS.2004.1264795
– volume: 6
  start-page: 1146
  issue: 6
  year: 2011
  ident: 1376_CR36
  publication-title: J Softw
– ident: 1376_CR31
– volume: 66
  start-page: 1194
  issue: 3
  year: 2013
  ident: 1376_CR45
  publication-title: J Supercomput
  doi: 10.1007/s11227-011-0667-4
– volume: 7
  start-page: 506
  issue: 5
  year: 1996
  ident: 1376_CR13
  publication-title: IEEE Trans Parallel Distrib Syst
  doi: 10.1109/71.503776
– ident: 1376_CR21
  doi: 10.1145/2391229.2391244
SSID ssj0004373
Score 2.4250891
Snippet Cloud Computing has grown exponentially in the business and research community over the last few years. It is now an emerging field and becomes more popular...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1505
SubjectTerms Algorithms
Business
Cloud computing
Compilers
Computer Science
Heterogeneity
Interpreters
Processor Architectures
Programming Languages
Scheduling
Task scheduling
Utilization
Workload
Title Efficient task scheduling algorithms for heterogeneous multi-cloud environment
URI https://link.springer.com/article/10.1007/s11227-014-1376-6
https://www.proquest.com/docview/1685809742
Volume 71
WOSCitedRecordID wos000352360300015&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: PRVAVX
  databaseName: Springer Journals New Starts & Take-Overs Collection
  customDbUrl:
  eissn: 1573-0484
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004373
  issn: 0920-8542
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEA66evDi-sT1RQRPSqBNmiY5iuziQRZBXfYW0jRxxXUr266_36QPq6KC3jOhTGY6M3wz3wBwmnJl_KIplBLGkEcCkYiYRsykSmihmC7JqkfXbDjk47G4qee486bbvYEkyz91O-wWYuzbJCMUOq9A8TJYoZ5sxpfot6N2GJJUsLJwdRGnEW6gzO-u-ByM2gzzCyhaxppB919fuQHW69QSXlS2sAmWzGwLdJu1DbD24m0w7Je0ES7awELlT9DVty7e-LF0qKYP2fyxmDzn0CWzcOJ7ZTJnYiZb5LDsPUR6mi1S-GE-bgfcD_p3l1eoXquANBFhgQyNCdbcJU7UGqZZkMQqSDnWEeORIsK6rERbEQjLRKIYSZRJNcXKUmKZjRjZBZ1ZNjN7AMYpZjSxTHPCI2JIgoWTVDZMVMCMiHsgaPQrdc057ldfTGXLluz1JZ2-pNeXdCJn7yIvFeHGb4dPmkeTzi081qFKlcjQ8-o764hwD5w3LyVr_8x_vnH_T6cPwJpLoGjVyXMIOsV8YY7Aqn4tHvP5cWmXbwBQ3c8
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwEA86BX1xfuL8jOCTEmiTtmkeRTYU5xCcY28hTRM3nKusnX-_ST-sigr6ngvlcte743f3OwBO41Aou2gKxYRSZJFAxDwqEVWxYJIJKnOy6kGX9nrhcMjuyjnutOp2ryDJ_E9dD7u5GNs2SQ-5xitQsAiWPLtlx5bo94N6GJIUsDIzdVHoe7iCMr-74nMwqjPML6BoHms6zX995TpYK1NLeFHYwgZYUNNN0KzWNsDSi7dAr53TRphoAzORPkFT35p4Y8fSoZg8JrNxNnpOoUlm4cj2yiTGxFQyT2Hee4jkJJnH8MN83DZ46LT7l1eoXKuAJGFuhpQfECxDkzj5WlFJnSgQThxi6dHQE4Rpk5VIzRymKYsEJZFQsfSx0D7RVHuU7IDGNJmqXQCDGFM_0lSGJPSIIhFmRlJoNxIOVSxoAafSL5cl57hdfTHhNVuy1Rc3-uJWX9yInL2LvBSEG78dPqkejRu3sFiHyFXCXcur75hiCbfAefVSvPTP9Ocb9_50-hisXPVvu7x73bvZB6smmfKLrp4D0Mhmc3UIluVrNk5nR7mNvgFu4-Cz
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwEA86RXxxfuL8jOCTEmyTtmkeRTcUxxh-DN9CmiYqznasnX-_ST-cigrie-4Ilxx3x-_udwAcxqFQdtEUigmlyCKBiHlUIqpiwSQTVBZk1YMu7fXC-3vWr_acZnW3ew1JljMNlqUpyU9GsT6ZDr65GNuWSQ-5xkNQMAvmPFPI2J6u65vBdDCSlBAzMzVS6Hu4hjW_U_E5ME2zzS8AaRF3Os1_33gZLFUpJzwt_8gKmFHJKmjW6xxg5d1roNcu6CSMTpiL7BmautfEITuuDsXwIR0_5Y8vGTRJLny0PTSp-XoqnWSw6ElEcphOYvhhbm4d3HXat2cXqFq3gCRhbo6UHxAsQ5NQ-VpRSZ0oEE4cYunR0BOEaZOtSM0cpimLBCWRULH0sdA-0VR7lGyARpImahPAIMbUjzSVIQk9okiEmZEU2o2EQxULWsCpbc1lxUVuV2IM-ZRF2dqLG3txay9uRI7eRUYlEcdvhw_qB-TGXSwGIgqTcNfy7TumiMItcFy_Gq_8NvtZ49afTu-Dhf55h3cve1fbYNHkWH7Z7LMDGvl4onbBvHzNn7LxXvFd3wC97OmX
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=Efficient+task+scheduling+algorithms+for+heterogeneous+multi-cloud+environment&rft.jtitle=The+Journal+of+supercomputing&rft.au=Panda%2C+Sanjaya+K&rft.au=Jana%2C+Prasanta+K&rft.date=2015-04-01&rft.issn=0920-8542&rft.eissn=1573-0484&rft.volume=71&rft.issue=4&rft.spage=1505&rft.epage=1533&rft_id=info:doi/10.1007%2Fs11227-014-1376-6&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0920-8542&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0920-8542&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0920-8542&client=summon