loading...
New Dynamic Load Balancing for Parallel Modified PrefixSpan
Tokyo, Japan April 05-April 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.24821st International Conference on Data ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Makoto Takaki, Hiroshima City University
Keiichi Tamura, Hiroshima City University
Toshihide Sutou, Hiroshima City University
Hajime Kitakami, Hiroshima City University
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.
Citation:
Makoto Takaki, Keiichi Tamura, Toshihide Sutou, Hajime Kitakami, "New Dynamic Load Balancing for Parallel Modified PrefixSpan," icdew, pp.1243, 21st International Conference on Data Engineering Workshops (ICDEW'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions