共 50 条
- [22] Efficient Hashing with Lookups in two Memory Accesses [J]. PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 830 - 839
- [23] Irregular accesses reorder unit: improving GPGPU memory coalescing for graph-based workloads [J]. The Journal of Supercomputing, 2023, 79 : 762 - 787
- [24] Irregular accesses reorder unit: improving GPGPU memory coalescing for graph-based workloads [J]. JOURNAL OF SUPERCOMPUTING, 2023, 79 (01): : 762 - 787
- [25] Smart-Cache: Optimising Memory Accesses for Arbitrary Boundaries and Stencils on FPGAs [J]. 2019 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2019, : 87 - 90
- [27] A GPGPU Compiler for Memory Optimization and Parallelism Management [J]. PLDI '10: PROCEEDINGS OF THE 2010 ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION, 2010, : 86 - 97
- [29] Incorporating selective victim cache into GPGPU for high-performance computing [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2017, 29 (24):