Wall-L merge sort: A tunable and adaptive sorting algorithm for diverse computing environments. [PDF]
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 ...
Mohammad Abdur Rob +4 more
doaj +3 more sources
Performance evaluation of GPU-based parallel sorting algorithms. [PDF]
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.
Mohammed Alaa Ala'anzy +3 more
doaj +2 more sources
Empirical Evaluation of Unoptimized Sorting Algorithms on 8-Bit AVR Arduino Microcontrollers [PDF]
Resource-constrained sensor nodes in Internet-of-Things (IoT) and embedded sensing applications frequently rely on low-cost microcontrollers, where even basic algorithmic choices directly impact latency, energy consumption, and memory footprint.
Julia Golonka, Filip Krużel
doaj +2 more sources
Design of High-Speed Multiway Merge Sorting Networks Using Fast Single-Stage N-Sorters and N-Filters
In hardware such as FPGAs, Kenneth Batcher’s Odd-Even Merge Sort and Bitonic Merge Sort are the state-of-the-art methodologies used to quickly sort a list of more than 16 input values.
Robert B. Kent, Marios S. Pattichis
doaj +1 more source
A Parallel Environment Designing for OWL Thinking [PDF]
A huge volume of information available today is in the form of images and searching the wanted images is very difficult and highly time-consuming. The search may take longer periods as the search volume on the internet is very huge and also the relevance
Madargi Sanjana C +2 more
doaj +1 more source
Enhanced Method of Object Tracing Using Extended Kalman Filter via Binary Search Algorithm [PDF]
Day by day demand for object tracing is increasing because of the huge scope in real-time applications. Object tracing is one of the difficult issues in the computer vision and video processing field.
Sandeep Kumar +3 more
doaj +1 more source
Perbandingan Efisiensi Algoritma Sorting dalam Penggunaan Bandwidth
The most used algorithm is the sorting algorithm. There have been many popping sorting algorithms that can be used, in this study researchers took three sorting algorithms namely Insertion Sort, Selection Sort, and Merge Sort.
Desi Anggreani +3 more
doaj +1 more source
Sorting algorithms are crucial in data processing, particularly for integer data. However, as the number of integers to be sorted increases, the sorting algorithm takes longer to complete, especially for algorithms with O(n2) complexity.
Risqi Pradana Aryanto +2 more
doaj +1 more source
Fast continuous streaming sort in big streaming data environment under fixed-size single storage.
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.
Suluk Chaikhan +2 more
doaj +1 more source
Array sort: an adaptive sorting algorithm on multi-thread
Sorting is the most fundamental operation in database system. There are many classical sorting algorithms and among them the most commonly-used sorting algorithm in modern database system is merge sort.
Xin Huang, Zhijing Liu, Jinyang Li
doaj +1 more source

