[Reading Notes] Wedege-Parallel Triangle Counting for GPUs
A novel GPU algorithm--WETRIC, counting triangles in static undirected sparse graphs.
A personal journal & research archive
Research · Notes · Projects · Fragments
ENTER / EXPLOREA novel GPU algorithm--WETRIC, counting triangles in static undirected sparse graphs.
Exact and scalable triangle counting on large-scale directed graphs, where triangles have seven different types determined by edge directions and the graph may be too large for a s
CoT (Chain-of-Thought) brings memory bottleneck (KV Cache), limits the practical deployment of LRMs (Large Reasoning Models) under constrained GPU resources.
A research project on triangle counting on multiple GPUs, with a focus on optimizing performance and scalability.
We have a slow, big target model M_p, inference from which we're trying to accelerate (distribution p(x)). We also have a quick, efficient approximation model M_q (distribution q(x
Read the record →Implement optimize4 to improve performance as much as possible without enabling O2 or changing the algorithm.
Read the record →使用Windows API CreateRemoteThread 远程注入模块到 crackme 进程中并且不崩溃,然后使用 ark 工具(例如 processhacker 等)能够查看注入模块的信息;
Read the record →I’m Akejyo. This is a place to think in public, keep useful questions, and make things slowly.
A little about me ↗Ride with things, let the mind roam.