Everand Logo

Welcome to Everand!

  • Discover millions of ebooks, audiobooks, and so much more with a free trial

    Only $11.99/month after trial. Cancel anytime.

    GPU-based Parallel Implementation of Swarm Intelligence Algorithms
    GPU-based Parallel Implementation of Swarm Intelligence Algorithms
    GPU-based Parallel Implementation of Swarm Intelligence Algorithms
    Ebook434 pages24 hours

    GPU-based Parallel Implementation of Swarm Intelligence Algorithms

    By Ying Tan

    ()

    Read preview

    About this ebook

    GPU-based Parallel Implementation of Swarm Intelligence Algorithms combines and covers two emerging areas attracting increased attention and applications: graphics processing units (GPUs) for general-purpose computing (GPGPU) and swarm intelligence. This book not only presents GPGPU in adequate detail, but also includes guidance on the appropriate implementation of swarm intelligence algorithms on the GPU platform.

    GPU-based implementations of several typical swarm intelligence algorithms such as PSO, FWA, GA, DE, and ACO are presented and having described the implementation details including parallel models, implementation considerations as well as performance metrics are discussed. Finally, several typical applications of GPU-based swarm intelligence algorithms are presented. This valuable reference book provides a unique perspective not possible by studying either GPGPU or swarm intelligence alone.

    This book gives a complete and whole picture for interested readers and new comers who will find many implementation algorithms in the book suitable for immediate use in their projects. Additionally, some algorithms can also be used as a starting point for further research.

    • Presents a concise but sufficient introduction to general-purpose GPU computing which can help the layman become familiar with this emerging computing technique
    • Describes implementation details, such as parallel models and performance metrics, so readers can easily utilize the techniques to accelerate their algorithmic programs
    • Appeals to readers from the domain of high performance computing (HPC) who will find the relatively young research domain of swarm intelligence very interesting
    • Includes many real-world applications, which can be of great help in deciding whether or not swarm intelligence algorithms or GPGPU is appropriate for the task at hand
    LanguageEnglish
    PublisherElsevier Science
    Release dateApr 15, 2016
    ISBN9780128093641
    GPU-based Parallel Implementation of Swarm Intelligence Algorithms
    Author

    Ying Tan

    Ying Tan is a professor and PhD advisor at the School of Electronics Engineering and Computer Science of Peking University, and director of Computational Intelligence Laboratory at Peking University (PKU). He received his BEng from the EEI, MSc from Xidian Univ., and PhD from Southeast Univ., in 1985, 1988, and 1997, respectively. From 1997, he was a postdoctoral fellow then an associate professor at University of Science and Technology of China (USTC), then served as director of Institute of Intelligent Information Science and a full professor since 2000. He worked with the Chinese University of Hong Kong (CUHK) in 1999 and 2004-2005. He was elected for the 100 talent program of the Chinese Academy of Science (CAS) in 2005

    Related to GPU-based Parallel Implementation of Swarm Intelligence Algorithms

    Related ebooks

    Programming For You

    View More
    View More

    Related podcast episodes

    Related articles

    • Article

      Rokoko Studio 2.0

      Feb 23, 2021

      Rokoko Studio 2.0
      1 min read

    • Article

      Right To Repair

      Feb 7, 2023

      Right To Repair
      2 min read

    • Article

      Meet The Team

      Oct 19, 2021

      Meet The Team
      1 min read

    • Article

      What Is The Future Of Game Streaming Now That Stadia Is Dead?

      Oct 31, 2022

      Once hyped as being ‘the future of gaming’, the Google Stadia game streaming service was officially, just three years after launch and before even making it to Australian shores. When game streaming first launched we did have some apprehension about

      2 min read

    • Article

      Rise Of The Robots

      Jan 12, 2021

      Rise Of The Robots
      7 min read

    • Article

      Getting Started With The Powerful EBPF

      Sep 20, 2022

      Credit: https://ebpf.io Don’t miss next issue! Subscribe on page 16 Mihalis Tsoukalos is a systems engineer and a technical writer. You can reach him at www. mtsoukalos.eu and @mactsouk. Get the code for this tutorial from the Linux Format archive:

      10 min read

    • Article

      Quantum Timeline

      Oct 1, 2021

      Quantum Timeline
      1 min read

    • Article

      Software Pools Server Memory for Faster Networks

      May 31, 2017

      A group of engineers has created open-source software that allows for memory sharing among servers in a computer network, allowing for more efficient use of memory and even faster computer operations. For decades, operators of large computer clusters

      2 min read

    • Article

      In Brief

      Jun 1, 2021

      Mu is a code editor for many forms of Python. We can write standard Python 3 code, create web apps and write code for microcontrollers such as the new Raspberry Pi Pico. Mu is designed for new users and does away with complicated IDEs in favour of a

      1 min read

    • Article

      Usability

      Oct 19, 2021

      Usability
      3 min read

    • Article

      Meet The Team

      Aug 24, 2021

      Adobe Flash was born kicking and screaming (and otherwise animating colourful objects) into this world in 1996. This makes it just a little younger than Linux, and definitely not a thing the past three decades should be proud of. Nonetheless, we shou

      1 min read

    • Article

      Plastic Chips

      Sep 14, 2021

      Plastic Chips
      1 min read

    • Article

      » Stochastic Algorithms

      Dec 14, 2021

      If you’re up for some relatively maths-heavy computer-science reading (and who isn’t?), then consider looking into stochastic algorithms. Sometimes lumped together with machine-learning, stochastic algorithms is a loosely defined category that you co

      1 min read

    • Article

      Fast And Easy Image Processing

      Apr 4, 2023

      Credit: https://github.com/oguzhaninan/korkut Shashank Sharma is a trial lawyer in New Delhi and an avid Arch user. He’s been writing about open source software for 20 years and lawyering for 10. You wouldn’t think of the command line as the go-to re

      4 min read

    • Article

      Open Source Processors

      Jun 2, 2020

      Open Source Processors
      8 min read

    • Article

      Updating Sites

      Oct 19, 2021

      Updating Sites
      1 min read

    • Article

      Docker vs Podman

      Apr 19, 2021

      When Cockpit was first developed, it had plug-in support for administering your Docker containers remotely via its user-friendly web interface. But then Red Hat OS became a major backer of Cockpit, and when Red Hat developed its own alternative to Do

      1 min read

    • Article

      AMD Radeon RX 6700 XT

      May 17, 2021

      AMD Radeon RX 6700 XT
      3 min read

    • Article

      Access Your Mac Anywhere

      Nov 8, 2022

      Access Your Mac Anywhere
      2 min read

    • Article

      The Return Of Gpu Computing

      Jul 8, 2021

      The Return Of Gpu Computing
      5 min read

    • Article

      Build The Kernel

      Mar 8, 2022

      Build The Kernel
      1 min read

    • Article

      The Razor’s Edge

      Mar 10, 2020

      The Razor’s Edge
      10 min read

    Related categories

    Reviews for GPU-based Parallel Implementation of Swarm Intelligence Algorithms

    0 ratings

    0 ratings0 reviews

    What did you think?

    Tap to rate

    Review must be at least 10 words

      Book preview

      GPU-based Parallel Implementation of Swarm Intelligence Algorithms - Ying Tan

      optimization

      Chapter 1

      Introduction

      Contents

      1.1 Swarm Intelligence Algorithms (SIAs)  1

      1.2 Graphics Processing Units (GPUs)  3

      1.3 SIAs and GPUs  3

      1.4 Some Perspectives  5

      1.5 Organization  6

      1.1 Swarm Intelligence Algorithms (SIAs)

      Swarm intelligence is the collective behavior of decentralized, self-organized systems. A typical swarm intelligence system consists of a population of simple agents which can communicate (either directly or indirectly) locally with each other by acting on their local environment. Though the agents in a swarm follow very simple rules, the interactions between such agents can lead to the emergence of very complicated global behavior, far beyond the capability of individual agents [54, 55]. Examples in natural systems of swarm intelligence include bird flocking, ant foraging, and fish schooling.

      Inspired by swarm’s such behavior, a class of algorithms is proposed for tackling optimization problems, usually under the title of swarm intelligence algorithms (SIAs) [203]. In SIAs, a swarm is made up of multiple artificial agents. The agents can exchange heuristic information in the form of local interaction. Such interaction, in addition with certain stochastic elements, generates the behavior of adaptive search, and finally leads to global optimization.

      The most respected and popular SIAs are particle swarm optimization (PSO) which is inspired by the social behavior of bird flocking or fish schooling [87, 19], and ant colony optimization (ACO) which simulates the foraging behavior of ant colony [52, 51]. PSO is widely used for real-parameter optimization while ACO has been successfully applied to solve combinatorial optimization problems, for instance, the most well-known combinatorial optimization problems are the traveling salesman problem (TSP) and quadratic assignment problem (QAP).

      Novel SIAs with particular search mechanisms have been proposed and achieved success on specific problems. Some instances of novel SIAs are bacterial foraging optimization (BFO) [145], bee algorithm [148], fish schooling search (FSS) [57], cuckoo search [204], fireworks algorithm (FWA) [180–182, 185], brain storm optimization (BSO) [174], and the list is increasingly long.

      In essence, SIAs are iterative-based stochastic search algorithms where heuristic information is shared in order to guide the search in the following iterations. A simplified general framework of SIAs is depicted in Fig. 1.1. For a particular SIAs, the sequence of each phase may be different and some phases can be included several times in a single iteration.

      Fig. 1.1 Framework of Swarm Intelligence Algorithms

      Though different SIAs utilize different interaction mechanisms and various heuristic information in quite different ways, we think this framework is capable of embodying the essential philosophy underlying SIAs, thus can be used as the reference frame for discussing various parallel implementations on the graphics processing unit (GPU).

      Take standard PSO for example. After randomly initializing the population, the fitness value of each particle is evaluated. In the following communication phase, fitness values are communicated among particles according to certain topology (global topology, ring topology, etc.). Then each particle updates its private and neighborhood best information (if necessary), and its velocity and position vector in swarm updating phase. The loop continues until termination conditions (e.g., meeting the presetting accuracy or reaching the maximum number of fitness evaluations) are satisfied.

      In the case of typical ACO, ants communicate with one another indirectly via pheromone updating. Each ant needs to construct a feasible path before it can evaluate the fitness (cost of the path). This path construction step may be quite different from PSO and other SIAs for real-parameter optimization at the first glance. However, thinking this step under the proposed reference frame, the path construction is nothing but a stochastic updating mechanism. As the ant has no private memory, it must build the new solution from scratch with the pheromone as heuristic guide. Once the path is constructed, the calculation of the fitness value is trivial. More often, for combinatorial optimization problems, the fitness value is calculated as the same time as the path is under construction. In this case, fitness evaluation phase and swarm updating can be viewed as emerged into one single

      Enjoying the preview?
      Page 1 of 1