Results 11 to 20 of about 9,353 (258)
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 +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
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
Information Technology and Libraries, 2013 Describes the characte1·istics, performance, and potential of SKED (Sort- Key Edit), a generalized computer program for creating sort keys for MARC II records at the users option.
John C. Rather, Jerry G. Pennington
doaj +1 more source
Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP
Scientific Reports, 2023 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.
Sirilak Ketchaya, Apisit Rattanatranurak
doaj +1 more source
Cluster Sort: A Novel Hybrid Approach to Efficient In-Place Sorting Using Data Clustering
IEEE AccessThis research work introduces a clustering-based in-place sorting algorithm, cluster sort. It is designed in such a way that it improves sorting efficiency by using data locality.
Mohit Subramaniam +2 more
doaj +1 more source
Comparison Of Hybrid Sorting Algorithms Implemented On Different Parallel Hardware Platforms
Computer Science, 2013 Sorting is a common problem in computer science. There are lot of well-known sorting algorithms created for sequential execution on a single processor. Recently, hardware platforms enable to create wide parallel algorithms.
Dominik Zurek +3 more
doaj +1 more source