The Community for Technology Leaders
RSS Icon
Issue No.06 - June (2012 vol.61)
pp: 857-869
Souradip Sarkar , Washington State University, Pullman
Partha Pratim Pande , Washington State University, Pullman
Turbo Majumder , Washington State University, Pullman
Maximum Parsimony phylogenetic tree reconstruction is based on finding the breakpoint median, given a set of species, and is represented by a bounded edge-weight graph model. This reduces the breakpoint median problem to one of solving multiple instances of the Traveling Salesman Problem (TSP), which is a classical NP-complete problem in graph theory. Exponential time algorithms that apply efficient runtime heuristics, such as branch-and-bound, to dynamically prune the search space are used to solve TSP. In this paper, we present the design and performance evaluation of a network-on-chip (NoC)-based implementation for solving TSP under the bounded edge-weight model, as used in the computation of breakpoint phylogeny. Our approach takes advantage of fine-grain parallelism from the multiple processing elements (PEs) and uses efficient NoC architecture for inter-PE communication. To accelerate the application on hardware, our PE design optimizes a particular lower bound calculation operation which typically tends to be the serial bottleneck in computation of a TSP solution. We also explore two representative NoC architectures—mesh and quad-tree—and show that the latter is more energy-efficient for this application domain. Experimental results show that this new implementation is able to achieve speedups of up to three orders of magnitude over state-of-the-art multithreaded software implementations.
Phylogenetics, breakpoint-median problem, maximum parsimony, traveling salesman problem.
Souradip Sarkar, Partha Pratim Pande, Turbo Majumder, "NoC-Based Hardware Accelerator for Breakpoint Phylogeny", IEEE Transactions on Computers, vol.61, no. 6, pp. 857-869, June 2012, doi:10.1109/TC.2011.100
[1] D.A. Bader and M. Yan, “High-Performance Phylogeny Reconstruction,” Handbook of Computational Molecular Biology, S. Aluru, ed., Chapman & Hall/CRC, 2005.
[2] P.H. Harvey and M.D. Pagel, The Comparative Method in Evolutionary Biology. Oxford Univ. Press, 1991.
[3] M. Blanchette, G. Bourque, and D. Sankoff, “Breakpoint Phylogenies,” Proc. Genome Informatics Workshop, pp. 25-34, 1997.
[4] E.L. Lawler, J. Lenstra, A.R. Kan, and D. Shmoys, The Traveling Salesman Problem. John Wiley, 1985.
[5] I. Pe'er and R. Shamir, “The Median Problems for Breakpoints Are NP-Complete,” Proc. Electronic Colloquium on Computational Complexity, vol. 5, no. 71, 1998.
[6] J. Tang et al., “Phylogenetic Reconstruction from Arbitrary Gene-Order Data,” Proc. Fourth IEEE Symp. Bioinformatics and Bioeng., pp. 592-599, 2004.
[7] J. Bakos and P. Elenis, “A Special-Purpose Architecture for Solving the Breakpoint Median Problem,” IEEE Trans. Very Large Scale Integration Systems, vol. 16, no. 12, pp. 1666-1676, Dec. 2008.
[8] J. Bentley, “Fast Algorithms for Geometric Traveling Salesman Problems,” ORSA J. Computing, vol. 4, pp. 387-411, 1992.
[9] B. Golden, L. Bodin, T. Doyle, and W. Stewart, “Approximate Traveling Salesman Algorithms,” Operations Research, vol. 28, pp. 694-711, 1980.
[10] G. Reinelt, The Traveling Salesman Problem: Computational Solutions for TSP Applications, pp. 172-186. Springer-Verlag, 1994.
[11] S. Lin and B. Kernighan, “An Effective Heuristic Algorithm for the Traveling Salesman Problem,” Operations Research, vol. 21, pp. 498-516, 1973.
[12] P. Jog, J.Y. Suh, and D. Van Gucht, “Parallel Genetic Algorithms Applied to the Traveling Salesman Problem,” SIAM J. Optimization, vol. 1, no. 4, pp. 515-529, 1991.
[13] D.L. Miller and J.F. Pekny, “Results from a Parallel Branch and Bound Algorithm for the Asymmetric Traveling Salesman Problem,” Operations Research Letters, vol. 8, no. 3, pp. 129-135, 1989.
[14] M. Bellmore and G. Nemhauser, “The Traveling Salesman Problem: A Survey,” Operations Research, vol. 16, pp. 538-558, 1968.
[15] E. Horowitz and S. Sahni, “Branch-and-Bound,” Fundamentals of Computer Algorithms, pp. 370-421, Computer Science Press, 1984.
[16] T.S.T. Mak and K.P. Lam, “High Speed GAML-Based Phylogenetic Tree Reconstruction Using HW/SW Codesign,” Proc. IEEE Bioinformatics Conf., pp. 470-473, 2003.
[17] N. Alachiotis et al., “Exploring FPGAs for Accelerating the Phylogenetic Likelihood Function,” Proc. IEEE Int'l Symp. Parallel and Distributed Processing, pp 1-8, 2009.
[18] S. Zierke and J.D. Bakos, “FPGA Acceleration of the Phylogenetic Likelihood Function for Bayesian MCMC Inference Methods,” BMC Bioinformatics, vol. 11, no. 1, pp. 1-12, 2010.
[19] F. Patas et al., “Fine-Grain Parallelism Using Multi-Core, Cell/BE, and GPU Systems: Accelerating the Phylogenetic Likelihood Function,” Proc. Int'l Conf. Parallel Processing, pp. 9-17, 2009.
[20] R. Marculescu et al., “Outstanding Research Problems in NoC Design: System, Microarchitecture, and Circuit Perspectives,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 28, no. 1, pp. 3-21, Jan. 2009.
[21] K. Lee, S.J. Lee, and H.J. Yoo, “Low-Power Network-on-Chip for High-Performance SoC Design,” IEEE Trans. Very Large Scale Integration Systems, vol. 14, no. 2, pp. 148-160, Feb. 2006.
[22] L. Bononi and N. Concer, “Simulation and Analysis of Network on Chip Architectures: Ring, Spidergon and 2D Mesh,” Proc. Design, Automation and Test in Europe, pp. 154-159, 2006.
[23] Circuits Multi-Projects (http:/ Last Date Accessed: Mar. 2011.
[24] NCBI Database for Eukaryotic Organelles (http://www.ncbi. Eukaryotae%20Organelles ). Last Date Accessed: Mar. 2011.
[25] Genome Evolution Laboratory - Mauve Genome Alignment Software (http://asap.ahabs.wisc.edumauve/). Last Date Accessed: Mar. 2011.
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool