• DocumentCode
    2136331
  • Title

    Exploiting coarse-grained parallelism to accelerate protein motif finding with a network processor

  • Author

    Wun, Ben ; Buhler, Jeremy ; Crowley, Patrick

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Washington Univ., St. Louis, WA, USA
  • fYear
    2005
  • fDate
    17-21 Sept. 2005
  • Firstpage
    173
  • Lastpage
    184
  • Abstract
    While general-purpose processors have only recently employed chip multiprocessor (CMP) architectures, network processors (NPs) have used heterogeneous multi-core architectures since the late 1990s. NPs differ qualitatively from workstation and server CMPs in that they replicate many simple, highly efficient processor cores on a chip, rather than a small number of sophisticated superscalar CPUs. In this paper, we compare the performance of one such NP, the Intel IXP 2850, to that of the Intel Pentium 4 when executing a scientific computing workload with a high degree of thread-level parallelism. Our target program, HMMer, is a bioinformatics tool that identifies conserved motifs in protein sequences. HMMer represents motifs as hidden Markov models (HMMs) and spends most of its time executing the well-known Viterbi algorithm to align proteins to these models. Our observations of HMMer on the IXP are therefore relevant to computations in many other domains that rely on the Viterbi algorithm. We show that the IXP achieves a speedup of 1.82 over the Pentium, despite the Pentium´s 1.85x faster clock. Moreover, we argue that next-generation IXP NPs will likely provide a 10-20x speedup for our workload over the IXP 2850, in contrast to 5-1Ox speedup expected from a next-generation Pentium-based CMP.
  • Keywords
    biology computing; hidden Markov models; maximum likelihood estimation; multiprocessing systems; proteins; HMMer; Viterbi algorithm; bioinformatics tool; chip multiprocessor architectures; coarse-grained parallelism; general-purpose processors; hidden Markov models; multicore architectures; network processor; protein motif finding; protein sequences; thread-level parallelism; Acceleration; Bioinformatics; Clocks; Hidden Markov models; Network servers; Parallel processing; Proteins; Scientific computing; Viterbi algorithm; Workstations;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Architectures and Compilation Techniques, 2005. PACT 2005. 14th International Conference on
  • ISSN
    1089-795X
  • Print_ISBN
    0-7695-2429-X
  • Type

    conf

  • DOI
    10.1109/PACT.2005.21
  • Filename
    1515591