File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling

TitleRisk-resilient heuristics and genetic algorithms for security-assured grid job scheduling
Authors
KeywordsDistributed supercomputing
Genetic algorithm
Grid computing
Job scheduling heuristics
NAS and PSA benchmarks
Performance metrics
Replication scheduling
Risk resilience
Issue Date2006
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tc
Citation
Ieee Transactions On Computers, 2006, v. 55 n. 6, p. 703-719 How to Cite?
AbstractIn scheduling a large number of user jobs for parallel execution on an open-resource Grid system, the jobs are subject to system failures or delays caused by infected hardware, software vulnerability, and distrusted security policy. This paper models the risk and insecure conditions in Grid job scheduling. Three risk-resilient strategies, preemptive, replication, and delay-tolerant, are developed to provide security assurance. We propose six risk-resilient scheduling algorithms to assure secure Grid job execution under different risky conditions. We report the simulated Grid performances of these new Grid job scheduling algorithms under the NAS and PSA workloads. The relative performance is measured by the total job makespan, Grid resource utilization, job failure rate, slowdown ratio, replication overhead, etc. In addition to extending from known scheduling heuristics, we developed a new space-time genetic algorithm (STGA) based on faster searching and protected chromosome formation. Our simulation results suggest that, in a wide-area Grid environment, it is more resilient for the global job scheduler to tolerate some job delays instead of resorting to preemption or replication or taking a risk on unreliable resources allocated. We find that delay-tolerant Min-Min and STGA job scheduling have 13-23 percent higher performance than using risky or preemptive or replicated algorithms. The resource overheads for replicated job scheduling are kept at a low 15 percent. The delayed job execution is optimized with a delay factor, which is 20 percent of the total makespan. A Kiviat graph is proposed for demonstrating the quality of Grid computing services. These risk-resilient job scheduling schemes can upgrade Grid performance significantly at only a moderate increase in extra resources or scheduling delays in a risky Grid computing environment. © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/44772
ISSN
2015 Impact Factor: 1.723
2015 SCImago Journal Rankings: 0.924
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorSong, Sen_HK
dc.contributor.authorHwang, Ken_HK
dc.contributor.authorKwok, YKen_HK
dc.date.accessioned2007-10-30T06:09:54Z-
dc.date.available2007-10-30T06:09:54Z-
dc.date.issued2006en_HK
dc.identifier.citationIeee Transactions On Computers, 2006, v. 55 n. 6, p. 703-719en_HK
dc.identifier.issn0018-9340en_HK
dc.identifier.urihttp://hdl.handle.net/10722/44772-
dc.description.abstractIn scheduling a large number of user jobs for parallel execution on an open-resource Grid system, the jobs are subject to system failures or delays caused by infected hardware, software vulnerability, and distrusted security policy. This paper models the risk and insecure conditions in Grid job scheduling. Three risk-resilient strategies, preemptive, replication, and delay-tolerant, are developed to provide security assurance. We propose six risk-resilient scheduling algorithms to assure secure Grid job execution under different risky conditions. We report the simulated Grid performances of these new Grid job scheduling algorithms under the NAS and PSA workloads. The relative performance is measured by the total job makespan, Grid resource utilization, job failure rate, slowdown ratio, replication overhead, etc. In addition to extending from known scheduling heuristics, we developed a new space-time genetic algorithm (STGA) based on faster searching and protected chromosome formation. Our simulation results suggest that, in a wide-area Grid environment, it is more resilient for the global job scheduler to tolerate some job delays instead of resorting to preemption or replication or taking a risk on unreliable resources allocated. We find that delay-tolerant Min-Min and STGA job scheduling have 13-23 percent higher performance than using risky or preemptive or replicated algorithms. The resource overheads for replicated job scheduling are kept at a low 15 percent. The delayed job execution is optimized with a delay factor, which is 20 percent of the total makespan. A Kiviat graph is proposed for demonstrating the quality of Grid computing services. These risk-resilient job scheduling schemes can upgrade Grid performance significantly at only a moderate increase in extra resources or scheduling delays in a risky Grid computing environment. © 2006 IEEE.en_HK
dc.format.extent4735331 bytes-
dc.format.extent2141 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tcen_HK
dc.relation.ispartofIEEE Transactions on Computersen_HK
dc.rights©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectDistributed supercomputingen_HK
dc.subjectGenetic algorithmen_HK
dc.subjectGrid computingen_HK
dc.subjectJob scheduling heuristicsen_HK
dc.subjectNAS and PSA benchmarksen_HK
dc.subjectPerformance metricsen_HK
dc.subjectReplication schedulingen_HK
dc.subjectRisk resilienceen_HK
dc.titleRisk-resilient heuristics and genetic algorithms for security-assured grid job schedulingen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0018-9340&volume=55&issue=6&spage=703&epage=719&date=2006&atitle=Risk-resilient+heuristics+and+genetic+algorithms+for+security-assured+grid+job+schedulingen_HK
dc.identifier.emailKwok, YK:ykwok@eee.hku.hken_HK
dc.identifier.authorityKwok, YK=rp00128en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/TC.2006.89en_HK
dc.identifier.scopuseid_2-s2.0-33646486528en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33646486528&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume55en_HK
dc.identifier.issue6en_HK
dc.identifier.spage703en_HK
dc.identifier.epage719en_HK
dc.identifier.isiWOS:000236929800005-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridSong, S=8875389000en_HK
dc.identifier.scopusauthoridHwang, K=7402426691en_HK
dc.identifier.scopusauthoridKwok, YK=7101857718en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats