Lower-bound complexity algorithm for task scheduling on heterogeneous grid

The problem of best schedule of dependent-tasks application into nodes of computational grid in low complexity is the most important issue to obtain high performance application execution. Scheduling can be performed at compile-time or at run-time depends on tasks and grid-nodes available informatio...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computing Ročník 99; číslo 11; s. 1125 - 1145
Hlavní autoři:	Atef, Asmaa, Hagras, Tarek, Mahdy, Yousef B., Janeček, Jan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Vienna Springer Vienna 01.11.2017 Springer Nature B.V
Témata:	Algorithms Artificial Intelligence Computer Appl. in Administrative Data Processing Computer Communication Networks Computer Science Computer simulation Heuristic Information Systems Applications (incl.Internet) Reproduction (copying) Scheduling Scheduling algorithms Software Engineering Task complexity Task scheduling Task scheduling Grid computing Heterogeneous grids 68M14
ISSN:	0010-485X, 1436-5057
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	The problem of best schedule of dependent-tasks application into nodes of computational grid in low complexity is the most important issue to obtain high performance application execution. Scheduling can be performed at compile-time or at run-time depends on tasks and grid-nodes available information. Due to the NP-completeness of the problem, heuristics are used in compile-time solution of the problem. Two of these heuristics are list-scheduling and duplication-based. List-scheduling heuristics produce reasonable schedule in reasonable time complexity, while duplication-based heuristics produce better schedule in higher time complexity. Many algorithms based on list-scheduling and duplication-based heuristics have been addressed in the literature. This paper proposes a scheduling algorithm based on list-scheduling and duplication-based heuristics. The algorithm is called Best-Node based Critical-Parent. The algorithm keeps the lower-bound complexity of any classes of heuristics-based scheduling algorithms. Random generated applications, in addition to real-world applications have been examined. The experimental results based on computer simulation show that the proposed algorithm performed better than the most-recent and well-known existing algorithms.
AbstractList	The problem of best schedule of dependent-tasks application into nodes of computational grid in low complexity is the most important issue to obtain high performance application execution. Scheduling can be performed at compile-time or at run-time depends on tasks and grid-nodes available information. Due to the NP-completeness of the problem, heuristics are used in compile-time solution of the problem. Two of these heuristics are list-scheduling and duplication-based. List-scheduling heuristics produce reasonable schedule in reasonable time complexity, while duplication-based heuristics produce better schedule in higher time complexity. Many algorithms based on list-scheduling and duplication-based heuristics have been addressed in the literature. This paper proposes a scheduling algorithm based on list-scheduling and duplication-based heuristics. The algorithm is called Best-Node based Critical-Parent. The algorithm keeps the lower-bound complexity of any classes of heuristics-based scheduling algorithms. Random generated applications, in addition to real-world applications have been examined. The experimental results based on computer simulation show that the proposed algorithm performed better than the most-recent and well-known existing algorithms.
Author	Hagras, Tarek Mahdy, Yousef B. Atef, Asmaa Janeček, Jan
Author_xml	– sequence: 1 givenname: Asmaa surname: Atef fullname: Atef, Asmaa organization: Faculty of Computers and Information, Asyut University – sequence: 2 givenname: Tarek orcidid: 0000-0002-3736-425X surname: Hagras fullname: Hagras, Tarek email: hagras@aswu.edu.eg organization: Faculty of Energy Engineering, Aswan University – sequence: 3 givenname: Yousef B. surname: Mahdy fullname: Mahdy, Yousef B. organization: Faculty of Computers and Information, Asyut University – sequence: 4 givenname: Jan surname: Janeček fullname: Janeček, Jan organization: Faculty of Information Technology, Czech Technical University in Prague
BookMark	eNp9kD1PwzAQhi1UJNrCD2CzxBw4x3aSjqjiU5VYQGKznPiSpqR2sR1B_z2pwoCQYDjd8j53r54ZmVhnkZBzBpcMIL8KABnkCbBhpCwSeUSmTPAskSDzCZkCMEhEIV9PyCyEDQCkvFhMyePKfaBPStdbQyu33XX42cY91V3jfBvXW1o7T6MObzRUazR919qGOkvXGNG7Bi26PtDGt-aUHNe6C3j2vefk5fbmeXmfrJ7uHpbXq6Ti2SImNWdYCFFnWW2YEGWWAjNpNhTkmNdcoC7RaF6nwhQGywVwNJJhWvFCCwTO5-RivLvz7r3HENXG9d4OLxVbSCYF44UcUvmYqrwLwWOtqjbq2DobvW47xUAdxKlRnBrEqYM4dSDZL3Ln2632-3-ZdGTCkLUN-h-d_oS-AJfpgrk
CitedBy_id	crossref_primary_10_1007_s10723_021_09554_2 crossref_primary_10_1007_s10586_024_04298_6 crossref_primary_10_1016_j_jii_2022_100337 crossref_primary_10_1007_s11227_021_04112_9 crossref_primary_10_1007_s11227_019_02982_8 crossref_primary_10_1088_1757_899X_569_4_042059
Cites_doi	10.1109/71.207593 10.1002/0470121173 10.1016/S0022-0000(75)80008-0 10.1007/s11227-009-0284-7 10.1002/spe.488 10.1109/TPDS.2013.57 10.1109/71.722221 10.1109/71.993206 10.1016/j.parco.2005.04.002 10.1016/j.jpdc.2010.01.003 10.1016/j.jpdc.2010.10.004 10.1007/978-1-4614-2361-4 10.3844/jcssp.2007.94.103 10.1007/978-0-387-09457-1_7 10.14311/490 10.1109/ICPP.1994.37 10.1109/ICPP.1994.46 10.1109/IPDPS.2006.1639389 10.1007/11557654_26 10.1109/ISPAN.1996.508983 10.1109/HCW.1999.765093 10.1109/PDP.2010.56 10.1007/978-90-481-9965-5_10
ContentType	Journal Article
Copyright	Springer-Verlag Wien 2017 Computing is a copyright of Springer, 2017.
Copyright_xml	– notice: Springer-Verlag Wien 2017 – notice: Computing is a copyright of Springer, 2017.
DBID	AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 8AL 8AO 8FD 8FE 8FG 8FK 8FL 8G5 ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- L.- L7M L~C L~D M0C M0N M2O MBDVC P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI Q9U
DOI	10.1007/s00607-017-0558-5
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Research Library (Alumni Edition) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology Collection ProQuest One ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student Research Library Prep SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global (OCUL) Computing Database Proquest Research Library Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central Basic
DatabaseTitle	CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Research Library Prep Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College Research Library (Alumni Edition) ProQuest Pharma Collection ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Research Library ProQuest Central (New) Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Business (Alumni) ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	ABI/INFORM Global (Corporate)
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Mathematics Computer Science
EISSN	1436-5057
EndPage	1145
ExternalDocumentID	10_1007_s00607_017_0558_5
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 28- 29F 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 6TJ 78A 7WY 8AO 8FE 8FG 8FL 8G5 8TC 8UJ 8VB 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFFNX AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BKOMP BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DWQXO EAD EAP EBA EBLON EBR EBS EBU ECS EDO EIOEI EJD EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITG ITH ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV KOW LAS LLZTM M0C M0N M2O M4Y MA- MK~ ML~ N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 Q2X QOK QOS QWB R4E R89 R9I RHV RIG 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 TH9 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7X Z7Z Z81 Z83 Z88 Z8M Z8N Z8R Z8T Z8U Z8W Z92 ZL0 ZMTXR ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFKWF AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D MBDVC PKEHL PQEST PQUKI Q9U
ID	FETCH-LOGICAL-c369t-f31e844f66fd144b6201d260013e7f34eabeda3f24d8deb903ed51e2c38a4e033
IEDL.DBID	7WY
ISICitedReferencesCount	5
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000413026100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0010-485X
IngestDate	Wed Nov 26 13:11:51 EST 2025 Sat Nov 29 03:51:36 EST 2025 Tue Nov 18 20:40:17 EST 2025 Fri Feb 21 02:26:11 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	11
Keywords	Task scheduling Grid computing Heterogeneous grids 68M14
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c369t-f31e844f66fd144b6201d260013e7f34eabeda3f24d8deb903ed51e2c38a4e033
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-3736-425X
PQID	1951541385
PQPubID	48322
PageCount	21
ParticipantIDs	proquest_journals_1951541385 crossref_citationtrail_10_1007_s00607_017_0558_5 crossref_primary_10_1007_s00607_017_0558_5 springer_journals_10_1007_s00607_017_0558_5
PublicationCentury	2000
PublicationDate	2017-11-01
PublicationDateYYYYMMDD	2017-11-01
PublicationDate_xml	– month: 11 year: 2017 text: 2017-11-01 day: 01
PublicationDecade	2010
PublicationPlace	Vienna
PublicationPlace_xml	– name: Vienna – name: Wien
PublicationSubtitle	Archives for Scientific Computing
PublicationTitle	Computing
PublicationTitleAbbrev	Computing
PublicationYear	2017
Publisher	Springer Vienna Springer Nature B.V
Publisher_xml	– name: Springer Vienna – name: Springer Nature B.V
References	Tang, Li, Liao, Li (CR19) 2010; 70 Ilavarasan, Thambidurai (CR16) 2007; 3 Sinnen, To, Kaur (CR22) 2011; 71 Ullman (CR9) 1975; 10 Cao, Jin, Wu, Wu, Shi (CR17) 2010; 51 CR18 CR14 Arabnejad, Barbosa (CR15) 2014; 25 Hagras, Janeček (CR11) 2005; 31 Topcuoglu, Hariri, Wu (CR13) 2002; 13 Baker, Buyya, Laforenza (CR1) 2002; 32 CR2 CR6 CR8 CR7 CR29 CR28 CR26 Sinnen (CR5) 2007 Garey, Johnson (CR10) 1979 CR24 CR23 Hagras, Janeček (CR12) 2003; 43 CR21 Coffman, Bruno (CR4) 1976 Sih, Lee (CR25) 1993; 4 Pinedo (CR3) 2012 Olteanu, Marin (CR27) 2011; 1 Ahmad, Kwok (CR20) 1998; 9 H Topcuoglu (558_CR13) 2002; 13 558_CR23 558_CR21 558_CR26 JD Ullman (558_CR9) 1975; 10 558_CR24 558_CR28 558_CR29 GC Sih (558_CR25) 1993; 4 O Sinnen (558_CR22) 2011; 71 I Ahmad (558_CR20) 1998; 9 X Tang (558_CR19) 2010; 70 H Cao (558_CR17) 2010; 51 558_CR6 O Sinnen (558_CR5) 2007 558_CR7 ML Pinedo (558_CR3) 2012 558_CR8 558_CR2 MR Garey (558_CR10) 1979 EG Coffman (558_CR4) 1976 T Hagras (558_CR11) 2005; 31 558_CR14 A Olteanu (558_CR27) 2011; 1 H Arabnejad (558_CR15) 2014; 25 558_CR18 E Ilavarasan (558_CR16) 2007; 3 M Baker (558_CR1) 2002; 32 T Hagras (558_CR12) 2003; 43
References_xml	– ident: CR18 – volume: 4 start-page: 175 issue: 2 year: 1993 end-page: 187 ident: CR25 article-title: A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures publication-title: IEEE Trans Parallel Distrib Syst doi: 10.1109/71.207593 – year: 2007 ident: CR5 publication-title: Task scheduling for parallel systems doi: 10.1002/0470121173 – volume: 10 start-page: 384 issue: 3 year: 1975 end-page: 393 ident: CR9 article-title: Np-complete scheduling problems publication-title: J Comput Syst Sci doi: 10.1016/S0022-0000(75)80008-0 – ident: CR14 – ident: CR2 – volume: 51 start-page: 201 issue: 2 year: 2010 end-page: 223 ident: CR17 article-title: Dagmap: efficient and dependable scheduling of dag workflow job in grid publication-title: J Supercomput doi: 10.1007/s11227-009-0284-7 – volume: 1 start-page: 57 issue: 1 year: 2011 end-page: 66 ident: CR27 article-title: Generation and evaluation of scheduling dags: how to provide similar evaluation conditions publication-title: Comput Sci Master Res – volume: 32 start-page: 1437 issue: 15 year: 2002 end-page: 1466 ident: CR1 article-title: Grids and grid technologies for wide-area distributed computing publication-title: Softw Pract Exp doi: 10.1002/spe.488 – ident: CR6 – ident: CR29 – ident: CR8 – volume: 25 start-page: 682 issue: 3 year: 2014 end-page: 694 ident: CR15 article-title: List scheduling algorithm for heterogeneous systems by an optimistic cost table publication-title: IEEE Trans Parallel Distrib Syst doi: 10.1109/TPDS.2013.57 – volume: 9 start-page: 872 issue: 9 year: 1998 end-page: 892 ident: CR20 article-title: On exploiting task duplication in parallel program scheduling publication-title: IEEE Trans Parallel Distrib Syst doi: 10.1109/71.722221 – volume: 13 start-page: 260 issue: 3 year: 2002 end-page: 274 ident: CR13 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: CR11 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: CR23 – volume: 70 start-page: 323 issue: 4 year: 2010 end-page: 329 ident: CR19 article-title: List scheduling with duplication for heterogeneous computing systems publication-title: J Parallel Distrib Comput doi: 10.1016/j.jpdc.2010.01.003 – ident: CR21 – volume: 71 start-page: 77 issue: 1 year: 2011 end-page: 86 ident: CR22 article-title: Contention-aware scheduling with task duplication publication-title: J Parallel Distrib Comput doi: 10.1016/j.jpdc.2010.10.004 – year: 2012 ident: CR3 publication-title: Scheduling: theory, algorithms, and systems doi: 10.1007/978-1-4614-2361-4 – volume: 3 start-page: 94 issue: 2 year: 2007 end-page: 103 ident: CR16 article-title: Low complexity performance effective task scheduling algorithm for heterogeneous computing environments publication-title: J Comput Sci doi: 10.3844/jcssp.2007.94.103 – volume: 43 start-page: 16 issue: 6 year: 2003 end-page: 21 ident: CR12 article-title: Static vs. dynamic list-scheduling performance comparison publication-title: Acta Polytech – year: 1979 ident: CR10 publication-title: Computers and intractability: a guide to the theory of np-completeness – ident: CR7 – year: 1976 ident: CR4 publication-title: Computer and job-shop scheduling theory – ident: CR28 – ident: CR26 – ident: CR24 – ident: 558_CR7 doi: 10.1007/978-0-387-09457-1_7 – volume-title: Scheduling: theory, algorithms, and systems year: 2012 ident: 558_CR3 doi: 10.1007/978-1-4614-2361-4 – volume: 3 start-page: 94 issue: 2 year: 2007 ident: 558_CR16 publication-title: J Comput Sci doi: 10.3844/jcssp.2007.94.103 – volume: 43 start-page: 16 issue: 6 year: 2003 ident: 558_CR12 publication-title: Acta Polytech doi: 10.14311/490 – ident: 558_CR21 doi: 10.1109/ICPP.1994.37 – ident: 558_CR26 doi: 10.1109/ICPP.1994.46 – volume: 9 start-page: 872 issue: 9 year: 1998 ident: 558_CR20 publication-title: IEEE Trans Parallel Distrib Syst doi: 10.1109/71.722221 – ident: 558_CR23 doi: 10.1109/IPDPS.2006.1639389 – ident: 558_CR28 – volume: 25 start-page: 682 issue: 3 year: 2014 ident: 558_CR15 publication-title: IEEE Trans Parallel Distrib Syst doi: 10.1109/TPDS.2013.57 – ident: 558_CR24 doi: 10.1007/11557654_26 – ident: 558_CR6 doi: 10.1109/ISPAN.1996.508983 – ident: 558_CR8 doi: 10.1109/HCW.1999.765093 – volume: 31 start-page: 653 issue: 7 year: 2005 ident: 558_CR11 publication-title: Parallel Comput doi: 10.1016/j.parco.2005.04.002 – volume: 1 start-page: 57 issue: 1 year: 2011 ident: 558_CR27 publication-title: Comput Sci Master Res – ident: 558_CR2 – volume: 32 start-page: 1437 issue: 15 year: 2002 ident: 558_CR1 publication-title: Softw Pract Exp doi: 10.1002/spe.488 – volume: 71 start-page: 77 issue: 1 year: 2011 ident: 558_CR22 publication-title: J Parallel Distrib Comput doi: 10.1016/j.jpdc.2010.10.004 – volume-title: Task scheduling for parallel systems year: 2007 ident: 558_CR5 doi: 10.1002/0470121173 – volume-title: Computer and job-shop scheduling theory year: 1976 ident: 558_CR4 – volume-title: Computers and intractability: a guide to the theory of np-completeness year: 1979 ident: 558_CR10 – ident: 558_CR14 doi: 10.1109/PDP.2010.56 – volume: 4 start-page: 175 issue: 2 year: 1993 ident: 558_CR25 publication-title: IEEE Trans Parallel Distrib Syst doi: 10.1109/71.207593 – volume: 51 start-page: 201 issue: 2 year: 2010 ident: 558_CR17 publication-title: J Supercomput doi: 10.1007/s11227-009-0284-7 – volume: 13 start-page: 260 issue: 3 year: 2002 ident: 558_CR13 publication-title: IEEE Trans Parallel Distrib Syst doi: 10.1109/71.993206 – volume: 70 start-page: 323 issue: 4 year: 2010 ident: 558_CR19 publication-title: J Parallel Distrib Comput doi: 10.1016/j.jpdc.2010.01.003 – ident: 558_CR18 doi: 10.1007/978-90-481-9965-5_10 – ident: 558_CR29 – volume: 10 start-page: 384 issue: 3 year: 1975 ident: 558_CR9 publication-title: J Comput Syst Sci doi: 10.1016/S0022-0000(75)80008-0
SSID	ssj0002389
Score	2.1464362
Snippet	The problem of best schedule of dependent-tasks application into nodes of computational grid in low complexity is the most important issue to obtain high...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1125
SubjectTerms	Algorithms Artificial Intelligence Computer Appl. in Administrative Data Processing Computer Communication Networks Computer Science Computer simulation Heuristic Information Systems Applications (incl.Internet) Reproduction (copying) Scheduling Scheduling algorithms Software Engineering Task complexity Task scheduling
SummonAdditionalLinks	– databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NS8MwFA86PejB6VScTsnBkxJom6RNjyIOkTkEP9itJE2yDWcrbSf--SZdWz9QQQ895YPyXpL3e7z3fg-AY49LYWnKkWLaR8QABMSZo5EfMqYl06EXl5T5g2A4ZKNReFPVced1tnsdkixf6qbYzVKH2DRJ81HKEF0GK9SSzVgX_faheX6NDVpgXvPAEEZHdSjzuy0-G6N3hPklKFramn77X3-5CTYqaAnPFmdhCyyppAPaddsGWN3iDli_bqha821wNbB90pCw7ZVgmWCuXg0yh3w2TrNpMXmCBtbCgueP0DjCxjDZ-nWYJnBiE2lSc_5UOs_hOJvKHXDfv7g7v0RVgwUUYz8skMauYoRo39fSOFbCN2hAWsZ6F6tAY6K4UJJj7RHJpBKhg5WkrjLqY5woB-Nd0ErSRO0BKMNQEk40jgkjinIRxtLTmAsiA18EogucWtJRXLGP2yYYs6jhTS4lFxnJRVZyEe2Ck2bJ84J647fJvVp9UXUL88g18JEaK83M8Gmtrg_DP222_6fZB2DNs_ouCxR7oFVkc3UIVuOXYppnR-XhfAN0P97S priority: 102 providerName: Springer Nature
Title	Lower-bound complexity algorithm for task scheduling on heterogeneous grid
URI	https://link.springer.com/article/10.1007/s00607-017-0558-5 https://www.proquest.com/docview/1951541385
Volume	99
WOSCitedRecordID	wos000413026100005&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: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1436-5057 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0002389 issn: 0010-485X databaseCode: 7WY dateStart: 20020201 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global (OCUL) customDbUrl: eissn: 1436-5057 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0002389 issn: 0010-485X databaseCode: M0C dateStart: 20020201 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1436-5057 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0002389 issn: 0010-485X databaseCode: P5Z dateStart: 20020201 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1436-5057 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0002389 issn: 0010-485X databaseCode: K7- dateStart: 20020201 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1436-5057 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0002389 issn: 0010-485X databaseCode: BENPR dateStart: 20020201 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Research Library customDbUrl: eissn: 1436-5057 dateEnd: 20171231 omitProxy: false ssIdentifier: ssj0002389 issn: 0010-485X databaseCode: M2O dateStart: 20020201 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1436-5057 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002389 issn: 0010-485X 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/eLvHCXMwpV1LT9wwEB6Vx4EeSqFFbAvIB05FVrOxnTgnBAiEWtiueHXbS2THNqDCBjah4ucz9iYLrQQXDhkpSuJEmfHMZ3s8H8B6rIz2ZcqplS6hHAECVTJyNMmkdEa6LC5CyfyDtNeTg0HWbybcqiatsvWJwVGbsvBz5F-7CAUEelwpNm9uqWeN8qurDYXGFMxgoBaewSD9-WviiTEcjeEv-houxaBd1YxCEdEkJF3iIYSk4t-49Ag2_1sfDWFnb_61H_we3jWAk2yNLWQB3tjhIsy3ZA6k6duL8PZwUsC1-gDfDjx7GtWedImEtHN7j3idqKtzfEd9cU0Q7JJaVX8IDo8xXPld7aQckgufXlOiVdryriLno0vzEU73dk929mlDu0ALlmQ1daxrJecuSZzB4ZZOECMYX8e-y2zqGLdKW6OYi7mRxuosYtaIrkWlSsVtxNgSTA_LoV0GYrLMcMUdK7jkViidFSZ2TGlu0kSnugNR-9PzoqlJ7qkxrvJJNeWgpxz1lHs95aIDXyaP3IwLcrx080qrm7zpm1X-qJgObLTafXL5ucY-vdzYZ5iLvTmFfYorMF2P7uwqzBZ_68tqtBYMcw1mtnd7_SM8-55SlIfRjpfxD5R98Rvl0fHZA4aA7-g
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwEB1VpRL0QD8AdWkpPsAFZJGNP-IcEELQqu1uVxyKtLdgx3ZbUTZlk1L4U_xGxt5kS5HaWw8cckpixfGbN2N7_AbgRaqtCTLl1CkvKccAgWqVeCpzpbxVPk_LKJk_zEYjNR7nnxbgd3cWJqRVdpwYidpWZVgjf9PHUEAg4yrx7vw7DVWjwu5qV0JjBouB-3WJU7b67f5HHN-Xabq7c_Rhj7ZVBWjJZN5Qz_pOce6l9BZnE0aiC7RBpr3PXOYZd9o4q5lPuVXWmTxhzoq-w29WmrskLIAi5d_jTMlgUYOMzpkf3d8s3EZu40qMu13UJIqWypjkiZcQiorrfvAquP1nPza6ud2V_-0HrcLDNqAm72cWsAYLbrIOK12xCtJy1zosH84FautHcDAM1eGoCUWlSEyrdz9xPkL02TH2qTn5RjCYJ42uvxKc_qM7Dqf2STUhJyF9qEKrc9VFTY6np_YxfL6T_j2BxUk1cRtAbJ5brrlnJVfcCW3y0qaeacNtJk1mepB0g1yUreZ6KP1xVszVoiMuCsRFEXBRiB68mr9yPhMcue3hrQ4LRcs9dXEFhB687tD01-2bGnt6e2PP4f7e0eGwGO6PBpvwIA1Qjmcyt2CxmV64Z7BU_mhO6-l2NAoCX-4aZH8A3xtGwA
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NT9swGH6FyjSxw9j4EN3Y5sO4DFmksZ04h2naBhWMrqoQSL0FO7YLGjTQhH38tf26vU6TwpDgxoFDTkmsOH78ftivnwfgfaiM9jTl1EoXUY4BAlUycDRKpHRGuiTMKsr8Xtzvy-EwGczB3-YsjC-rbGxiZahNnvk18q0OhgICLa4UW64uixhsdz9dXFKvIOV3Whs5jSlE9u2fX5i-FR_3tnGsN8Kwu3P4dZfWCgM0Y1FSUsc6VnLuosgZzCx0hO7QeMr2DrOxY9wqbY1iLuRGGquTgFkjOha_XypuA78YiuZ_PmaY9LRg_stOf3Aw8wPoDKfBN1o6LsWw2VMNKgrTqCr5xEsIScX_XvE61L21O1s5ve7iY_5dL-B5HWqTz9O58RLm7HgJFhsZC1JbtSV49n1GXVssw7ee142j2stNkarg3v7GTIWosxH2qTw5Jxjmk1IVP0iBgDe-kn9E8jE58YVFOc5Hm18VZDQ5NStw9CD9W4XWOB_bNSAmSQxX3LGMS26F0klmQseU5iaOdKzbEDQDnmY1G7sXBTlLZzzSFUZSxEjqMZKKNnyYvXIxpSK57-H1BhdpbZWK9BoUbdhskHXj9l2Nvbq_sXfwFLGV9vb6-69hIfSorg5rrkOrnFzZN_Ak-1meFpO39QwhcPzQKPsH6SBREg
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=Lower-bound+complexity+algorithm+for+task+scheduling+on+heterogeneous+grid&rft.jtitle=Computing&rft.au=Atef%2C+Asmaa&rft.au=Hagras%2C+Tarek&rft.au=Mahdy%2C+Yousef+B&rft.au=Jane%C4%8Dek%2C+Jan&rft.date=2017-11-01&rft.pub=Springer+Nature+B.V&rft.issn=0010-485X&rft.eissn=1436-5057&rft.volume=99&rft.issue=11&rft.spage=1125&rft_id=info:doi/10.1007%2Fs00607-017-0558-5&rft.externalDBID=HAS_PDF_LINK
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0010-485X&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0010-485X&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0010-485X&client=summon