Publication

A bucket sort algorithm for the particle-in-cell method on manycore architectures

Laurent Villard, Stephan Brunner, Trach-Minh Tran, Claudio Gheller
2016
Conference Papers

Abstract

The Particle-In-Cell (PIC) method is effectively used in many scientific simulation codes. In order to optimize the performance of the PIC approach, data locality is required. This relies on efficient sorting algorithms. We present a bucket sort algorithm with small memory footprint for the PIC method targeting Graphics Processing Units (GPUs). Our sorting algorithm shows an increased performance with the amount of storage provided and with the orderliness of the particles. For our application where particles are presorted it performs better and requires less memory than other sorting algorithms in the literature. The overall PIC algorithm performs at its best if the sorting is applied.

Official source

https://infoscience.epfl.ch/entities/publication/13feacb5-9c3a-48bb-91b7-ebb1b6109eed

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Laurent Villard, Stephan Brunner, Trach-Minh Tran, Claudio Gheller
2016
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/13feacb5-9c3a-48bb-91b7-ebb1b6109eed

About this result

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Analysis of algorithms

Related concepts (18)

Sorting algorithm

In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order and lexicographical order, and either ascending or descending. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output.

Sorting network

In computer science, comparator networks are abstract devices built up of a fixed number of "wires", carrying values, and comparator modules that connect pairs of wires, swapping the values on the wires if they are not in a desired order. Such networks are typically designed to perform sorting on fixed numbers of values, in which case they are called sorting networks. Sorting networks differ from general comparison sorts in that they are not capable of handling arbitrarily large inputs, and in that their sequence of comparisons is set in advance, regardless of the outcome of previous comparisons.

Sorting

Sorting refers to ordering data in an increasing or decreasing manner according to some linear relationship among the data items. ordering: arranging items in a sequence ordered by some criterion; categorizing: grouping items with similar properties. Ordering items is the combination of categorizing them based on equivalent order, and ordering the categories themselves. In , arranging in an ordered sequence is called "sorting". Sorting is a common operation in many applications, and efficient algorithms have been developed to perform it.

Related publications (28)

Design and construction of a microfluidics workstation for high-throughput multi-wavelength fluorescence and transmittance activated droplet analysis and sorting

Christoph Merten, Jatin Panwar, Alexis Louis Autour

Droplet microfluidics has revolutionized quantitative high-throughput bioassays and screening, especially in the field of single-cell analysis where applications include cell characterization, antibody discovery and directed evolution. However, droplet mic ...

NATURE PORTFOLIO2023

Assessing real-world gait with digital technology? Validation, insights and recommendations from the Mobilise-D consortium

Kamiar Aminian, Anisoara Ionescu, Abolfazl Soltani, Francesca Salis

Background: Although digital mobility outcomes (DMOs) can be readily calculated from real-world data collected with wearable devices and ad-hoc algorithms, technical validation is still required. The aim of this paper is to comparatively assess and validat ...

BioMed Central2023

Worldwide analysis of reef surveys sorts coral taxa by associations with recent and past heat stress

Stéphane Joost, Oliver Michele Selmoni, Véronique Berteaux-Lecellier

Coral reefs around the world are under threat from anomalous heat waves that are causing the widespread decline of hard corals. Different coral taxa are known to have different sensitivities to heat, although variation in susceptibilities have also been ob ...

FRONTIERS MEDIA SA2022