现在主流的分区算法大都是基于 radix-cluster algorithm[1] 及其衍生对输入进行分区。 ❝ 现在的 join 算法为提高性能,基本都是想着如何充分发挥硬件的特性,比如线程,NUMA 内存分配特性,SIMD,TLB entries、cache lines等。 ❞ 本文只是作为后续 JOIN 算法的一个铺垫,因此主要介绍 radix-cluster algorithm 本身,...
SpMV is a key linear algebra algorithm and has been widely used in many important application domains. As a result, numerous attempts have been made to optimize SpMV on GPUs to leverage their massive computational throughput. Although the previous work has shown impressive progress, load imbalance ...
Defeating duplicates: A re-design of the LearnedSort algorithm (aiXiv 2021) Towards Parallel Learned Sorting (arXiv 2022) Join SkinnerDB : Regret-Bounded Query Evaluation via Reinforcement Learning (VLDB 2018) The Case for Learned In-Memory Joins (arXiv 2021) Adaptive Query Processing Eddies: Co...
85 《An Adaptive Throughput-First Packet Scheduling Algorithm for DPDK-Based Packet Processing Systems》 《一种基于dpdq的自适应吞吐量优先包调度算法》 unknown 86 《A Scriptable High-Speed Packet Generator》 《一个可编写脚本的高速数据包生成器》 慕尼黑技术大学 87 《A Software NIC to Augment Hardware...
67 《Selecting a Hashing Algorithm》 《选择哈希算法》 坎特伯雷大学计算机科学系 68 《Social Hash Partitioner A Scalable Distributed Hypergraph Partitioner》 《社会哈希分区器一个可扩展的分布式超图分区器》 facebook 69 《Specification of Red-Black Trees》 《红黑树规格》 实验研讨会,爱丁堡 70 《Swiped Anal...
Given a reconfiguration ordering which violates the desired specifications, our algorithm automatically identifies the problematic commands so that it can avoid this particular order in the next iteration. We fully implemented Snowcap and extensively evaluated its scalability and effectiveness on real-world...
The author describes five algorithms that clearly illustrate how the scan primitives can be used in algorithm design: a radix-sort algorithm, a quicksort algorithm, a minimum-spanning-tree algorithm, a line-drawing algorithm, and a merging algorithm. These all run on an EREW (exclusive read, ...
While generally subefficient on large sequences compared to algorithms with better asymptotic algorithmic complexity (i.e. merge sort or radix sort), may be the algorithms of choice for sorting batches of short- to mid-sized (key, value) array pairs. Refer to the excellent tutorial by H. W...
Defeating duplicates: A re-design of the LearnedSort algorithm (aiXiv 2021) Towards Parallel Learned Sorting (arXiv 2022) Join SkinnerDB : Regret-Bounded Query Evaluation via Reinforcement Learning (VLDB 2018) The Case for Learned In-Memory Joins (arXiv 2021) Adaptive Query Processing Eddies: Co...
85 《An Adaptive Throughput-First Packet Scheduling Algorithm for DPDK-Based Packet Processing Systems》 《一种基于dpdq的自适应吞吐量优先包调度算法》 unknown 86 《A Scriptable High-Speed Packet Generator》 《一个可编写脚本的高速数据包生成器》 慕尼黑技术大学 87 《A Software NIC to Augment Hardware...