New Dynamic Load Balancing for Parallel Modified PrefixSpan
New Dynamic Load Balancing for Parallel Modified PrefixSpan
复制标题
并行修改的 PrefixSpan 的新动态负载平衡
DOI：
10.1109/icde.2005.248
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
H. Kitakami
中科院分区：
文献类型：
--
作者：
Makoto Takaki;Keiichi Tamura;T. Sutou;H. Kitakami
从氨基酸序列中的常见模式中发现一种具有特征的模式。为了快速提取频繁模式，提出了一种基于主-工模式的并行改进PrefixSpan算法。然而，当PC数量增加时，主-工作模式具有性能限制。为了解决这一缺点，分布式工作者范例适用于并行修改的前缀跨度。为了获得有效的加速比，我们提出了一种新的动态负载平衡。动态负载平衡的特点是小粒度任务和基于Cache的随机窃取模式。当使用100规模的PC集群时，实验结果显示加速比为95倍。
A motif that is a featured pattern is discovered from the frequent patterns in amino acid sequences. To extract frequent patterns at high speed, a parallel Modified PrefixSpan with a master-worker paradigm was proposed. However, a master-worker paradigm has a performance limitation when the number of PCs increases. To address this disadvantage, the distributed worker paradigm is adapted to the parallel Modified PrefixSpan. In order to obtain an effective speed-up ratio, we propose a new dynamic load balancing. The characteristics of dynamic load balancing are a smallgrain task and a Cache-based Random Steal schema. When a 100-scale PC cluster was used, the experimental results showed a speed-up ratio of 95 times.