算法通过运用线性存储器纹理解决了越界问题，并借助CUDA的共享内存以减少对全局内存的访问次数。
By using CUDA's texture from linear memory, over-bound accessing is avoided. For reducing access of global memory, the algorithm employs CUDA's Shared memory.
正是最后一个应用程序的谓词和最（最后一次）*日志（最后一次）掉期掉期如果有足够的存储器有内存不足或数线性。
Exactly last-first applications of the predicate and at most (last-first)*log(last-first) swaps if there is insufficient memory or linear number of swaps if sufficient memory is available.
在另一方面，本文致力于研究如何改进传统的基于线性偏差的地址交织策略来解决其存储器冗余和无法支持模寻址的问题。
On the other hand, we are aimed to remove the memory redundancy of the previous linear skewing interleave scheme and try to support modulo addressing.
在另一方面，本文致力于研究如何改进传统的基于线性偏差的地址交织策略来解决其存储器冗余和无法支持模寻址的问题。
On the other hand, we are aimed to remove the memory redundancy of the previous linear skewing interleave scheme and try to support modulo addressing.
应用推荐