Distributed Resource Scheduling Algorithm Based on Hybrid Genetic Algorithm

Author(s):  
Sen Pan ◽  
Junfeng Qiao ◽  
Jing Jiang ◽  
Jin Huang ◽  
Liping Zhang
2011 ◽  
Vol 219-220 ◽  
pp. 591-595 ◽  
Author(s):  
Guang Nian Yang ◽  
Wei Qi ◽  
Jun Zhou

Now, our sewage treatment industry mainly depends on the blower of aeration act as metabolic, absorbed in the toxic substances. Blower resources management is the key issue of sewage treatment. Traditional resource scheduling algorithm exist some defects, for example it can not well meet the quality requirements and can not get the optimal solution. This article gives a new resource scheduling method based on improved genetic algorithm. It achieves grid resource scheduling by using real number encoding and activities point crossover. Experiments show that genetic algorithm can reduce executing time and task completion time, and further improve the scalability of resource scheduling model. This algorithm has stability and high efficiency in grid environment.


2014 ◽  
Vol 513-517 ◽  
pp. 2565-2568
Author(s):  
Yi Fan Yuan ◽  
Jiu Li Wang

With the rapid development of hydropower in China, there are a lot of reservoirs under constructions are put into operation. Therefore, resource scheduling of distributed water conservancy project has become a key focus in current researches. Based on distributed water multi-level resources, the paper put forward to apply the improved genetic algorithm to reservoir resource scheduling. In this way, water level sequence can be the basic genetic algorithm coding scheme, and storage status of reservoir can be stored with the array. Then the genetic algorithm coding can be operated based on the corresponding array index of each reservoir. The paper tries to prove the feasibility of this scheduling policy with some examples, simplifying the process of scheduling algorithm and providing guiding basis for water resource scheduling.


Author(s):  
Poria Pirozmand ◽  
Ali Asghar Rahmani Hosseinabadi ◽  
Maedeh Farrokhzad ◽  
Mehdi Sadeghilalimi ◽  
Seyedsaeid Mirkamali ◽  
...  

AbstractThe cloud computing systems are sorts of shared collateral structure which has been in demand from its inception. In these systems, clients are able to access existing services based on their needs and without knowing where the service is located and how it is delivered, and only pay for the service used. Like other systems, there are challenges in the cloud computing system. Because of a wide array of clients and the variety of services available in this system, it can be said that the issue of scheduling and, of course, energy consumption is essential challenge of this system. Therefore, it should be properly provided to users, which minimizes both the cost of the provider and consumer and the energy consumption, and this requires the use of an optimal scheduling algorithm. In this paper, we present a two-step hybrid method for scheduling tasks aware of energy and time called Genetic Algorithm and Energy-Conscious Scheduling Heuristic based on the Genetic Algorithm. The first step involves prioritizing tasks, and the second step consists of assigning tasks to the processor. We prioritized tasks and generated primary chromosomes, and used the Energy-Conscious Scheduling Heuristic model, which is an energy-conscious model, to assign tasks to the processor. As the simulation results show, these results demonstrate that the proposed algorithm has been able to outperform other methods.


2011 ◽  
Vol 204-210 ◽  
pp. 1594-1598
Author(s):  
Sheng Jun Xue ◽  
Wei Qi

Traditional resource scheduling algorithm, in grid environment, exist some defects, for example it can not well meet the quality requirements and can not get the optimal solution. This article gives a new resource scheduling method based on improved genetic algorithm. It achieves grid resource scheduling by using real number encoding and activities point crossover. Experiments show that genetic algorithm can reduce executing time and task completion time, and further improve the scalability of resource scheduling model. This algorithm has stability and high efficiency in grid environment.


2012 ◽  
Vol 23 (7) ◽  
pp. 1702-1716 ◽  
Author(s):  
Tie-Qing DENG ◽  
Gen-Quan REN ◽  
Ying-Bo LIU

2019 ◽  
Vol 13 (2) ◽  
pp. 159-165
Author(s):  
Manik Sharma ◽  
Gurvinder Singh ◽  
Rajinder Singh

Background: For almost every domain, a tremendous degree of data is accessible in an online and offline mode. Billions of users are daily posting their views or opinions by using different online applications like WhatsApp, Facebook, Twitter, Blogs, Instagram etc. Objective: These reviews are constructive for the progress of the venture, civilization, state and even nation. However, this momentous amount of information is useful only if it is collectively and effectively mined. Methodology: Opinion mining is used to extract the thoughts, expression, emotions, critics, appraisal from the data posted by different persons. It is one of the prevailing research techniques that coalesce and employ the features from natural language processing. Here, an amalgamated approach has been employed to mine online reviews. Results: To improve the results of genetic algorithm based opining mining patent, here, a hybrid genetic algorithm and ontology based 3-tier natural language processing framework named GAO_NLP_OM has been designed. First tier is used for preprocessing and corrosion of the sentences. Middle tier is composed of genetic algorithm based searching module, ontology for English sentences, base words for the review, complete set of English words with item and their features. Genetic algorithm is used to expedite the polarity mining process. The last tier is liable for semantic, discourse and feature summarization. Furthermore, the use of ontology assists in progressing more accurate opinion mining model. Conclusion: GAO_NLP_OM is supposed to improve the performance of genetic algorithm based opinion mining patent. The amalgamation of genetic algorithm, ontology and natural language processing seems to produce fast and more precise results. The proposed framework is able to mine simple as well as compound sentences. However, affirmative preceded interrogative, hidden feature and mixed language sentences still be a challenge for the proposed framework.


Author(s):  
Ge Weiqing ◽  
Cui Yanru

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.


Sign in / Sign up

Export Citation Format

Share Document