[vc_empty_space][vc_empty_space]
Grid computing process improvement through computing resource scheduling using genetic algorithm and Tabu Search integration
Darmawan I.a, Kuspriyantob, Priyana Y.b, Joseph M.I.b
a Electrical Engineering and Informatics, University of Siliwangi Tasikmalaya, Indonesia
b School of Electrical Engineering and Informatics, Bandung Institute of Technology, Indonesia
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]Problems of scheduling jobs to some machine (Scheduling Jobs on Multiple Machines / SJMM) is one of the classical scheduling problems which can be found in the computing process, especially when done in a distributed computing. Several methods of solving problems has been developed both exact and heuristic approaches (metaheuristik). Tabu Search as one of a relatively new method of metaheuristik can be an alternative method to obtain the settlement approach to these problems. This method has been applied to combinatorial optimization problems, multi ekstermal optimization, and rare event simulation, with results that are optimal solution with a relatively short time. The purpose of this study to develop and implement a Tabu Search method combined with genetic algorithms (Integration Genetic-Tabu Search Algorithm / IGTS) in SJMM problems in computational grid. So that the integration of scheduling algorithms GA and TS can improve processing perpormance Job in grid computing environments. The method used is to include the excess Tabu Search algorithm which formed tabulist to be used in Genetic algorithms. Tabulist used to detect / store data in the process of forming a new population whose job is to detect repeated marriages between same Parent. Results obtained from the algorithm that is designed (IGTS) which serves to determine the allocation of the processing load on the cluster is the increased performance of some value which is quite satisfactory compared with not using tabulist include: makespan = 3.07%, the waiting time = 19.39%, and the number of generations / iterations is smaller. © 2012 IEEE.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Alternative methods,Combinatorial optimization problems,Computational grids,Computing process,Computing resource,Grid computing environment,Heuristic approach,Job scheduling,Makespan,Multiple machine,Optimal solutions,Processing load,Rare event simulation,Scheduling jobs,Scheduling problem,Search Algorithms,Tabu search algorithms,Tabu search method,Waiting-time[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Genetic algorithms,Grid Computing,Job Scheduling,Makespan,Tabu search[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1109/TSSA.2012.6366077[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]