A Priority-Based Task Scheduling Algorithm in Grid

Grid is proposed to solve large scale and complicated problems, and it is a form of parallel computing on Internet. Task scheduling in grid is one of the most important technologies in grid system, and it is a NP complete problem, which is used to schedule a task on an appropriate grid node. Task sc...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2010 3rd International Symposium on Parallel Architectures, Algorithms and Programming s. 311 - 315
Hlavní autori: Weifeng Sun, Yudan Zhu, Zhiyuan Su, Dong Jiao, Mingchu Li
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.12.2010
Predmet:
DAG
Dynamic scheduling
grid task scheduling
Heuristic algorithms
Program processors
Resource management
Scheduling algorithm
task priority
ISBN:1424494826, 9781424494828
ISSN:2168-3034
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Grid is proposed to solve large scale and complicated problems, and it is a form of parallel computing on Internet. Task scheduling in grid is one of the most important technologies in grid system, and it is a NP complete problem, which is used to schedule a task on an appropriate grid node. Task scheduling algorithms are used to improve the grid performance by minimizing the scheduling length. A priority-based task scheduling algorithm (P-TSA) in grid is proposed in this paper. In this kind of priority-based algorithm, tasks are scheduled according to the priority order firstly. And then assign processors Comparing P-TSA with existed grid scheduling algorithms on scheduling length and resource utilization rates. Simulations are done on examples of DAG, and simulation results shown that the performance of P-TSA is better than other scheduling algorithms such as Min-min and Max-min.
AbstractList Grid is proposed to solve large scale and complicated problems, and it is a form of parallel computing on Internet. Task scheduling in grid is one of the most important technologies in grid system, and it is a NP complete problem, which is used to schedule a task on an appropriate grid node. Task scheduling algorithms are used to improve the grid performance by minimizing the scheduling length. A priority-based task scheduling algorithm (P-TSA) in grid is proposed in this paper. In this kind of priority-based algorithm, tasks are scheduled according to the priority order firstly. And then assign processors Comparing P-TSA with existed grid scheduling algorithms on scheduling length and resource utilization rates. Simulations are done on examples of DAG, and simulation results shown that the performance of P-TSA is better than other scheduling algorithms such as Min-min and Max-min.
Author Mingchu Li
Zhiyuan Su
Yudan Zhu
Weifeng Sun
Dong Jiao
Author_xml – sequence: 1
  surname: Weifeng Sun
  fullname: Weifeng Sun
  email: Wfsun@dlut.edu.cn
  organization: Sch. of Software, Dalian Univ. of Technol., Dalian, China
– sequence: 2
  surname: Yudan Zhu
  fullname: Yudan Zhu
  email: zhu.yudan1205@gmail.com
  organization: Sch. of Software, Dalian Univ. of Technol., Dalian, China
– sequence: 3
  surname: Zhiyuan Su
  fullname: Zhiyuan Su
  email: ssdutsu@qq.com
  organization: Sch. of Software, Dalian Univ. of Technol., Dalian, China
– sequence: 4
  surname: Dong Jiao
  fullname: Dong Jiao
  email: jiaodong0418@yahoo.com.cn
  organization: Sch. of Software, Dalian Univ. of Technol., Dalian, China
– sequence: 5
  surname: Mingchu Li
  fullname: Mingchu Li
  email: mingchul@dlut.edu.cn
  organization: Sch. of Software, Dalian Univ. of Technol., Dalian, China
BookMark eNotjk1PwkAURScREimyc-dm_kDxzWfnLStRNCGxid2T6cwrjEIxLS7495bo6ubmnNzcjE26U0eM3QtYCgH4WJVltZQwVqlvWCa01Bq1k3bCZlJYlytQesqyq4KqKNDcssUwfAKAEg6dhRmTJa_6dOrT-ZI_-YEir_3wxT_CnuLPIXU7Xh52V7w_8tTxdZ_iHZu2_jDQ4j_nrH55rlev-eZ9_bYqN3lCOOcNgnOtbtEEEzyRbiwZ3UbSGKxVoUArvUPZQuNgJEVEbLQBCBEFNajm7OFvNhHR9rtPR99ftqYQRoz_fwFvykZB
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/PAAP.2010.24
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 315
ExternalDocumentID 5715100
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
ID FETCH-LOGICAL-i90t-b9088f4f95c5caee4b6e54fde49c663c7962a892f0b80e547d99b4500cd91eb93
IEDL.DBID RIE
ISBN 1424494826
9781424494828
ISSN 2168-3034
IngestDate Wed Aug 27 03:23:11 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2010937795
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-b9088f4f95c5caee4b6e54fde49c663c7962a892f0b80e547d99b4500cd91eb93
PageCount 5
ParticipantIDs ieee_primary_5715100
PublicationCentury 2000
PublicationDate 2010-Dec.
PublicationDateYYYYMMDD 2010-12-01
PublicationDate_xml – month: 12
  year: 2010
  text: 2010-Dec.
