Suchergebnisse - parallel in-place algorithms

HI-FFT: Heterogeneous Parallel In-place Algorithm for Large-scale 2D-FFT von Kang, Homin, Lee, Jaehong, Kim, Duksu

“… To accelerate large-scale 2D-FFT computation, we propose a Heterogeneous parallel In-place 2D-FFT algorithm, HI-FFT …”
Volltext

GPU-ArraySort: A Parallel, In-Place Algorithm for Sorting Large Number of Arrays von Awan, Muaaz Gul, Saeed, Fahad

“… Our algorithm performs in-place operations and makes minimum use of any temporary run-time memory …”
Volltext

Fast In-Place Suffix Sorting on a Multicore Computer von Lao, Bin, Nong, Ge, Chan, Wai Hong, Xie, Jing Yi

“… designs a fast linear-time and in-place parallel algorithm called pSACAK, for sorting the suffixes …”
Volltext

Parallel In-Place Algorithms: Theory and Practice von Gu, Yan, Obeya, Omar, Shun, Julian

“… Therefore, it is desirable to design parallel in-place algorithms that use sublinear (or even polylogarithmic …”
Volltext

PI-sqrt: novel parallel implementations of in-place sequence rotation on multicore systems von Hashem, Mervat, Li, Kenli, Salah, Ahmad

“… . In this work, we propose the blend rotation, which is a parallel-friendly and in-place algorithm that combines the merits of these three rotation algorithm …”
Volltext

NDPA: A generalized efficient parallel in-place N-Dimensional Permutation Algorithm von Ali, Muhammad Elsayed, El-shehaby, Saleh, Abougabal, Mohamed S.

“… This paper proposes an efficient in-place N-dimensional permutation algorithm. The algorithm is based on a novel 3D transpose algorithm that was published recently …”
Volltext

In-Place Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory von Kuszmaul, William, Westover, Alek

“… We present an in-place algorithm for the partition problem that has linear work and polylogarithmic span …”
Volltext

Lazy-Merge: A Novel Implementation for Indexed Parallel K -Way In-Place Merging von Salah, Ahmad, Kenli Li, Keqin Li

“… In this research, we propose Lazy-Merge, a novel implementation of sequential in-place k-way merging algorithms, that can be utilized in their parallel counterparts …”
Volltext

In-place algorithms for computing a largest clique in geometric intersection graphs von De, Minati, Nandy, Subhas C., Roy, Sasanka

“… In this paper, we study the problem of designing in-place algorithms for finding the maximum clique in the intersection graphs of axis-parallel rectangles and disks in R2 …”
Volltext

Efficient in-place sorting algorithms using feasible parallel machine models von Zheng, S.Q., Calidas, B., Yanjung Zhang

“… We present a simple and general parallel sorting scheme, ZZ-sort, which can be used to derive a class of efficient in-place sorting algorithms on realistic parallel machine models …”
Volltext

Lazy-Merge: A Novel Implementation for Indexed Parallel -Way In-Place Merging von Salah, Ahmad, Li, Kenli, Li, Keqin

“… In this research, we propose Lazy-Merge, a novel implementation of sequential in-place [Formula Omitted]-way merging algorithms, that can be utilized in their parallel counterparts …”
Volltext

PARMA-CC: A family of parallel multiphase approximate cluster combining algorithms von Keramatian, Amir, Gulisano, Vincenzo, Papatriantafilou, Marina, Tsigas, Philippas

“… ) demand for efficient data clustering algorithms that can effectively utilize the increasing computational capacities of modern hardware …”
Volltext

Towards Parallel Learned Sorting von Carvalho, Ivan

“… We introduce the In-Place Parallel Learned Sort (IPLS) algorithm and compare it extensively against other sorting approaches …”
Volltext

Parallel hybrid bispectrum-multi-frame blind deconvolution image reconstruction technique von Hajmohammadi, Solmaz, Nooshabadi, Saeid, Archer, Glen E., Bos, J. P., Struther, Allan

“… The bispectrum SI technique is used in place of the multi-frame ensemble averaging to initialize the iterative parallel MFBD algorithm …”
Volltext

Fast in-place, comparison-based sorting with CUDA: a study with bitonic sort von Peters, Hagen, Schulz-Hildebrandt, Ole, Luttenberger, Norbert

“… ) there is a demand for high‐performance parallel sorting algorithms that fit with the characteristics of the modern GPU‐architecture. We present a high‐performance …”
Volltext

An efficient parallel-processing method for transposing large matrices in place von Portnoff, M.R.

“… We have developed an efficient algorithm for transposing large matrices in place …”
Volltext

Incremental feature selection: Parallel approach with local neighborhood rough sets and composite entropy von Xu, Weihua, Ye, Weirui

“… However, traditional rough set-based feature selection algorithms encounter significant challenges, especially when processing large-scale incremental data and adapting to the dynamic nature of real …”
Volltext

An in-place min–max priority search tree von De, Minati, Maheshwari, Anil, Nandy, Subhas C., Smid, Michiel

“… We show that this data structure can be made in-place, i.e., it can be stored in an array such that each entry stores only one point of the point set and no entry is stored in more than one location of that array …”
Volltext

Tunnel: Parallel-inducing sort for large string analytics von Du, Zhihui, Zhang, Sen, Bader, David A.

Volltext

An Algorithm for the Sequence Alignment with Gap Penalty Problem using Multiway Divide-and-Conquer and Matrix Transposition von Shubham, Prakash, Surya, Ganapathi, Pramod

“… We present a cache-efficient parallel algorithm for the sequence alignment with gap penalty problem for shared-memory machines using multiway divide-and-conquer and not-in-place matrix transposition. Our r …”
Volltext