在内部，相关数据通过指针被拷贝到动态分贝的内存上。
Internally the data referenced by the pointer is copied into dynamically allocated memory.
并根据C语言结构功能强的特点，采用结构指针及链表、队列等动态数据结构，使整个算法具有节省内存、快速省时的特点。
Applying structure pointer and dynamic data structure, such as the linked list and queue in c, we have made the working software executed with less memory requirement and time overhead.
同时设计了相应的数据结构，克服了CUDA没有指针、不能动态申请资源、尽量避免同步操作等问题。
Proper data structure is designed to solve the problems such as CUDA does not support pointer, dynamically memory allocating and to avoid synchronization as much as possible.
应用推荐