PublicationDecade 2010
PublicationTitle 2010 3rd International Symposium on Parallel Architectures, Algorithms and Programming
PublicationTitleAbbrev paap
PublicationYear 2010
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0003189860
ssj0000527807
Score 1.5058234
Snippet Grid is proposed to solve large scale and complicated problems, and it is a form of parallel computing on Internet. Task scheduling in grid is one of the most...
SourceID ieee
SourceType Publisher
StartPage 311
SubjectTerms DAG
Dynamic scheduling
grid task scheduling
Heuristic algorithms
Program processors
Resource management
Scheduling algorithm
task priority
Title A Priority-Based Task Scheduling Algorithm in Grid
URI https://ieeexplore.ieee.org/document/5715100
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELYKYmAq0CLe8sCIwTFO7BsDojBVGTp0q-oXjYAU9cHv55ymgYGFLc7Zku3Y_nzOff4IucZJkLhEeJaZxDEcIZ4ZgMAkQpcIMgnO6VpsQg2HejyGokNuWi6M974OPvO38bH-l-_mdh2PytB5R3zi6KDvKJVtuFrteQpPhdKNKxPTOFZB1yRhkWSa4Uott7wukLin3l731KR1GxQPd0WeF5ugr8iD_yW6UmPOoPu_2h6Q_g95jxYtLB2Sjq-OSHer3kCbydwjIsds5TyK17EHxDJHR9PlG9pniD6RpE7z99donn3QsqLPi9L1yWjwNHp8YY2CAiuBr7DXcQ0JMkBqUzv1XprMpzI4L8HiTsMqyMRUgwjcaI4W5QCMTDm3DhJv4P6Y7Fbzyp8Qqhy6UpjFaOVliMWclNyBTUEba7JT0os9MPnc3JExaRp_9vfrc7Iv2rCQC7K7Wqz9JdmzX6tyubiqP-w3782bHg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELaqggRTgRbxJgMjBsc4iW8MiFJEqTpk6FbVL4iAFPXB7-ecpoGBhS3O2ZLt2P58zn3-CLnASRCakFsaq9BQHCGWKgBHBUIXdyJ0xshSbCIZDORoBMMGuay5MNbaMvjMXvnH8l--meqlPypD5x3xiaGDvuGVsyq2Vn2iwiKeyMqZ8WkcrSBLmjAPY0lxrRZrZhcI3FWvL3yq0rIOi4frYZoOV2Ffngn_S3alRJ1u63_13SGdH_peMKyBaZc0bLFHWmv9hqCazm3CU8yWT718Hb1FNDNBNpm_of0V8cfT1IP0_cWbXz-CvAgeZrnpkKx7n931aKWhQHNgC-x3XEWccBDpSE-sFSq2kXDGCtC419AJxHwigTumJENLYgCUiBjTBkKr4GafNItpYQ9IkBh0pjCLkokVzhczQjADOgKptIoPSdv3wPhzdUvGuGr80d-vz8lWL3vuj_uPg6djss3rIJET0lzMlvaUbOqvRT6fnZUf-Rs_kJ5n
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%3Abook&rft.genre=proceeding&rft.title=2010+3rd+International+Symposium+on+Parallel+Architectures%2C+Algorithms+and+Programming&rft.atitle=A+Priority-Based+Task+Scheduling+Algorithm+in+Grid&rft.au=Weifeng+Sun&rft.au=Yudan+Zhu&rft.au=Zhiyuan+Su&rft.au=Dong+Jiao&rft.date=2010-12-01&rft.pub=IEEE&rft.isbn=9781424494828&rft.issn=2168-3034&rft.spage=311&rft.epage=315&rft_id=info:doi/10.1109%2FPAAP.2010.24&rft.externalDocID=5715100
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2168-3034&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2168-3034&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2168-3034&client=summon