Study of Grid Task Scheduling Algorithm Based on Benefit Function

In the dynamic, heterogeneous and widely distributed grid environment, task scheduling is a complex and challenging problem. Because in DBC algorithm, QoS requests are static, either based on time optimisation, or budget optimisation, resource allocation in grid is irrational. To solve the problem,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the International Conference on Computer Science and Information Technology : August 29-Sepember 2, 2008, Singapore s. 937 - 941
Hlavní autoři: En-Jie Ding, Shi-Cui Sun
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.08.2008
Témata:
benefit function
Biological system modeling
Computational modeling
grid
Heuristic algorithms
Optimization
Processor scheduling
QoS
Quality of service
Scheduling algorithm
task shceduling
ISBN:0769533086, 9780769533087
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 In the dynamic, heterogeneous and widely distributed grid environment, task scheduling is a complex and challenging problem. Because in DBC algorithm, QoS requests are static, either based on time optimisation, or budget optimisation, resource allocation in grid is irrational. To solve the problem, one QoS model based on benefit function is presented in this paper. Also, two algorithms based on benefit function are given. Using the GridSim simulator, these two new algorithms and DBC algorithm are simulated and compared. The experiment results indicates that the two algorithms can achieve better performance in terms of time utilized, budget spent and gridlets completed. Otherwise, the second algorithm is better than the first one.
AbstractList In the dynamic, heterogeneous and widely distributed grid environment, task scheduling is a complex and challenging problem. Because in DBC algorithm, QoS requests are static, either based on time optimisation, or budget optimisation, resource allocation in grid is irrational. To solve the problem, one QoS model based on benefit function is presented in this paper. Also, two algorithms based on benefit function are given. Using the GridSim simulator, these two new algorithms and DBC algorithm are simulated and compared. The experiment results indicates that the two algorithms can achieve better performance in terms of time utilized, budget spent and gridlets completed. Otherwise, the second algorithm is better than the first one.
Author En-Jie Ding
Shi-Cui Sun
Author_xml – sequence: 1
  surname: En-Jie Ding
  fullname: En-Jie Ding
  organization: China Univ. of Min. & Technol, Beijing
– sequence: 2
  surname: Shi-Cui Sun
  fullname: Shi-Cui Sun
  organization: China Univ. of Min. & Technol, Beijing
BookMark eNotjrtOwzAYRi1BJUjpzMDiF2jwJbbjMY1oiVSJIWGu7Ph3a0gdlMvQt4eqfMuRznD0Jeg-9hEQeqYkpZTo16os66pJGSF5Skl2hxKipBack1wuUHL1muVU0ge0Gscv8jeZS0bFIyrqaXYX3Hu8G4LDjRm_cd2ewM1diEdcdMd-CNPpjDdmBIf7iDcQwYcJb-fYTqGPT2jhTTfC6p9L9Ll9a8r39f5jV5XFfh2oEtOaQausV9IxEMaBspRprq4nrLVCZa6VxEurjOCWUJCZt8K3WghmjZbU8iV6uXUDABx-hnA2w-WQSSYIyfgvlS9LOA
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICCSIT.2008.104
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 Xplore Digital Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore Digital Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 941
ExternalDocumentID 4625004
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IERZE
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i175t-2ec7bf76d2e5ade7b129376215bbb574dc60f6b7a53b01e64fb5fc9552ba961b3
IEDL.DBID RIE
ISBN 0769533086
9780769533087
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000260454800183&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 01:40:58 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2008928161
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-2ec7bf76d2e5ade7b129376215bbb574dc60f6b7a53b01e64fb5fc9552ba961b3
PageCount 5
ParticipantIDs ieee_primary_4625004
PublicationCentury 2000
PublicationDate 2008-Aug.
PublicationDateYYYYMMDD 2008-08-01
PublicationDate_xml – month: 08
  year: 2008
  text: 2008-Aug.
