Efficiency of parallel direct optimization.
Tremendous progress has been made at the level of sequential computation in phylogenetics. However, little attention has been paid to parallel computation. Parallel computing is particularly suited to phylogenetics because of the many ways large computational problems can be broken into parts that can be analyzed concurrently. In this paper, we investigate the scaling factors and efficiency of random addition and tree refinement strategies using the direct optimization software, POY, on a small (10 slave processors) and a large (256 slave processors) cluster of networked PCs running LINUX. These algorithms were tested on several data sets composed of DNA and morphology ranging from 40 to 500 taxa. Various algorithms in POY show fundamentally different properties within and between clusters. All algorithms are efficient on the small cluster for the 40-taxon data set. On the large cluster, multibuilding exhibits excellent parallel efficiency, whereas parallel building is inefficient. These results are independent of data set size. Branch swapping in parallel shows excellent speed-up for 16 slave processors on the large cluster. However, there is no appreciable speed-up for branch swapping with the further addition of slave processors (>16). This result is independent of data set size. Ratcheting in parallel is efficient with the addition of up to 32 processors in the large cluster. This result is independent of data set size.
Janies
D A
DA
Division of Invertebrate Zoology, American Museum of Natural History, New York, New York 10024, USA. djanies@amnh.org
Wheeler
W C
WC
D000465:Algorithms; D000818:Animals; D003205:Computing Methodologies; D007313:Insecta; D008116:Lizards; D019684:Magnoliopsida; D008322:Mammals; D009716:Numerical Analysis, Computer-Assisted; D010802:Phylogeny; D012984:Software