File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Process reassignment with reduced migration cost in grid load rebalancing

TitleProcess reassignment with reduced migration cost in grid load rebalancing
Authors
Issue Date2008
Citation
Ipdps Miami 2008 - Proceedings Of The 22Nd Ieee International Parallel And Distributed Processing Symposium, Program And Cd-Rom, 2008 How to Cite?
AbstractWe study the load rebalancing problem in a heterogeneous grid environment that supports process migration. Given an initial assignment of tasks to machines, the problem consists of finding a process reassignment that achieves a desired better level of load balance with minimum reassignment (process migration) cost. Most previous algorithms for related problems aim mainly at improving the balance level (or makespan) with no explicit concern for the reassignment cost. We propose a heuristic which is based on local search and several optimizing techniques which include the guided local search strategy and the multi-level local search. The searching integrates both the change of workload and the migration cost introduced by a process movement into the movement selection, and enables a good tradeoff between low-cost movements and the improving balance level. Evaluations show that the proposed heuristic can find a solution with much lower migration cost for achieving the same balance level than previous greedy or local search algorithms for a range of problem cases. ©2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/151921
ISBN
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChen, Len_US
dc.contributor.authorWang, CLen_US
dc.contributor.authorLau, FCMen_US
dc.date.accessioned2012-06-26T06:30:49Z-
dc.date.available2012-06-26T06:30:49Z-
dc.date.issued2008en_US
dc.identifier.citationIpdps Miami 2008 - Proceedings Of The 22Nd Ieee International Parallel And Distributed Processing Symposium, Program And Cd-Rom, 2008en_US
dc.identifier.isbn978-1-4244-1693-6-
dc.identifier.issn1530-2075-
dc.identifier.urihttp://hdl.handle.net/10722/151921-
dc.description.abstractWe study the load rebalancing problem in a heterogeneous grid environment that supports process migration. Given an initial assignment of tasks to machines, the problem consists of finding a process reassignment that achieves a desired better level of load balance with minimum reassignment (process migration) cost. Most previous algorithms for related problems aim mainly at improving the balance level (or makespan) with no explicit concern for the reassignment cost. We propose a heuristic which is based on local search and several optimizing techniques which include the guided local search strategy and the multi-level local search. The searching integrates both the change of workload and the migration cost introduced by a process movement into the movement selection, and enables a good tradeoff between low-cost movements and the improving balance level. Evaluations show that the proposed heuristic can find a solution with much lower migration cost for achieving the same balance level than previous greedy or local search algorithms for a range of problem cases. ©2008 IEEE.en_US
dc.languageengen_US
dc.relation.ispartofIPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROMen_US
dc.titleProcess reassignment with reduced migration cost in grid load rebalancingen_US
dc.typeConference_Paperen_US
dc.identifier.emailWang, CL:clwang@cs.hku.hken_US
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_US
dc.identifier.authorityWang, CL=rp00183en_US
dc.identifier.authorityLau, FCM=rp00221en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/IPDPS.2008.4536164en_US
dc.identifier.scopuseid_2-s2.0-51049119799en_US
dc.identifier.hkuros149521-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-51049119799&selection=ref&src=s&origin=recordpageen_US
dc.identifier.scopusauthoridChen, L=52763188200en_US
dc.identifier.scopusauthoridWang, CL=7501646188en_US
dc.identifier.scopusauthoridLau, FCM=7102749723en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats