This paper discusses the parallelmerging sorting algorithm for hypercube architecture. Based on the analysis of communication complexity, the speedup of this algorithm is derived.
本文讨论超立方体结构上的并行归并排序算法，着重分析算法的通信复杂性，在此基础上推导算法的加速比。
2
Model ancestry is used for comparison purposes when parallel development requires merging two sets of changes into a single final version of the model.
当并行开发需要将两个系列的变更合并为模型的单个最终版本时，就需要模型起始以进行比较了。
3
Allow parallel development and manage merging from branches.