A Lightweight Island Model for the Genetic Algorithm over GPGU
نویسندگان
چکیده
This paper presents a parallel approach of the genetic algorithm (GA) over Graphical Processing Unit (GPU) to solve Traveling Salesman Problem (TSP). Since earlier studies did not focus on implementing island model in persistent way, this introduces an approach, named Lightweight Island Model (LIM), that aims implement concept threads algorithm. For that, we present implementation details convert traditional model, which is separated into multiple kernels, computing paradigm based kernel. Many synchronization techniques, including cooperative groups and implicit synchronization, are discussed reduce CPU-GPU interaction existed model. A new parallelization strategy presented for distributing work among live during selection crossover steps. The GPU configurations lead best possible performance also determined. introduced will be compared, terms speedup solution quality, with (TIM) as well related works concentrated suggesting lighter version master-slave switching kernels (SAK) scheduled light kernel (SLK) approaches. results show can increase speed-up 27x serial CPU, 4.5x up 1.5–2x SAK SLK
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
A genetic algorithm for a bi-objective mathematical model for dynamic virtual cell formation problem
Nowadays, with the increasing pressure of the competitive business environment and demand for diverse products, manufacturers are force to seek for solutions that reduce production costs and rise product quality. Cellular manufacturing system (CMS), as a means to this end, has been a point of attraction to both researchers and practitioners. Limitations of cell formation problem (CFP), as one o...
متن کاملA genetic algorithm approach for problem
In this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i j, the duration of this set-up being the sequ...
متن کاملA lightweight genetic block-matching algorithm for video coding
In this paper, a lightweight genetic search algorithm (LGSA) is proposed. Different evolution schemes are investigated, such that the control overheads are largely reduced. It is also shown that the proposed LGSA can be viewed as a novel expansion of the three-step search algorithm (TSS). It can be seen from the simulation results that the performance of LGSA is very similar to that of FSA, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of electrical and computer engineering systems
سال: 2023
ISSN: ['1847-6996', '1847-7003']
DOI: https://doi.org/10.32985/ijeces.14.7.3