born in 1997. PhD. Student member of CCF. His main research interests include high-performance computing, heterogeneous computing, and large-scale graph data processing
born in 1993. PhD, associate professor. Member of CCF. His main research interests include high-performance computing, parallel algorithm design and optimization, and graph computing
born in 1980. PhD, professor. Senior member of CCF. His main research interests include parallel programming and algorithms design, domain-specific architecture, bioinformatics, and big data
Graph pattern mining, as a core task for analyzing entity relationships, finds extensive applications in fields such as community detection and drug discovery. However, due to its non-polynomial time complexity, large-scale graph processing encounters challenges related to search space explosion and low computational efficiency. Existing GPU-accelerated solutions utilize parallel computing to enhance performance but often suffer from thread idleness caused by the power-law distribution of graph data and excessive CPU intervention in multi-GPU communication, which impede the full utilization of hardware capabilities. We present Saturn, a GPU-based graph pattern mining system, which overcomes the above bottlenecks through computation-communication co-optimization. At computation level, Saturn decouples the loading and querying phases of set operations, employs fine-grained parallel batch processing to dynamically adapt Hash and binary search algorithms, and optimizes memory access efficiency via shared memory caching, significantly improving thread utilization. At communication level, it establishes a CPU-free GPU communication model, leveraging high-bandwidth NVLink interconnect and unified memory mechanism for direct cross-device data access, while reducing redundant transmission and link contention through vertex caching and message aggregation scheduling. Experimental results demonstrate that Saturn outperforms state-of-the-art GPU-based graph mining systems on real-world datasets, achieving superior computational parallel efficiency and cross-device communication effectiveness for large-scale graph pattern mining tasks.
| 科 Family | 属数 Number of genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) | 属 Genus | 种数 Number of species | 占总种数比例 Percentage of total species (%) |
|---|---|---|---|---|---|---|
| 鹅膏菌科Amanitaceae | 2 | 11 | 5.26 | 鹅膏菌属 Amanita | 10 | 4.78 |
| 小菇科 Mycenaceae | 2 | 12 | 5.74 | 丝盖伞属 Inocybe | 5 | 2.39 |
| 多孔菌科 Polyporaceae | 8 | 14 | 6.70 | 蜡蘑属 Laccaria | 5 | 2.39 |
| 红菇科 Russulaceae | 3 | 23 | 11.00 | 小皮伞属 Marasmius | 6 | 2.87 |
| 小菇属 Mycena | 11 | 5.26 | ||||
| 光柄菇属 Pluteus | 5 | 2.39 | ||||
| 红菇属 Russula | 17 | 8.13 | ||||
| 栓菌属 Trametes | 5 | 2.39 |