Fully Flexible Parallel Merge Sort for Multicore Architectures
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 can support these systems to efficiently use...
Saved in:
| Main Authors: | Zbigniew Marszałek, Marcin Woźniak, Dawid Połap |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2018/8679579 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The impact of parallel programming on faster image filtering
by: Kamil Książek, et al.
Published: (2018-09-01) -
Empirical evaluation of parallel implementations of MergeSort
by: José Eduardo Solsona, et al.
Published: (2025-05-01) -
Interpolation merge as augmentation technique in the problem of ship classification
by: Marta Włodarczyk-Sielicka, et al.
Published: (2020-09-01) -
PARALLELIZING GRAPH ALGORITHM FOR MULTICORE PROCESSORS
by: Vladimir Feoharovich Antonov
Published: (2022-10-01) -
Strategies of parallelizing nested loops on the multicore architectures on the example of the WZ factorization for the dense matrices
by: Beata Bylina, et al.
Published: (2015-10-01)