Search Results - parallel in-place algorithms

HI-FFT: Heterogeneous Parallel In-place Algorithm for Large-scale 2D-FFT by 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…”
Get full text

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

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

Fast In-Place Suffix Sorting on a Multicore Computer by 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…”
Get full text

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

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

PI-sqrt: novel parallel implementations of in-place sequence rotation on multicore systems by 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…”
Get full text

NDPA: A generalized efficient parallel in-place N-Dimensional Permutation Algorithm by 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…”
Get full text

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

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

Lazy-Merge: A Novel Implementation for Indexed Parallel K -Way In-Place Merging by 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…”
Get full text

In-place algorithms for computing a largest clique in geometric intersection graphs by 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…”
Get full text

Efficient in-place sorting algorithms using feasible parallel machine models by 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…”
Get full text

Lazy-Merge: A Novel Implementation for Indexed Parallel -Way In-Place Merging by 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…”
Get full text

PARMA-CC: A family of parallel multiphase approximate cluster combining algorithms by 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…”
Get full text

Towards Parallel Learned Sorting by Carvalho, Ivan

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

Parallel hybrid bispectrum-multi-frame blind deconvolution image reconstruction technique by 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…”
Get full text

Fast in-place, comparison-based sorting with CUDA: a study with bitonic sort by 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…”
Get full text

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

“…We have developed an efficient algorithm for transposing large matrices in place…”
Get full text

Incremental feature selection: Parallel approach with local neighborhood rough sets and composite entropy by 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…”
Get full text

An in-place min–max priority search tree by 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…”
Get full text

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

Get full text

An Algorithm for the Sequence Alignment with Gap Penalty Problem using Multiway Divide-and-Conquer and Matrix Transposition by 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…”
Get full text