{"title":"Job scheduling based on reliability, time and cost constraints under Grid environment","authors":"Lathigara Amit Maheshbhai","doi":"10.1109/NUICONE.2011.6153224","DOIUrl":null,"url":null,"abstract":"The advent of Grid environments made feasible the solution of computational intensive problems in a reliable and cost-effective way. As scheduling carry out more complex and mission-critical applications, Quality of Service (QoS) analysis serves to ensure that each application meets user requirements. In that frame, author presents a novel Ant colony algorithm with a quick convergence of ant to move from source to destination which allows the mapping of job processes to Grid provided services assuring at the same time end-to-end provision of QoS (cost, makespan and reliability) based on user-defined parameters and preferences. Paper also demonstrate the operation of the implemented algorithm using three different heuristics and evaluate its effectiveness using a Grid scenario.","PeriodicalId":206392,"journal":{"name":"2011 Nirma University International Conference on Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Nirma University International Conference on Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NUICONE.2011.6153224","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
The advent of Grid environments made feasible the solution of computational intensive problems in a reliable and cost-effective way. As scheduling carry out more complex and mission-critical applications, Quality of Service (QoS) analysis serves to ensure that each application meets user requirements. In that frame, author presents a novel Ant colony algorithm with a quick convergence of ant to move from source to destination which allows the mapping of job processes to Grid provided services assuring at the same time end-to-end provision of QoS (cost, makespan and reliability) based on user-defined parameters and preferences. Paper also demonstrate the operation of the implemented algorithm using three different heuristics and evaluate its effectiveness using a Grid scenario.
网格环境的出现使得以可靠和经济的方式解决计算密集型问题成为可能。当调度执行的应用程序越来越复杂和任务关键时,QoS (Quality of Service)分析可以确保每个应用程序满足用户需求。在此框架下,作者提出了一种新颖的蚁群算法,该算法具有从源到目标的快速收敛性,允许将作业过程映射到网格提供的服务,同时保证基于用户自定义参数和偏好的端到端QoS(成本,最大跨度和可靠性)的提供。本文还使用三种不同的启发式方法演示了实现算法的操作,并使用网格场景评估了其有效性。