{"title":"A memory-based task scheduling algorithm for grid computing based on heterogeneous platform and homogeneous tasks","authors":"Kunhao Tang, Wei Jiang, Ruonan Cui, Youlong Wu","doi":"10.1504/ijwgs.2020.10031649","DOIUrl":null,"url":null,"abstract":"Grid computing is a new computing mode in recent years, which focuses on parallel infrastructure and its comprehensive application ability to network computers and distributed processors. Grid computing has been fully applied in the field of modern information technology and computer. Task scheduling is the core of grid computing. The quality of task scheduling algorithm directly affects the response time of the whole computing system. For heterogeneous tasks on heterogeneous platforms, this paper proposes a task scheduling algorithm with memory function, and introduces the distributed particle swarm optimisation algorithm into this algorithm, which realises the combination of resource processing tasks in grid computing and the behaviour characteristics of intelligent groups, so as to better realise the dynamic and scalable scheduling of heterogeneous tasks on heterogeneous platforms to adapt to grid environment sex. Finally, the grid simulation software GridSim is used to simulate the algorithm proposed in this paper. At the same time, it is compared with the state stochastic scheduling algorithm. Experimental results show that the proposed algorithm has obvious advantages in scheduling quality in grid environment.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"19 1","pages":"287-304"},"PeriodicalIF":1.0000,"publicationDate":"2020-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Web and Grid Services","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1504/ijwgs.2020.10031649","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1
Abstract
Grid computing is a new computing mode in recent years, which focuses on parallel infrastructure and its comprehensive application ability to network computers and distributed processors. Grid computing has been fully applied in the field of modern information technology and computer. Task scheduling is the core of grid computing. The quality of task scheduling algorithm directly affects the response time of the whole computing system. For heterogeneous tasks on heterogeneous platforms, this paper proposes a task scheduling algorithm with memory function, and introduces the distributed particle swarm optimisation algorithm into this algorithm, which realises the combination of resource processing tasks in grid computing and the behaviour characteristics of intelligent groups, so as to better realise the dynamic and scalable scheduling of heterogeneous tasks on heterogeneous platforms to adapt to grid environment sex. Finally, the grid simulation software GridSim is used to simulate the algorithm proposed in this paper. At the same time, it is compared with the state stochastic scheduling algorithm. Experimental results show that the proposed algorithm has obvious advantages in scheduling quality in grid environment.
期刊介绍:
Web services are providing declarative interfaces to services offered by systems on the Internet, including messaging protocols, standard interfaces, directory services, as well as security layers, for efficient/effective business application integration. Grid computing has emerged as a global platform to support organisations for coordinated sharing of distributed data, applications, and processes. It has also started to leverage web services to define standard interfaces for business services. IJWGS addresses web and grid service technology, emphasising issues of architecture, implementation, and standardisation.