A hybrid algorithm for grid task scheduling problem
|
|
- Mercy McDaniel
- 5 years ago
- Views:
Transcription
1 A hybrid algorithm for grid task scheduling problem AtenaShahkolaei 1, Hamid Jazayeriy 2 1 Department of computer engineering, Islamic Azad University, Science and Research Ayatollah Amoli branch, Amol, Iran 2 Babol Noshirvani University of Technology, Iran Abstract At the beginning the Grid computing and Grid technologies was used for scientific and technical jobs where computers were distributed geographically, connected through internet, are used in order to invent virtual supercomputers with high computing competency. The goal of inventing such a virtual supercomputer was solving complex scientific problems in less time than before. The goal of task scheduling in Grid systems is decreasing the total completion time of the all tasks with providing a timetable to perform all existing tasks. The problem of task scheduling in grid systems has large solution space and is considered as a kind of NP-Hard problems. In this paper a new method for solving task scheduling in Grid computing system is proposed by combining Genetic Algorithm with Tabu Search Algorithm. The goal of proposed algorithm is to combining the global search abilities of Genetic Algorithm with local search of Tabu Search, and creating a stable algorithm that highly guarantees the accessing of the global optima. The proposed algorithm is compared with other heuristic algorithms and experimental results showed that the proposed algorithm has high efficiency for solving task scheduling in Grid computing. Keywords:Computational Grids,ETC Matrix, Genetic Algorithm, Tabu Search. 1. INTRODUCTION Grid computing and its technologiescreates at first for technical and scientific activities in computers where geographicallydistributed, connected through internet, and used to createvirtual supercomputers with high computing abilities. The purpose of creating these virtual supercomputers is solving complex scientific problems in less time than before. Afterwards, Grid Computing was applied for helping and reaching improvements in meteorology, physics, medicine and other computing-intensive scientific fields. Examples of such works in large scale including optimization and data-intensive computing are studied in [1] [7]. The current definition of Grid was introduced for first time by [8] in 1998 as following: "A computational grid is a hardware and software infrastructure that provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities." Task scheduling in Grid Computing contains a set of tasks that should be run on a limited set of resources. The purpose of task scheduling in Grid systems is offering a time table for executing all tasks and decreasing the execution time of all tasks. The problem of task scheduling in grid systems has large solution space and is considered as a kind of NP-Hard problems [9], [10].In the past few years, many researches were performed for solving Grid Task Scheduling problems based on GA [11] [14] and TS [11], [16] [18].A hybrid GA (TS) algorithm for the problem of independent scheduling in computational grids presented in [15]. In their proposed algorithm the hybridization follows a low level approach in which GA is the main flow and TS is subordinated to it. The experimental evaluation showed that GA (TS) outperforms both GA and TS for small and medium size grid scenarios but achieves worse value for large size scenario. In this paper, the proposed algorithm utilize GA and TS together to maintain the global search abilities of Genetic Algorithm and local search of Tabu Search. In GA(TS) algorithm [15] the TS algorithm used instead of mutation operation, but in this paper, in the proposed algorithm the TS algorithm execute separately after Crossover and Mutation operations, to optimize some percent of individuals in GA population. 2. GRID TASK SCHEDULING The Grid Task Scheduling is including of a set of tasks that should run on limited set of resources. The purpose of task scheduling in Grid systems is offering a time tablefor executing all tasks, so that the execution time of all tasks minimized and the computational load of all system divided between all resources equally. For simulating grid environment, a static environment used that contained at mmatrix called ETC (expected time to compute); the model offered by [11] is used. Any row in ETC matrix shows the estimated execution times for a given task on each machine. Thus, for an arbitrary taskt i and an arbitrary machine m j the entryetc(t i,m j )is the estimated execution time of running task i on machine j. In simulated model, the purpose of heuristic algorithm is minimizing the metatask execution time that is called themakespan. Consider that the earliest time machine can complete the execution of all the tasks that have previously been assigned to it, called Machine availability time. Thus, the completion time for a new task on machine will define by relation (1): Volume 2, Issue 10, October 2013 Page 343
2 ct( ti, m j ) mat( m j ) ETC( ti m j ) (1) Where matis machine availability time for machinem j andctis the completion time for taskt i on machinem j. With having the amount of for each task, the metatask execution time (makespan) will calculate by relations (2). t m makespan max ct ( t i m j ) (2) i 0 j 0 3. PROPOSED ALGORITHM In this paper a new method for solving task scheduling in Grid computing system is proposed by combining Genetic Algorithm with Tabu Search Algorithm that will describe in this section. For displaying chromosomes a 1 t vector is used[15], where t is equal by the number of all available tasks for processing. Each chromosome in the proposed algorithm shows apossible mappingfor all tasks of users. In the proposed algorithm parents are selected using therankingmethod, and the chosen operator for generating new children is single point crossover. After generating new children the mutation operator is used for making diversity in children population. Swap and Transfer are two types of methods that selected for mutation. The main purpose of these mutations is changing tasks between different machines to process the tasks with more suitable machines. In Population Optimizations step, some percentages of available chromosomes optimized by Tabu Search algorithm and added to the genetic population as new children. Tabu Search algorithm receive one genetic chromosome as base solution, and try to optimize the chromosome with its operators in some iterations. In the proposed Tabu Search algorithm, at first a solution will create in neighborhood of current solution. Then, the index of tasks that has a role in generating the new neighbor will locate in the tabu list, to forbidden these tasks to participate in generating new neighbors. In following, if the generated neighbor be better than the best solution produced so far, the generated neighbor will select as the best solution and the structures of memory will updated. This cycle of generating neighborhood will repeat in numbers that was determined before, and finally the Tabu Search algorithm will return its best solution to Genetic Algorithm. The proposed algorithm get terminated if no improvement observed in chromosomes in a predefine number of generation. Figure 1 shows the flowchart of the proposed algorithm. Figure1: Flowchart of the proposed algorithm 4. EXPERIMENTAL RESULTS To evaluate the performance of the proposed algorithm, it is compared with other heuristic algorithms in [11]. The proposed algorithm was implemented in C# 2010 and the tests were made on a Pentium IV 3.00GHz processor with 1.00 GB of RAM.For testing the proposed algorithm in simulated environment, 9 test data set based on different type of ETC matrices are designed, each of them consisting of 100 instances. They are labeled as Test_X_YZ_N where X is the type of ETC matrices(c - consistent, I inconsistent and p means partially consistent), Y and Z indicate the task and machine heterogeneity. Their value could be H for maximum heterogeneity and L for the minimum heterogeneity. N is used to number the corresponding test. For example, if a test labeled as Test_C_HH_10, it means that, in this test a consistent matrices is used with maximum heterogeneity for tasks and machines.in test of the proposed algorithm, all test data sets are composed from 512 jobs and 16 machines. Various GA and TS options used are: Population size = 100 Crossover probability = 0.75 Volume 2, Issue 10, October 2013 Page 344
3 Mutation probability = 0.25 Tabu Search neighborhood size = 20 tabu_tenure = 5 The proposed algorithm for any test performed 100 times and the average of fitness values is calculated by the proposed algorithm. Figure 2 shows the output of Test_C_HH_1 in Gant chart. This Chart is consisting of 16 rows and 512 colorful rectangles that any one of them is showing one of the 16 machines and 512 works in the simulated system. Figure2: Gant chart of Test_C_HH_1 In Figure 3 the chart of movements of best chromosome in genetic population is shown,that represents high speed of algorithm in achieving to optimal solution. In this chart tilt of curve will decrease during the time, and finally it s stopped in local optima. Figure3: Fitness of the best chromosome in Genetic Population Table1 shows the result of several tests that obtained to optimal solutions. In Table 1, the first column presents test name, and other results such as the best iteration that optimal solution obtained, the total running time for the proposed algorithm, the time that optimal solution obtained, and fitness of the optimal solution are presented in other columns respectively. Table 1: The result of some tests Test Data Best Iteration Run Time Best time Best fitness Test_C_HH_ Test_I_HH_ Volume 2, Issue 10, October 2013 Page 345
4 Test_P_HH_ Figure 4 shows the chart of average running time for the proposed algorithm and other heuristic algorithms [11]. In Figure 4 the average running time of proposed algorithm shown with red color. Figure4: Average run time of the proposed and other heuristic algorithms Figure 5 shows the comparison of makespan obtained by the proposed algorithm and other heuristic algorithms [11]. As you can see in Figure 5 the proposed algorithm obtained better optimal solution in comparison with other heuristic algorithms. Figure5: Comparison of makespan versus other algorithms in the literature 5. CONCLUSION In this paper a new method for solving task scheduling in Grid computing system is proposed by combining Genetic Algorithm with Tabu Search Algorithm. The goal of proposed algorithm is to minimizing the execution time of all tasks and dividing the computational load of the whole system between all resources equally. To evaluate the performance of the proposed algorithm, it is compared with other heuristic algorithms, and experimental results showed that the proposed algorithm has high performance for solving task scheduling in Grid computing. For future works, the effect of selecting other type of operations and parameters on the quality of solving problem in proposed algorithm could be examine. References [1] H. Casanova, and J. Dongarra, Applying NetSolve's network-enabled server, Computational Science &Engineering, Vol. 5, No. 3, pp , [2] J. P. Goux, S. Kulkarni, J. Linderoth, and M. Yoder, An enabling framework for master-worker applications on the computational grid, In Proceedings Ninth IEEE International Symposium on High-Performance Distributed Computing, pp , [3] S. J. Wright, Solving optimization problems on computational grids, Optima, 65(ANL/MCS/JA-38869), [4] J.Linderoth, and S.Wright, Decomposition algorithms for stochastic programming on a computational grid, Computational Optimization and Applications, Vol. 24,No. 2-3, pp , [5] H. B.Newman, M. H.Ellisman, and J. A.Orcutt, Data-intensive e-science frontier research, Communications of the ACM, Vol. 46, No. 11, pp ,2003. Volume 2, Issue 10, October 2013 Page 346
5 [6] F. Xhafa, C. Paniagua, L. Barolli, and S. Caballe, A parallel grid-based implementation for real-time processing of event log data of collaborative applications, International Journal of Web and Grid Services, Vol. 6, No. 2, pp , [7] M. D. Beynon, A. Sussman, U. Catalyurek, T. Kurc, and J. Saltz, Performance optimization for data intensive grid applications, In Proceedings Third IEEE Annual International Workshop on Active Middleware Services, pp , [8] I. Foster, C. Kesselman (Eds.), The Grid: Blueprint for a Future ComputingInfrastructure, Morgan Kaufmann, San Francisco, USA, [9] D. Fernández-Baca, Allocating modules to processors in a distributed system, In Proceedings of the IEEE Transactions on Software Engineering, Vol. 15, No. 11, pp , [10] O. H.Ibarra, and C. E.Kim, Heuristic algorithms for scheduling independent tasks on nonidentical processors, Journal of the ACM (JACM), Vol. 24, No. 2, pp , [11] T. D.Braun, H. J.Siegel,N.Beck, L. L.Bölöni, M.Maheswaran, A. I.Reuther, and R. F.Freund, A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems, Journal of Parallel and Distributed computing, Vol. 61, No. 6, pp , [12] J.Carretero, F.Xhafa, and A.Abraham, Genetic algorithm based schedulers for grid computing systems, International Journal of Innovative Computing, Information and Control, Vol. 3, No. 6, pp. 1-19, [13] Y. Jia-bin, L.Jiao-min, and S. Zhen-yu, Strategy for tasks scheduling in grid combined neighborhood search with improved adaptive genetic algorithm based on local convergence criterion, In Proceedings of IEEE International Conference on Computer Science and Software Engineering, Vol. 3, pp. 9-13, [14] X. Zhang, and W. Zeng, Grid Workflow Scheduling based on improved genetic algorithm, In Proceedings IEEE International Conference on Computer Design and Applications (ICCDA), Vol. 5, pp , [15] Z.Pooranian, M.Shojafar, R.Tavoli,M.Singhal, and A.Abraham, A Hybrid Meta-Heuristic Algorithm for Job Scheduling on Computational Grids, Inform J,Vol. 37, No. 2, pp , [16] R.Subrata, A. Y.Zomaya, and B.Landfeldt, Artificial life techniques for load balancing in computational grids, Journal of Computer and System Sciences, Vol. 73,No. 8, pp ,2007. [17] SH. Benedict,V. Vasudevan, Improving scheduling of scientific workflows using tabu search for computational grids, Inf Technol J, Vol. 7, No. 1, pp , [18] F.Xhafa, and A. Abraham, Computational models and heuristic methods for Grid scheduling problems, Future generation computer systems, Vol. 26, No. 4, pp , AUTHOR AtenaShahkolaei received her B.S. in IT Engineering from University of Ghaemshahr, Iran and received her M.S. degree in Software Engineering from Science and Research University of Amol, Iran. She is a reader in Grid Computing, Cloud Computing and she has done a lot of researches about Grid Computing in recent years. Hamid Jazayeriy is a lecturer at the faculty of electrical and computer engineering, NIT, IRAN. He received his B.Sc. of computer engineering from university of Tehran in 1996 and his master of software engineering from university of Isfahan in In 2011, he received his Ph.D. from university Putra Malaysia, UPM. He is a reader in multi-agent systems, swarm intelligence and graph theory. Volume 2, Issue 10, October 2013 Page 347
LOW AND HIGH LEVEL HYBRIDIZATION OF ANT COLONY SYSTEM AND GENETIC ALGORITHM FOR JOB SCHEDULING IN GRID COMPUTING
LOW AND HIGH LEVEL HYBRIDIZATION OF ANT COLONY SYSTEM AND GENETIC ALGORITHM FOR JOB SCHEDULING IN GRID COMPUTING Mustafa Muwafak Alobaedy 1, and Ku Ruhana Ku-Mahamud 2 2 Universiti Utara Malaysia), Malaysia,
More informationSimple Scheduling Algorithm with Load Balancing for Grid Computing
Simple Scheduling Algorithm with Load Balancing for Grid Computing Fahd Alharbi College of Engineering King Abdulaziz University Rabigh, KSA E-mail: fahdalharbi@kau.edu.sa Grid computing provides the means
More informationGenetic algorithm based on number of children and height task for multiprocessor task Scheduling
Genetic algorithm based on number of children and height task for multiprocessor task Scheduling Marjan Abdeyazdan 1,Vahid Arjmand 2,Amir masoud Rahmani 3, Hamid Raeis ghanavati 4 1 Department of Computer
More informationQoS Guided Min-Mean Task Scheduling Algorithm for Scheduling Dr.G.K.Kamalam
International Journal of Computer Communication and Information System(IJJCCIS) Vol 7. No.1 215 Pp. 1-7 gopalax Journals, Singapore available at : www.ijcns.com ISSN: 976 1349 ---------------------------------------------------------------------------------------------------------------------
More informationA Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen 2, b
International Conference on Information Technology and Management Innovation (ICITMI 2015) A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen
More informationScheduling Meta-tasks in Distributed Heterogeneous Computing Systems: A Meta-Heuristic Particle Swarm Optimization Approach
Scheduling Meta-tasks in Distributed Heterogeneous Computing Systems: A Meta-Heuristic Particle Swarm Optimization Approach Hesam Izakian¹, Ajith Abraham², Václav Snášel³ ¹Department of Computer Engineering,
More informationThe Study of Genetic Algorithm-based Task Scheduling for Cloud Computing
The Study of Genetic Algorithm-based Task Scheduling for Cloud Computing Sung Ho Jang, Tae Young Kim, Jae Kwon Kim and Jong Sik Lee School of Information Engineering Inha University #253, YongHyun-Dong,
More informationA Rank-based Hybrid Algorithm for Scheduling Dataand Computation-intensive Jobs in Grid Environments
A Rank-based Hybrid Algorithm for Scheduling Dataand Computation-intensive Jobs in Grid Environments Mohsen Abdoli, Reza Entezari-Maleki, and Ali Movaghar Department of Computer Engineering, Sharif University
More informationHybridization of Genetic Algorithm and Linear Programming for Solving Cell Formation Problem with Alternative Process Routings
, October 24-26, 2012, San Francisco, USA Hybridization of Genetic Algorithm and Linear Programming for Solving Cell Formation Problem with Alternative Process Routings Shahrooz Shahparvari, Payam Chiniforooshan
More informationNew Optimal Load Allocation for Scheduling Divisible Data Grid Applications
New Optimal Load Allocation for Scheduling Divisible Data Grid Applications M. Othman, M. Abdullah, H. Ibrahim, and S. Subramaniam Department of Communication Technology and Network, University Putra Malaysia,
More informationResearch Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding
e Scientific World Journal, Article ID 746260, 8 pages http://dx.doi.org/10.1155/2014/746260 Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding Ming-Yi
More informationCombinatorial Double Auction Winner Determination in Cloud Computing using Hybrid Genetic and Simulated Annealing Algorithm
Combinatorial Double Auction Winner Determination in Cloud Computing using Hybrid Genetic and Simulated Annealing Algorithm Ali Sadigh Yengi Kand, Ali Asghar Pourhai Kazem Department of Computer Engineering,
More informationResource discovery in Grid computing using Fuzzy Logic and Tabu Table
IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.9, September 2016 61 Resource discovery in Grid computing using Fuzzy Logic and Tabu Table Afsaneh Zargar Nasrollahi and
More informationA Genetic Algorithm for Multiprocessor Task Scheduling
A Genetic Algorithm for Multiprocessor Task Scheduling Tashniba Kaiser, Olawale Jegede, Ken Ferens, Douglas Buchanan Dept. of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB,
More informationModified K-Means Algorithm for Genetic Clustering
24 Modified K-Means Algorithm for Genetic Clustering Mohammad Babrdel Bonab Islamic Azad University Bonab Branch, Iran Summary The K-Means Clustering Approach is one of main algorithms in the literature
More informationSolving the Graph Bisection Problem with Imperialist Competitive Algorithm
2 International Conference on System Engineering and Modeling (ICSEM 2) IPCSIT vol. 34 (2) (2) IACSIT Press, Singapore Solving the Graph Bisection Problem with Imperialist Competitive Algorithm Hodais
More informationOpen Vehicle Routing Problem Optimization under Realistic Assumptions
Int. J. Research in Industrial Engineering, pp. 46-55 Volume 3, Number 2, 204 International Journal of Research in Industrial Engineering www.nvlscience.com Open Vehicle Routing Problem Optimization under
More informationMeta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
More informationFAULT-TOLERANCE AWARE MULTI OBJECTIVE SCHEDULING ALGORITHM FOR TASK SCHEDULING IN COMPUTATIONAL GRID
FAULT-TOLERANCE AWARE MULTI OBJECTIVE SCHEDULING ALGORITHM FOR TASK SCHEDULING IN COMPUTATIONAL GRID Dinesh Prasad Sahu 1, Karan Singh 2 and Shiv Prakash 3 1,2 School of Computer and Systems Sciences,
More informationScalable Computing: Practice and Experience Volume 8, Number 3, pp
Scalable Computing: Practice and Experience Volume 8, Number 3, pp. 301 311. http://www.scpe.org ISSN 1895-1767 c 2007 SWPS SENSITIVITY ANALYSIS OF WORKFLOW SCHEDULING ON GRID SYSTEMS MARíA M. LÓPEZ, ELISA
More informationA grid representation for Distributed Virtual Environments
A grid representation for Distributed Virtual Environments Pedro Morillo, Marcos Fernández, Nuria Pelechano Instituto de Robótica, Universidad de Valencia. Polígono Coma S/N. Aptdo.Correos 22085, CP: 46071
More informationOPTIMIZED TASK ALLOCATION IN SENSOR NETWORKS
OPTIMIZED TASK ALLOCATION IN SENSOR NETWORKS Ali Bagherinia 1 1 Department of Computer Engineering, Islamic Azad University-Dehdasht Branch, Dehdasht, Iran ali.bagherinia@gmail.com ABSTRACT In this paper
More informationA Memetic Algorithm for Parallel Machine Scheduling
A Memetic Algorithm for Parallel Machine Scheduling Serafettin Alpay Eskişehir Osmangazi University, Industrial Engineering Department, Eskisehir, Turkiye Abstract - This paper focuses on the problem of
More informationGenetic Algorithm for Job Shop Scheduling
Genetic Algorithm for Job Shop Scheduling Mr.P.P.Bhosale Department Of Computer Science and Engineering, SVERI s College Of Engineering Pandharpur, Solapur University Solapur Mr.Y.R.Kalshetty Department
More informationReference Point Based Evolutionary Approach for Workflow Grid Scheduling
Reference Point Based Evolutionary Approach for Workflow Grid Scheduling R. Garg and A. K. Singh Abstract Grid computing facilitates the users to consume the services over the network. In order to optimize
More informationSolving the Scheduling Problem in Computational Grid using Artificial Bee Colony Algorithm
Solving the Scheduling Problem in Computational Grid using Artificial Bee Colony Algorithm Seyyed Mohsen Hashemi 1 and Ali Hanani 2 1 Assistant Professor, Computer Engineering Department, Science and Research
More informationJob Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search
A JOB-SHOP SCHEDULING PROBLEM (JSSP) USING GENETIC ALGORITHM (GA) Mahanim Omar, Adam Baharum, Yahya Abu Hasan School of Mathematical Sciences, Universiti Sains Malaysia 11800 Penang, Malaysia Tel: (+)
More informationUsing Genetic Algorithm with Triple Crossover to Solve Travelling Salesman Problem
Proc. 1 st International Conference on Machine Learning and Data Engineering (icmlde2017) 20-22 Nov 2017, Sydney, Australia ISBN: 978-0-6480147-3-7 Using Genetic Algorithm with Triple Crossover to Solve
More informationIndex. Encoding representation 330 Enterprise grid 39 Enterprise Grids 5
Index Advanced Job Scheduler, Markov Availability Model, Resource Selection, Desktop Grid Computing, Stochastic scheduling 153 Agent 222, 224 226, 228, 233, 236 238 ApMon 223, 224, 239 Backlog 40, 45 Batch
More informationEscaping Local Optima: Genetic Algorithm
Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned
More informationA Hybrid Genetic Algorithms and Tabu Search for Solving an Irregular Shape Strip Packing Problem
A Hybrid Genetic Algorithms and Tabu Search for Solving an Irregular Shape Strip Packing Problem Kittipong Ekkachai 1 and Pradondet Nilagupta 2 ABSTRACT This paper presents a packing algorithm to solve
More informationGrid Scheduling Strategy using GA (GSSGA)
F Kurus Malai Selvi et al,int.j.computer Technology & Applications,Vol 3 (5), 8-86 ISSN:2229-693 Grid Scheduling Strategy using GA () Dr.D.I.George Amalarethinam Director-MCA & Associate Professor of Computer
More informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
More informationA Survey of Evolutionary Heuristic Algorithm for Job Scheduling in Grid Computing
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 6, June 2015, pg.611
More informationSolving the Multi Objective Flexible Job Shop Problem Using Combinational Meta Heuristic Algorithm Based on Genetic Algorithm and Tabu-Search
J. Basic. Appl. Sci. Res., 3(9)713-720, 2013 2013, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.com Solving the Multi Objective Flexible Job Shop Problem
More informationProvide a Method of Scheduling In Computational Grid Using Imperialist Competitive Algorithm
IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.6, June 2016 75 Provide a Method of Scheduling In Computational Grid Using Imperialist Competitive Algorithm Mostafa Pahlevanzadeh
More informationTASK SCHEDULING USING HAMMING PARTICLE SWARM OPTIMIZATION IN DISTRIBUTED SYSTEMS
Computing and Informatics, Vol. 36, 2017, 950 970, doi: 10.4149/cai 2017 4 950 TASK SCHEDULING USING HAMMING PARTICLE SWARM OPTIMIZATION IN DISTRIBUTED SYSTEMS Subramaniam Sarathambekai, Kandaswamy Umamaheswari
More informationEvolutionary Computation Algorithms for Cryptanalysis: A Study
Evolutionary Computation Algorithms for Cryptanalysis: A Study Poonam Garg Information Technology and Management Dept. Institute of Management Technology Ghaziabad, India pgarg@imt.edu Abstract The cryptanalysis
More informationA Resource Discovery Algorithm in Mobile Grid Computing Based on IP-Paging Scheme
A Resource Discovery Algorithm in Mobile Grid Computing Based on IP-Paging Scheme Yue Zhang 1 and Yunxia Pei 2 1 Department of Math and Computer Science Center of Network, Henan Police College, Zhengzhou,
More informationA Particle Swarm Optimization Algorithm for Solving Flexible Job-Shop Scheduling Problem
2011, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.com A Particle Swarm Optimization Algorithm for Solving Flexible Job-Shop Scheduling Problem Mohammad
More informationAn Exploration of Multi-Objective Scientific Workflow Scheduling in Cloud
International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2018 IJSRCSEIT Volume 3 Issue 3 ISSN : 2456-3307 An Exploration of Multi-Objective Scientific Workflow
More informationCloud Computing Resource Planning Based on Imperialist Competitive Algorithm
Cumhuriyet Üniversitesi Fen Fakültesi Fen Bilimleri Dergisi (CFD), Cilt:36, No: 4 Özel Sayı (205) ISSN: 300-949 Cumhuriyet University Faculty of Science Science Journal (CSJ), Vol. 36, No: 4 Special Issue
More informationMeshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods
Meshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods Uei-Ren Chen 1, Chin-Chi Wu 2, and Woei Lin 3 1 Department of Electronic Engineering, Hsiuping Institute of Technology
More informationA Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices
A Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices Yaser Alkhalifah Roger L. Wainwright Department of Mathematical Department of Mathematical and Computer Sciences and Computer
More informationA LOCAL SEARCH GENETIC ALGORITHM FOR THE JOB SHOP SCHEDULING PROBLEM
A LOCAL SEARCH GENETIC ALGORITHM FOR THE JOB SHOP SCHEDULING PROBLEM Kebabla Mebarek, Mouss Leila Hayat and Mouss Nadia Laboratoire d'automatique et productique, Université Hadj Lakhdar -Batna kebabla@yahoo.fr,
More informationMeta-heuristically Seeded Genetic Algorithm for Independent Job Scheduling in Grid Computing
Meta-heuristically Seeded Genetic Algorithm for Independent Job Scheduling in Grid Computing Muhanad Tahrir Younis, Shengxiang Yang, and Benjamin Passow Centre for Computational Intelligence (CCI), School
More informationIn cloud computing, IaaS approach is to
Journal of Advances in Computer Engineering and Technology, 1(3) 2015 Optimization Task Scheduling Algorithm in Cloud Computing Somayeh Taherian Dehkordi 1, Vahid Khatibi Bardsiri 2 Received (2015-06-27)
More informationScheduling in Multiprocessor System Using Genetic Algorithms
Scheduling in Multiprocessor System Using Genetic Algorithms Keshav Dahal 1, Alamgir Hossain 1, Benzy Varghese 1, Ajith Abraham 2, Fatos Xhafa 3, Atanasi Daradoumis 4 1 University of Bradford, UK, {k.p.dahal;
More informationHybrid Bee Ant Colony Algorithm for Effective Load Balancing And Job Scheduling In Cloud Computing
Hybrid Bee Ant Colony Algorithm for Effective Load Balancing And Job Scheduling In Cloud Computing Thomas Yeboah 1 and Odabi I. Odabi 2 1 Christian Service University, Ghana. 2 Wellspring Uiniversity,
More informationSolving A Nonlinear Side Constrained Transportation Problem. by Using Spanning Tree-based Genetic Algorithm. with Fuzzy Logic Controller
Solving A Nonlinear Side Constrained Transportation Problem by Using Spanning Tree-based Genetic Algorithm with Fuzzy Logic Controller Yasuhiro Tsujimura *, Mitsuo Gen ** and Admi Syarif **,*** * Department
More informationGrid Scheduling using PSO with Naive Crossover
Grid Scheduling using PSO with Naive Crossover Vikas Singh ABV- Indian Institute of Information Technology and Management, GwaliorMorena Link Road, Gwalior, India Deepak Singh Raipur Institute of Technology
More informationStudy of an Iterative Technique to Minimize Completion Times of Non-Makespan Machines
Study of an Iterative Technique to Minimize Completion Times of Non-Makespan Machines Luis Diego Briceño 1, Mohana Oltikar 1, Howard Jay Siegel 1,2, and Anthony A. Maciejewski 1 Colorado State University
More informationBi-Objective Optimization for Scheduling in Heterogeneous Computing Systems
Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Tony Maciejewski, Kyle Tarplee, Ryan Friese, and Howard Jay Siegel Department of Electrical and Computer Engineering Colorado
More informationHETEROGENEOUS COMPUTING
HETEROGENEOUS COMPUTING Shoukat Ali, Tracy D. Braun, Howard Jay Siegel, and Anthony A. Maciejewski School of Electrical and Computer Engineering, Purdue University Heterogeneous computing is a set of techniques
More informationGenetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem
etic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem R. O. Oladele Department of Computer Science University of Ilorin P.M.B. 1515, Ilorin, NIGERIA
More informationGenetic-PSO Fuzzy Data Mining With Divide and Conquer Strategy
Genetic-PSO Fuzzy Data Mining With Divide and Conquer Strategy Amin Jourabloo Department of Computer Engineering, Sharif University of Technology, Tehran, Iran E-mail: jourabloo@ce.sharif.edu Abstract
More informationWorkflow scheduling algorithms for hard-deadline constrained cloud environments
Procedia Computer Science Volume 80, 2016, Pages 2098 2106 ICCS 2016. The International Conference on Computational Science Workflow scheduling algorithms for hard-deadline constrained cloud environments
More informationScheduling Scientific Workflows using Imperialist Competitive Algorithm
212 International Conference on Industrial and Intelligent Information (ICIII 212) IPCSIT vol.31 (212) (212) IACSIT Press, Singapore Scheduling Scientific Workflows using Imperialist Competitive Algorithm
More informationHybrid Task Scheduling Method for Cloud Computing by Genetic and PSO Algorithms
Hybrid Task Scheduling Method for Cloud Computing by Genetic and PSO Algorithms Amin Kamalinia Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia, Iran Amin.kamalinia@gmail.com
More informationSIMULTANEOUS COMPUTATION OF MODEL ORDER AND PARAMETER ESTIMATION FOR ARX MODEL BASED ON MULTI- SWARM PARTICLE SWARM OPTIMIZATION
SIMULTANEOUS COMPUTATION OF MODEL ORDER AND PARAMETER ESTIMATION FOR ARX MODEL BASED ON MULTI- SWARM PARTICLE SWARM OPTIMIZATION Kamil Zakwan Mohd Azmi, Zuwairie Ibrahim and Dwi Pebrianti Faculty of Electrical
More informationSoftware Development for Optimum Allocation of Power System Elements Based on Genetic Algorithm
Proceedings of the 6th WSEAS International Conference on Power Systems, Lisbon, Portugal, September 22-24, 2006 155 Software Development for Optimum Allocation of Power System Elements Based on Genetic
More informationSolving Sudoku Puzzles with Node Based Coincidence Algorithm
Solving Sudoku Puzzles with Node Based Coincidence Algorithm Kiatsopon Waiyapara Department of Compute Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand kiatsopon.w@gmail.com
More informationStatic Batch Mode Heuristic Algorithm for Mapping Independent Tasks in Computational Grid
Journal of Computer Science Original Research Paper Static Batch Mode Heuristic Algorithm for Mapping Independent Tasks in Computational Grid 1 R. Vijayalakshmi and 2 V. Vasudevan 1 Department of Computer
More informationMultiprocessor Task Scheduling Using Hybrid Genetic Algorithm
Multiprocessor Task Scheduling Using Hybrid Genetic Algorithm Yogesh R. Shahare Department of Computer Engineering yogeshshahare@gmail.com Abstract In multiprocessor system are widely used in parallel
More informationAn Approach to Mapping Scientific Workflow in Cloud Computing data centers to Minimize Costs of Workflow Execution
An Approach to Mapping Scientific Workflow in Cloud Computing data centers to Minimize Costs of Workflow Execution A. Zareie M.M. Pedram M. Kelarestaghi A. kosari Computer Engineering Department, Islamic
More informationGENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM
Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain
More informationA Firework Algorithm for Solving Capacitated Vehicle Routing Problem
A Firework Algorithm for Solving Capacitated Vehicle Routing Problem 1 Noora Hani Abdulmajeed and 2* Masri Ayob 1,2 Data Mining and Optimization Research Group, Center for Artificial Intelligence, Faculty
More informationScheduling Mixed-Model Assembly Lines with Cost Objectives by a Hybrid Algorithm
Scheduling Mixed-Model Assembly Lines with Cost Objectives by a Hybrid Algorithm Binggang Wang, Yunqing Rao, Xinyu Shao, and Mengchang Wang The State Key Laboratory of Digital Manufacturing Equipment and
More informationPROBLEM SOLVING AND SEARCH IN ARTIFICIAL INTELLIGENCE
Artificial Intelligence, Computational Logic PROBLEM SOLVING AND SEARCH IN ARTIFICIAL INTELLIGENCE Lecture 10 Tree Decompositions Sarah Gaggl Dresden, 30th June 2015 Agenda 1 Introduction 2 Uninformed
More informationScheduling on Parallel Systems. - Sathish Vadhiyar
Scheduling on Parallel Systems - Sathish Vadhiyar Parallel Scheduling Categories Job Scheduling [this class] A set of jobs arriving at a parallel system Choosing an order of jobs for execution to minimize
More informationA Novel Hybrid Self Organizing Migrating Algorithm with Mutation for Global Optimization
International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-3, Issue-6, January 2014 A Novel Hybrid Self Organizing Migrating Algorithm with Mutation for Global Optimization
More informationParticle Swarm Optimization Approach with Parameter-wise Hill-climbing Heuristic for Task Allocation of Workflow Applications on the Cloud
Particle Swarm Optimization Approach with Parameter-wise Hill-climbing Heuristic for Task Allocation of Workflow Applications on the Cloud Simone A. Ludwig Department of Computer Science North Dakota State
More informationA HYBRID APPROACH IN GENETIC ALGORITHM: COEVOLUTION OF THREE VECTOR SOLUTION ENCODING. A CASE-STUDY
A HYBRID APPROACH IN GENETIC ALGORITHM: COEVOLUTION OF THREE VECTOR SOLUTION ENCODING. A CASE-STUDY Dmitriy BORODIN, Victor GORELIK, Wim DE BRUYN and Bert VAN VRECKEM University College Ghent, Ghent, Belgium
More informationC 1 Modified Genetic Algorithm to Solve Time-varying Lot Sizes Economic Lot Scheduling Problem
C 1 Modified Genetic Algorithm to Solve Time-varying Lot Sizes Economic Lot Scheduling Problem Bethany Elvira 1, Yudi Satria 2, dan Rahmi Rusin 3 1 Student in Department of Mathematics, University of Indonesia,
More informationPriority rule-based reconstruction for total weighted tardiness minimization of job-shop scheduling problem
Bulletin of the JSME Journal of Advanced Mechanical Design, Systems, and Manufacturing Vol.8, No.5, 2014 Priority rule-based reconstruction for total weighted tardiness minimization of job-shop scheduling
More informationSIMULATION APPROACH OF CUTTING TOOL MOVEMENT USING ARTIFICIAL INTELLIGENCE METHOD
Journal of Engineering Science and Technology Special Issue on 4th International Technical Conference 2014, June (2015) 35-44 School of Engineering, Taylor s University SIMULATION APPROACH OF CUTTING TOOL
More informationAutomatic Generation of Test Case based on GATS Algorithm *
Automatic Generation of Test Case based on GATS Algorithm * Xiajiong Shen and Qian Wang Institute of Data and Knowledge Engineering Henan University Kaifeng, Henan Province 475001, China shenxj@henu.edu.cn
More informationACCELERATING THE ANT COLONY OPTIMIZATION
ACCELERATING THE ANT COLONY OPTIMIZATION BY SMART ANTS, USING GENETIC OPERATOR Hassan Ismkhan Department of Computer Engineering, University of Bonab, Bonab, East Azerbaijan, Iran H.Ismkhan@bonabu.ac.ir
More informationDept of Comp. Sci & IT,Jamal Mohamed College(Autonomous), Trichirappalli, TN, India.
Max-min Average Algorithm for Scheduling Tasks in Grid Computing Systems George Amalarethinam. D.I, Vaaheedha Kfatheen.S Dept of Comp. Sci & IT,Jamal Mohamed College(Autonomous), Trichirappalli, TN, India.
More informationA New Algorithm for Solving the Operation Assignment Problem in 3-Machine Robotic Cell Scheduling
Australian Journal of Basic and Applied Sciences, 5(12): 1578-1585, 211 ISSN 1991-8178 A New Algorithm for Solving the Operation Assignment Problem in 3-Machine Robotic Cell Scheduling 1 Mohammad Fathian,
More informationTask Graph Scheduling on Multiprocessor System using Genetic Algorithm
Task Graph Scheduling on Multiprocessor System using Genetic Algorithm Amit Bansal M.Tech student DCSE, G.N.D.U. Amritsar, India Ravreet Kaur Asst. Professor DCSE, G.N.D.U. Amritsar, India Abstract Task
More informationABSTRACT I. INTRODUCTION. J Kanimozhi *, R Subramanian Department of Computer Science, Pondicherry University, Puducherry, Tamil Nadu, India
ABSTRACT 2018 IJSRSET Volume 4 Issue 4 Print ISSN: 2395-1990 Online ISSN : 2394-4099 Themed Section : Engineering and Technology Travelling Salesman Problem Solved using Genetic Algorithm Combined Data
More informationUsing Genetic Algorithms to optimize ACS-TSP
Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca
More informationA Novel Task Scheduling Algorithm for Heterogeneous Computing
A Novel Task Scheduling Algorithm for Heterogeneous Computing Vinay Kumar C. P.Katti P. C. Saxena SC&SS SC&SS SC&SS Jawaharlal Nehru University Jawaharlal Nehru University Jawaharlal Nehru University New
More informationThe movement of the dimmer firefly i towards the brighter firefly j in terms of the dimmer one s updated location is determined by the following equat
An Improved Firefly Algorithm for Optimization Problems Amarita Ritthipakdee 1, Arit Thammano, Nol Premasathian 3, and Bunyarit Uyyanonvara 4 Abstract Optimization problem is one of the most difficult
More informationAustralian Journal of Basic and Applied Sciences. Resource Fitness Task Scheduling Algorithm for Scheduling Tasks on Heterogeneous Grid Environment
AENSI Journals Australian Journal of Basic and Applied Sciences ISSN:1991-8178 Journal home page: www.ajbasweb.com Resource Fitness Task Scheduling Algorithm for Scheduling Tasks on Heterogeneous Grid
More informationEvolutionary Non-Linear Great Deluge for University Course Timetabling
Evolutionary Non-Linear Great Deluge for University Course Timetabling Dario Landa-Silva and Joe Henry Obit Automated Scheduling, Optimisation and Planning Research Group School of Computer Science, The
More informationParticle Swarm Optimization Approach for Scheduling of Flexible Job Shops
Particle Swarm Optimization Approach for Scheduling of Flexible Job Shops 1 Srinivas P. S., 2 Ramachandra Raju V., 3 C.S.P Rao. 1 Associate Professor, V. R. Sdhartha Engineering College, Vijayawada 2 Professor,
More informationQUT Digital Repository:
QUT Digital Repository: http://eprints.qut.edu.au/ This is the accepted version of this conference paper. To be published as: Ai, Lifeng and Tang, Maolin and Fidge, Colin J. (2010) QoS-oriented sesource
More informationVariable Neighborhood Search Based Algorithm for University Course Timetabling Problem
Variable Neighborhood Search Based Algorithm for University Course Timetabling Problem Velin Kralev, Radoslava Kraleva South-West University "Neofit Rilski", Blagoevgrad, Bulgaria Abstract: In this paper
More informationA fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem
Scientia Iranica E (0) 8 (3), 759 764 Sharif University of Technology Scientia Iranica Transactions E: Industrial Engineering www.sciencedirect.com Research note A fast hybrid particle swarm optimization
More informationA Resource Discovery Algorithm in Mobile Grid Computing based on IP-paging Scheme
A Resource Discovery Algorithm in Mobile Grid Computing based on IP-paging Scheme Yue Zhang, Yunxia Pei To cite this version: Yue Zhang, Yunxia Pei. A Resource Discovery Algorithm in Mobile Grid Computing
More informationA Modified Genetic Algorithm for Process Scheduling in Distributed System
A Modified Genetic Algorithm for Process Scheduling in Distributed System Vinay Harsora B.V.M. Engineering College Charatar Vidya Mandal Vallabh Vidyanagar, India Dr.Apurva Shah G.H.Patel College of Engineering
More informationA local search algorithm based on chromatic classes for university course timetabling problem
Research Article International Journal of Advanced Computer Research, Vol 7(28) ISSN (Print): 2249-7277 ISSN (Online): 2277-7970 http://dx.doi.org/10.19101/ijacr.2016.627011 A local search algorithm based
More informationNew algorithm for analyzing performance of neighborhood strategies in solving job shop scheduling problems
Journal of Scientific & Industrial Research ESWARAMURTHY: NEW ALGORITHM FOR ANALYZING PERFORMANCE OF NEIGHBORHOOD STRATEGIES 579 Vol. 67, August 2008, pp. 579-588 New algorithm for analyzing performance
More informationOptimization of Association Rule Mining through Genetic Algorithm
Optimization of Association Rule Mining through Genetic Algorithm RUPALI HALDULAKAR School of Information Technology, Rajiv Gandhi Proudyogiki Vishwavidyalaya Bhopal, Madhya Pradesh India Prof. JITENDRA
More informationGT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS
GT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS M. Chandrasekaran 1, D. Lakshmipathy 1 and P. Sriramya 2 1 Department of Mechanical Engineering, Vels University, Chennai, India 2
More informationResearch Incubator: Combinatorial Optimization. Dr. Lixin Tao December 9, 2003
Research Incubator: Combinatorial Optimization Dr. Lixin Tao December 9, 23 Content General Nature of Research on Combinatorial Optimization Problem Identification and Abstraction Problem Properties and
More informationGRID SCHEDULING USING ENHANCED PSO ALGORITHM
GRID SCHEDULING USING ENHANCED PSO ALGORITHM Mr. P.Mathiyalagan 1 U.R.Dhepthie 2 Dr. S.N.Sivanandam 3 1 Lecturer 2 Post Graduate Student 3 Professor and Head Department of Computer Science and Engineering
More informationA New Task Scheduling Algorithm using Firefly and Simulated Annealing Algorithms in Cloud Computing
Vol. 9, No., A New Task Scheduling Algorithm using Firefly and Simulated Annealing Algorithms in Cloud Computing Fakhrosadat Fanian Department of Computer Engineering, Kerman Branch, Islamic Azad University,
More information