Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICDE.2005.248 | ICDE Workshops |
Keywords | Field | DocType |
new dynamic load balancing,cache-based random steal schema,100-scale pc cluster,parallel modified prefixspan,effective speed-up ratio,master-worker paradigm,dynamic load balancing,new dynamic load,worker paradigm,frequent pattern,speed-up ratio,organisms,proteins,clustering algorithms,amino acid sequence,amino acids,process control,databases | Load management,PrefixSpan,Computer science,Cache,Process control,Dynamic load balancing,Cluster analysis,Database | Conference |
ISBN | Citations | PageRank |
0-7695-2657-8 | 3 | 0.44 |
References | Authors | |
1 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Makoto Takaki | 1 | 11 | 2.76 |
| Keiichi Tamura | 2 | 37 | 13.86 |
| Toshihide Sutou | 3 | 4 | 0.79 |
| H. Kitakami | 4 | 94 | 49.68 |