14 papers · ranked by Valyu relevance
Sirilak Ketchaya, Apisit Rattanatranurak
Quicksort is an important algorithm that uses the divide and conquer concept, and it can be run to solve any problem. The performance of the algorithm can be improved by implementing this algorithm in parallel. In this paper, the parallel sorting algorithm named the Multi-Deque Partition Dual-Deque Merge Sorting…
Frédéric Jarlier, Nicolas Joly, Nicolas Fedy, Thomas Magalhaes + 5 more
'Leonor Sirotti' 'Paul Paganiban' 'Firmin Martin' 'Michael McManus' 'Philippe Hupé'] Life science has entered the so-called 'big data era' where biologists, clinicians and bioinformaticians are overwhelmed with high-throughput sequencing data. While they offer new insights to decipher the genome structure they also…
Mohammed Alaa Ala’anzy, Nurdaulet Tolendi, Baizhan Baubek, Abdulmohsen Algarni + 1 more
Sorting can be approached in two main ways: sequentially and in parallel. In sequential sorting, data is processed in a single-threaded manner, which can be slow for large datasets. However, parallel sorting divides the task across multiple processing units, enabling faster results by processing data simultaneously.…
Alex A. Zhukov, Robyn H. Pritchard, Mick J. Withers, Tony Hailes + 6 more
We demonstrate extremely high-throughput microfluidic cell sorting by making a parallel version of the vortex-actuated cell sorter (VACS). The set-up includes a parallel microfluidic sorter chip and parallel cytometry instrumentation: optics, electronics and control software. The result is capable of sorting…
Benjamin G Jackson, Patrick S Schnable, Srinivas Aluru
Background The de novo assembly of genomes and transcriptomes from short sequences is a challenging problem. Because of the high coverage needed to assemble short sequences as well as the overhead of modeling the assembly problem as a graph problem, the methods for short sequence assembly are often validated using data…
Mohammad Abdur Rob, Md. Zakir Hossen, Md. Kamal Hossen, Md. Mithun Ali + 2 more
Sorting algorithms play a crucial role in computing, but most are designed with rigid structure that are only efficient under certain conditions. Although some sorting algorithms perform well in some circumstances, they do not perform well on some resistant platforms. This study introduces Wall-L Merge Sort, which…
Bérenger Bramas, Muhammad Aleem
The way developers implement their algorithms and how these implementations behave on modern CPUs are governed by the design and organization of these. The vectorization units (SIMD) are among the few CPUs’ parts that can and must be explicitly controlled. In the HPC community, the x86 CPUs and their vectorization…
Cao Niu, Dake Liu, Hsiao-Chun Wu
Nonlinear soft bit detection is essential for the uplink receivers of 5G base stations, especially for users around the cell edge. However, its throughput and computing complexity are always challenges for both research and industry. A low-cost and low-power parallel implementation of a soft-output detector based on…
Jamshed Khan, Tobias Rubel, Erin Molloy, Laxman Dhulipala + 1 more
Purpose String indexes such as the suffix array (sa) and the closely related longest common prefix (lcp) array are fundamental objects in bioinformatics and have a wide variety of applications. Despite their importance in practice, few scalable parallel algorithms for constructing these are known, and the existing…
Hualing Lin, Xue Zhang, Junchen Yu, Ji Xiang + 2 more
'Anastasios Doulamis'] Sorting recyclable trash is critical to reducing energy consumption and mitigating environmental pollution. Currently, trash sorting heavily relies on manpower. Computer vision technology enables automated trash sorting. However, existing trash image classification datasets contain a large number…
Ryou Kubota, Kazutoshi Nagao, Wataru Tanaka, Ryotaro Matsumura + 3 more
'Takuma Aoyama' 'Kenji Urayama' 'Itaru Hamachi'] Self-sorting double network hydrogels comprising orthogonal supramolecular nanofibers have attracted attention as artificially-regulated multi-component systems. Regulation of network patterns of self-sorted nanofibers is considered as a key for potential applications…
Suluk Chaikhan, Suphakant Phimoltares, Chidchanok Lursinsap, Mohamed Hammad
'Mohamed Hammad'] Big streaming data environment concerns a complicated scenario where data to be processed continuously flow into a processing unit and certainly cause a memory overflow problem. This obstructs the adaptation of deploying all existing classic sorting algorithms because the data to be sorted must be…
Marília DV Braga, Christian Gautier, Marie-France Sagot
Background The reversal distance and optimal sequences of reversals to transform a genome into another are useful tools to analyse evolutionary scenarios. However, the number of sequences is huge and some additional criteria should be used to obtain a more accurate analysis. One strategy is searching for sequences that…
Patrizio Dazzi
Embarrassingly parallel problems are characterised by a very small amount of information to be exchanged among the parts they are split in, during their parallel execution. As a consequence they do not require sophisticated, low-latency, high-bandwidth interconnection networks but can be efficiently computed in…