The LGR Method for Task Scheduling in Computational Grid

N. J. Navimipour, L.M. Khanli
{"title":"The LGR Method for Task Scheduling in Computational Grid","authors":"N. J. Navimipour, L.M. Khanli","doi":"10.1109/ICACTE.2008.24","DOIUrl":null,"url":null,"abstract":"In the grid systems, scheduling is a major issue in their operation, which is also an important problem in other area such as manufacturing, process control, economics, operation research and, etc. One motivation of grid computing is to aggregate the power of widely distributed resources, and provi.de non-trivial services to users. To achieve this goal, an efficient grid scheduling system is an essential part of the grid.This paper presents and evaluates a new method for task scheduling in grid computing systems to minimize its execution time. With regard to that this problem is a NP-Hard problem; so the evolutionary algorithms are the best choice for solving this problem. In this paper, contrary to prior ways, the new string representation and crossover operator has been used, communication costs hasn't been ignored and presents as a major factor for reaching to optimum solution.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Advanced Computer Theory and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACTE.2008.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

Abstract

In the grid systems, scheduling is a major issue in their operation, which is also an important problem in other area such as manufacturing, process control, economics, operation research and, etc. One motivation of grid computing is to aggregate the power of widely distributed resources, and provi.de non-trivial services to users. To achieve this goal, an efficient grid scheduling system is an essential part of the grid.This paper presents and evaluates a new method for task scheduling in grid computing systems to minimize its execution time. With regard to that this problem is a NP-Hard problem; so the evolutionary algorithms are the best choice for solving this problem. In this paper, contrary to prior ways, the new string representation and crossover operator has been used, communication costs hasn't been ignored and presents as a major factor for reaching to optimum solution.
计算网格中任务调度的LGR方法
在网格系统中,调度是其运行中的一个重要问题,也是制造、过程控制、经济、运筹学等领域的一个重要问题。网格计算的动机之一是聚集广泛分布的资源的力量,为用户提供重要的服务。为了实现这一目标,一个高效的电网调度系统是电网的重要组成部分。本文提出并评价了一种网格计算系统任务调度的新方法,使其执行时间最小化。关于这个问题是NP-Hard问题;因此,进化算法是解决这一问题的最佳选择。与以往的方法不同,本文采用了新的字符串表示和交叉算子,通信成本并没有被忽略,而是作为达到最优解的主要因素。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信