A Linear Programming Driven Genetic Algorithm for Meta-Scheduling on Utility Grids

Simple item page
dc.creatorGarg, Saurabh
dc.creatorKonugurthi, Pramod
dc.creatorBuyya, Rajkumar
dc.date2009-03-08
dc.date.accessioned2026-07-07T12:50:20Z
dc.date.available2026-07-07T12:50:20Z
dc.descriptionThe user-level brokers in grids consider individual application QoS requirements and minimize their cost without considering demands from other users. This results in contention for resources and sub-optimal schedules. Meta-scheduling in grids aims to address this scheduling problem, which is NP hard due to its combinatorial nature. Thus, many heuristic-based solutions using Genetic Algorithm (GA) have been proposed, apart from traditional algorithms such as Greedy and FCFS. We propose a Linear Programming/Integer Programming model (LP/IP) for scheduling these applications to multiple resources. We also propose a novel algorithm LPGA (Linear programming driven Genetic Algorithm) which combines the capabilities of LP and GA. The aim of this algorithm is to obtain the best metaschedule for utility grids which minimize combined cost of all users in a coordinated manner. Simulation results show that our proposed integrated algorithm offers the best schedule having the minimum processing cost with negligible time overhead.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/0903.1389
dc.identifierhttp://arxiv.org/abs/0903.1389
dc.identifierProceedings of the 16th International Conference on Advanced Computing and Communication (ADCOM 2008, IEEE Press, New York, USA), Dec. 14-17, 2008, Chennai, India
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/222656
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectNeural and Evolutionary Computing
dc.subjectC.2.4
dc.titleA Linear Programming Driven Genetic Algorithm for Meta-Scheduling on Utility Grids
dc.typetext

Files

Collections

arXiv