Results 11 to 20 of about 281,251 (291)
JuTISI (Jurnal Teknik Informatika dan Sistem Informasi), 2017 Ordering is one of the process done before doing data processing. The sorting algorithm has its own strengths and weaknesses. By taking strengths of each algorithm then combined can be a better algorithm.
Muhammad Ezar Al Rivan
doaj +2 more sources
Halstead’s Complexity Measure of a Merge sort and Modified Merge sort Algorithms [PDF]
Jambura Journal of Informatics, 2023 Complexity measuring tools in computer science are deployed to measure and compare different characteristics of algorithms in order to find the best one in solving a particular problem or that suits a particular situation. In view of this, Halstead’s complexity metrics is deployed to compare the efficiency of two external sorting methods; the Merge ...
Ghaniyyat Bolanle Balogun +4 more
openaire +2 more sources
Array sort: an adaptive sorting algorithm on multi-thread
The Journal of Engineering, 2019 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
Solid State Drives And The Sort-Merge [PDF]
, 2016 This paper discusses the history of the sort-merge routine and the impacts of hardware limitations on the performance of sort-merge processing. The results of comparing a single-step sort-merge with a two-step sort-merge in a hard-disk drive (HDD ...
Haworth, Dwight A.
core +1 more source
Applying sorting algorithms to sensory ranking tests – A proof of concept study
Current Research in Food Science, 2020 In a sensory or consumer setting, panelists are commonly asked to rank a set of stimuli, either by the panelist's liking of the samples, or by the samples' perceived intensity of a particular sensory note. Ranking is seen as a “simple” task for panelists,
Markus Ekman +5 more
doaj +1 more source
Parallel Merge Sort for Distributed Memory Architectures [PDF]
, 1994 Cole presented a parallel merge sort for the PRAM model that performs in O(log n) parallel steps using n processors. He gave an algorithm for the CREW PRAM model for which the constant in the running time is small.
Jean-marc Adamo, Luis Trejo
core +6 more sources
On the Performance of Mean-Based Sort for Large Data Sets
IEEE Access, 2021 Computer and communication systems and networks deal with many cases that require rearrangement of data either in descending or ascending order. This operation is called sorting, and the purpose of an efficient sorting algorithm is to reduce the ...
Shahriar Shirvani Moghaddam +1 more
doaj +1 more source
Comparative Analysis of OpenMP and MPI Parallel Computing Implementations in Team Sort Algorithm
Journal of Applied Informatics and Computing, 2023 Tim Sort is a sorting algorithm that combines Merge Sort and Binary Insertion Sort sorting algorithms. Parallel computing is a computational processing technique in parallel or is divided into several parts and carried out simultaneously. The application
Eko Dwi Nugroho +4 more
doaj +1 more source
Actris 2.0: Asynchronous Session-Type Based Reasoning in Separation Logic [PDF]
Logical Methods in Computer Science, 2022 Message passing is a useful abstraction for implementing concurrent programs. For real-world systems, however, it is often combined with other programming and concurrency paradigms, such as higher-order functions, mutable state, shared-memory concurrency,
Jonas Kastberg Hinrichsen +2 more
doaj +1 more source
Fully Flexible Parallel Merge Sort for Multicore Architectures
Complexity, 2018 The development in multicore architectures gives a new line of processors that can flexibly distribute tasks between their logical cores. These need flexible models of efficient algorithms, both fast and stable. A new line of efficient sorting algorithms
Zbigniew Marszałek +2 more
doaj +1 more source