Dynamic Objective and Advance Scheduling in Federated Grids Export

@incollection{citeulike:5764115, abstract = {In this paper we present a dynamic mapping strategy for scheduling independent tasks in Federated Grids. This strategy is performed in two steps: first we calculate a new objective, and then we apply advance scheduling to meet the new objective. The results obtained by simulation show that the combination of these two steps reduces the makespan and increases the throughput. Thus, the mapping strategy proposed meets two of the most common objective functions of tasks scheduling problems: makespan and performance of the resources. The presented algorithm is easy to implement, unlike Genetic Algorithms is fast enough to be used in a realistic scheduling, and is efficient. In addition, the information the strategy needs can be provided by any Grid Information Service, and its does not require the deployment of complex prediction services or service level agreement: it can work in any Grid.}, author = {Leal, Katia and Huedo, Eduardo and Llorente, Ignacio}, citeulike-article-id = {5764115}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-88871-0_50}, citeulike-linkout-1 = {http://www.springerlink.com/content/0252g74087q86827}, doi = {10.1007/978-3-540-88871-0_50}, journal = {On the Move to Meaningful Internet Systems: OTM 2008}, keywords = {grids}, pages = {711--725}, posted-at = {2009-09-09 23:44:50}, priority = {2}, title = {Dynamic Objective and Advance Scheduling in Federated Grids}, url = {http://dx.doi.org/10.1007/978-3-540-88871-0_50}, year = {2008} }

TY - CHAP ID - citeulike:5764115 L3 - citeulike-article-id:5764115 N2 - In this paper we present a dynamic mapping strategy for scheduling independent tasks in Federated Grids. This strategy is performed in two steps: first we calculate a new objective, and then we apply advance scheduling to meet the new objective. The results obtained by simulation show that the combination of these two steps reduces the makespan and increases the throughput. Thus, the mapping strategy proposed meets two of the most common objective functions of tasks scheduling problems: makespan and performance of the resources. The presented algorithm is easy to implement, unlike Genetic Algorithms is fast enough to be used in a realistic scheduling, and is efficient. In addition, the information the strategy needs can be provided by any Grid Information Service, and its does not require the deployment of complex prediction services or service level agreement: it can work in any Grid. JF - On the Move to Meaningful Internet Systems: OTM 2008 EP - 725 TI - Dynamic Objective and Advance Scheduling in Federated Grids SP - 711 KW - grids AU - Leal, Katia AU - Huedo, Eduardo AU - Llorente, Ignacio PY - 2008/// UR - http://dx.doi.org/10.1007/978-3-540-88871-0_50 ER -