1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DC2026
CREDIT: Cost-guided Reduction-reuse with Efficient DSMEM Inter-CTA Tiling
Zhengxiong Li, Tsung-Wei Huang, Umit Ogras
NVIDIA distributed shared memory (DSMEM) enables direct shared-memory access within a thread block cluster. However, cluster synchronization, remote access, and resource costs make…
cs.MA2024★ 1 cited
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search
Shao-Hung Chan, Zhe Chen, Dian-Lun Lin +5
Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths for multiple agents in a shared environment while minimizing the sum of travel time. Since s…