The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW) (2005)
Tokyo, Japan
Apr. 5, 2005 to Apr. 8, 2005
ISBN: 0-7695-2657-8
pp: 1243
Keiichi Tamura , Hiroshima City University
Toshihide Sutou , Hiroshima City University
Makoto Takaki , Hiroshima City University
Hajime Kitakami , Hiroshima City University
ABSTRACT
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.
INDEX TERMS
null
CITATION
Keiichi Tamura, Toshihide Sutou, Makoto Takaki, Hajime Kitakami, "New Dynamic Load Balancing for Parallel Modified PrefixSpan", 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW), vol. 00, no. , pp. 1243, 2005, doi:10.1109/ICDE.2005.248
100 ms
(Ver )