PublicationDecade 2000
PublicationTitle Proceedings of the International Conference on Computer Science and Information Technology : August 29-Sepember 2, 2008, Singapore
PublicationTitleAbbrev ICCSIT
PublicationYear 2008
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000686215
Score 1.4017243
Snippet In the dynamic, heterogeneous and widely distributed grid environment, task scheduling is a complex and challenging problem. Because in DBC algorithm, QoS...
SourceID ieee
SourceType Publisher
StartPage 937
SubjectTerms benefit function
Biological system modeling
Computational modeling
grid
Heuristic algorithms
Optimization
Processor scheduling
QoS
Quality of service
Scheduling algorithm
task shceduling
Title Study of Grid Task Scheduling Algorithm Based on Benefit Function
URI https://ieeexplore.ieee.org/document/4625004
WOSCitedRecordID wos000260454800183&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELVKxcBUoEV8ywMjoXUc2_VIKwpdqkoEqVvlTxoBCUpTfj-2kxYGFrY4Waw75d7Fee8dADcIi1hYS10GFI4SIknEExVHrhk3DlJUrG09bILNZsPFgs9b4HanhTHGBPKZufOX4V--LtTGH5X1E9esB_PPPcZordXanacEqQMi9Zd54EwOaWOws12zxtoHDXh_Oh4_T9OaS4n8lLZfs1UCtEw6_9vUIej9aPTgfIc-R6Bl8mPQ2Q5pgM0723V10xvIwsLCxzLTMBXrN_dw5RDGC9Hh_ftrUWbV6gOOHJ5pWORw5MqfzSo4cZDn09YDL5OHdPwUNXMTosw1A1UUG8WkZVTHhghtmPSYznx0pJSEJVrRgaWSCYLlABmaWEms4oTEUnCKJD4B7bzIzSmA3OKYYC4QoyQRwkplsWacWMxcbSD4DHR9RJaftTXGsgnG-d-3L8BBTbfw_LlL0K7KjbkC--qrytbldcjnN6KjnEE
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELUqQIKpQIv4xgMjoYk_m5FWlFaUqhJB6lbZjk0jIEFpyu_HTtLCwMIWJ4t1p9y7OO-9A-A6wAIJY5jNgMIeoZJ6IVHIs824tpCiUGyqYRN8MunOZuG0AW42WhitdUk-07fusvyXH2dq5Y7KOsQ266X55zYlBPmVWmtzolKKHQJafZuXrMkuqy121mtem_sEftgZ9fvPo6hiUwZuTtuv6SoluAya_9vWPmj_qPTgdIM_B6Ch00PQXI9pgPVb27KV01nIwszAhzyJYSSWb_bhwmKMk6LDu_fXLE-KxQfsWUSLYZbCni2AJingwIKeS1wbvAzuo_7QqycneIltBwoPacWl4SxGmopYc-lQnbvoSCkpJ7FivmGSC4qlH2hGjKRGhZQiKUIWSHwEttIs1ccAhgYjikMRcEaJEEYqg2MeUoO5rQ4Un4CWi8j8szLHmNfBOP379hXYHUZP4_l4NHk8A3sV-cKx6c7BVpGv9AXYUV9Fsswvy9x-A_gLn4g
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=Proceedings+of+the+International+Conference+on+Computer+Science+and+Information+Technology+%3A+August+29-Sepember+2%2C+2008%2C+Singapore&rft.atitle=Study+of+Grid+Task+Scheduling+Algorithm+Based+on+Benefit+Function&rft.au=En-Jie+Ding&rft.au=Shi-Cui+Sun&rft.date=2008-08-01&rft.pub=IEEE&rft.isbn=9780769533087&rft.spage=937&rft.epage=941&rft_id=info:doi/10.1109%2FICCSIT.2008.104&rft.externalDocID=4625004
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769533087/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769533087/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769533087/sc.gif&client=summon&freeimage=true