显而易见地，这三种解决办法全都存在局限性，因此传统缓冲区内存管理方法并不是适合编写大规模交互软件代码的机制。
Clearly, all three solutions present limitations and the conventional buffer memory management approach is not a good mechanism for coding large-scale interacting software.
(在集群中，这也称为大规模并行处理器(massively parallel processor, MPP)，它们并不需要共享内存；稍后我们将更详细介绍这方面的内容。)
(in clusters, also known as massively parallel processors (MPPs), they don't share the same memory; we will look at this in more detail.)
在部分后缀树的基础上提出了后缀树的并行算法，解决了后缀树在应用上的内存瓶颈问题，因此更适合大规模的序列分析。
Then based on partial suffix tree, presents a new parallel algorithm of suffix tree, which can construction large suffix tree in memory and more perfect to very large sequences.
应用推荐