On the public citation graph
Fast, Scalable Parallel Comparison Sort on Hybrid Multicore Architectures
0 signed · 36 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/cpe.1686openalex-snapshot
Fast in‐place, comparison‐based sorting with CUDA: a study with bitonic sort
inferredcites →https://doi.org/10.1006/jpdc.1998.1462openalex-snapshot
A Randomized Parallel Sorting Algorithm with an Experimental Study
inferredcites →https://doi.org/10.1007/978-3-642-14390-8_42openalex-snapshot
Fast In-Place Sorting with CUDA Based on Bitonic Sort
inferredcites →https://doi.org/10.1016/j.jpdc.2008.05.012openalex-snapshot
Fast parallel GPU-sorting using a hybrid algorithm
inferredcites →https://doi.org/10.1049/cce:19910064openalex-snapshot
Vector Models for Data-Parallel Computing
inferredcites →https://doi.org/10.1109/hipc.2010.5713164openalex-snapshot
GRS — GPU radix sort for multifield records
inferredcites →https://doi.org/10.1109/inpar.2012.6339592openalex-snapshot
Efficient parallel merge sort for fixed and variable length keys
inferredcites →https://doi.org/10.1109/ipdps.2009.5161005openalex-snapshot
Designing efficient sorting algorithms for manycore GPUs
inferredcites →https://doi.org/10.1109/ipdps.2010.5470455openalex-snapshot
Optimization of linked list prefix computations on multithreaded GPUs using CUDA
inferredcites →https://doi.org/10.1109/iscc.2010.5546734openalex-snapshot
Sorting large records on a cell broadband engine
inferredcites →https://doi.org/10.1109/superc.1992.236714openalex-snapshot
An improved supercomputer sorting benchmark
inferredcites →https://doi.org/10.1145/1230100.1230105openalex-snapshot
Efficient histogram generation using scattering on GPUs
inferredcites →https://doi.org/10.1145/125826.126164openalex-snapshot
Radix sort for vector multiprocessors
inferredcites →https://doi.org/10.1145/1365490.1365500openalex-snapshot
Scalable Parallel Programming with CUDA
inferredcites →https://doi.org/10.1145/1401132.1401152openalex-snapshot
Scalable parallel programming with CUDA
inferredcites →https://doi.org/10.1145/1542275.1542311openalex-snapshot
Fast and scalable list ranking on the GPU
inferredcites →https://doi.org/10.1145/1815961.1816021openalex-snapshot
Debunking the 100X GPU vs. CPU myth
inferredcites →https://doi.org/10.1145/1854273.1854344openalex-snapshot
Revisiting sorting for GPGPU stream architectures
inferredcites →https://doi.org/10.2312/eggh/eggh07/097-106openalex-snapshot
Scan Primitives for GPU Computing
inferredcites →https://doi.org/10.5555/147877.147896openalex-snapshot
An improved supercomputer sorting benchmark
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.3865openalex-snapshot
Kepler GPU accelerated recursive sorting using dynamic parallelism
inferred← citeshttps://doi.org/10.1007/978-981-97-5703-9_8openalex-snapshot
A Comparative Analysis of Sorting Algorithms for Large-Scale Data: Performance Metrics and Language Efficiency
inferred← citeshttps://doi.org/10.1109/hipc.2013.6799129openalex-snapshot
Can GPUs sort strings efficiently?
inferred← citeshttps://doi.org/10.1109/ichpca.2014.7045312openalex-snapshot
String sorting on multi and many-threaded architectures: A comparative study
inferred← citeshttps://doi.org/10.1109/icpp.2017.14openalex-snapshot
Nearly Balanced Work Partitioning for Heterogeneous Algorithms
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.25openalex-snapshot
A Novel Heterogeneous Framework for Local Dependency Dynamic Programming Problems
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.29openalex-snapshot
A Novel Heterogeneous Algorithm for Multiplying Scale-Free Sparse Matrices
inferred← citeshttps://doi.org/10.1109/tcad.2021.3131554openalex-snapshot
Worst Case O(N) Comparison-Free Hardware Sorting Engine
inferred← citeshttps://doi.org/10.1109/tcad.2022.3207689openalex-snapshot
k-Degree Parallel Comparison-Free Hardware Sorter for Complete Sorting
inferred← citeshttps://doi.org/10.1145/2675744.2675749openalex-snapshot
Architecture- and workload- aware heterogeneous algorithms for sparse matrix vector multiplication
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.