next up previous
Next: Benefits and problems Up: DeepForest: a Molecular Evolutionary Previous: Automatic tree annotation from

Parallel execution

One of the most prominent features in DeepForest is parallel execution. Parallel execution can provide speedup effect depending on number of available processors. Of course, regardless of the number of processors, the rate of speedup is limited by the following equation [Geenlaw et al., 1995]:


\begin{displaymath}\frac{\mbox{(best sequential time)}}{\mbox{(number of processors)}}
\leq \mbox{(parallel time)}
\end{displaymath} (1.11)

Unlike ordinal procedural languages, however, DeepForest has flexibility in parallel execution. We can easily modify strategy for actual parallel execution without changing algorithm itself. Therefore, it is possible to drastically improve the efficiency in terms of computational time if we give optimized condition in the system. For details, refer to KLIC documents recently publicized on web sites:

KL1 tutorial
ftp://klic.icot.or.jp/pub/klic/contrib/tutorial/klic-intro.ppt
Inside KLIC
ftp://klic.icot.or.jp/pub/klic/contrib/tutorial/inside.tgz (LaTeX version), ftp://klic.icot.or.jp/pub/klic/contrib/tutorial/inside.ps.gz (Postscript version),
http://www.icot.or.jp/AITEC/COLUMN/KLIC/inside/index.html (HTML version)



 

Satoshi OOta
1999-03-06