Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/2340646.2340658guidebooksArticle/Chapter ViewAbstractPublication PagesBookacm-pubtype
chapter

GPU accelerated computation of the longest common subsequence

Published: 01 January 2012 Publication History
  • Get Citation Alerts
  • Abstract

    The longest common subsequence (LCS for short) for given two strings has various applications, e.g. comparison of DNAs. In this paper, we propose a GPU algorithm to accelerate Hirschberg's CPU LCS algorithm improved using Crochemore et al's bit-parallel CPU algorithm. Crochemore's algorithm includes bitwise logical operators which can be computed in embarrassingly parallel. However, it also includes an operator with less parallelism, i.e. an arithmetic sum. In this paper, we focus on how to implement these operators efficiently in parallel. Our experiments with 2.93GHz Intel Core i3 530 CPU, GeForce 8800 GTX, GTX 285, and GTX 480 GPUs show that the proposed algorithm runs maximum 12.77 times faster than the bit-parallel CPU algorithm and maximum 76.5 times faster than Hirschberg's LCS CPU algorithm. Furthermore, the proposed algorithm runs 10.9 to 18.1 times faster than Kloetzli's existing GPU algorithm.

    References

    [1]
    Crochemore, M., Iliopoulos, C. S., Pinzon, Y. J., Reid, J. F.: A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence Problem. Information Processing Letters 80(6), 279-285 (2001)
    [2]
    Garland, M., Kirk, D. B.: Understanding Throughput-Oriented Architectures. Communications of the ACM 53(11), 58-66 (2010)
    [3]
    Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)
    [4]
    Hirschberg, D. S.: A Linear Space Algorithm for Computing Maximal Common Subsequences. Communications of the ACM 18(6), 341-343 (1975)
    [5]
    Kirk, D. B., Hwu, W. W.: Programming Massively Parallel Processors: A Hands-on Approach. Morgan Kaufmann (2010)
    [6]
    Kloetzli, J., Strege, B., Decker, J., Olano, M.: Parallel Longest Common Subsequence Using Graphics Hardware. In: Proc. of the 8th Eurographics Symposium on Parallel Graphics and Visualization, EGPGV (2008)
    [7]
    Lindholm, E., Nickolls, J., Oberman, S., Montrym, J.: NVIDIA Tesla: A Unified Graphics and Computing Architecture. IEEE Micro 28(2), 39-55 (2008)
    [8]
    Sanders, J., Kandrot, E.: CUDA by Example: An Introduction to General-Purpose GPU Programming. Addison-Wesley Professional (2010)
    [9]
    Sklansky, J.: Conditional-Sum Addition Logic. IRE Trans. on Electronic Computers EC-9, 226-231 (1960)
    [10]
    Vai, M.: VLSI Design. CRC Press (2000)

    Cited By

    View all
    • (2017)Using patterns of firing neurons in spiking neural networks for learning and early recognition of spatio-temporal patternsNeural Computing and Applications10.1007/s00521-016-2283-y28:5(881-897)Online publication date: 1-May-2017
    • (2014)Thread-cooperative, bit-parallel computation of levenshtein distance on GPUProceedings of the 28th ACM international conference on Supercomputing10.1145/2597652.2597677(103-112)Online publication date: 10-Jun-2014
    • (2014)Fast Longest Common Subsequence with General Integer Scoring Support on GPUsProceedings of Programming Models and Applications on Multicores and Manycores10.1145/2578948.2560690(92-102)Online publication date: 7-Feb-2014
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Guide books
    Facing the Multicore-Challenge II: aspects of new paradigms and technologies in parallel computing
    January 2012
    171 pages
    ISBN:9783642303968
    • Editors:
    • Rainer Keller,
    • David Kramer,
    • Jan-Philipp Weiss

    Publisher

    Springer-Verlag

    Berlin, Heidelberg

    Publication History

    Published: 01 January 2012

    Qualifiers

    • Chapter

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 10 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2017)Using patterns of firing neurons in spiking neural networks for learning and early recognition of spatio-temporal patternsNeural Computing and Applications10.1007/s00521-016-2283-y28:5(881-897)Online publication date: 1-May-2017
    • (2014)Thread-cooperative, bit-parallel computation of levenshtein distance on GPUProceedings of the 28th ACM international conference on Supercomputing10.1145/2597652.2597677(103-112)Online publication date: 10-Jun-2014
    • (2014)Fast Longest Common Subsequence with General Integer Scoring Support on GPUsProceedings of Programming Models and Applications on Multicores and Manycores10.1145/2578948.2560690(92-102)Online publication date: 7-Feb-2014
    • (2014)Fast Longest Common Subsequence with General Integer Scoring Support on GPUsProceedings of Programming Models and Applications on Multicores and Manycores10.1145/2560683.2560690(92-102)Online publication date: 7-Feb-2014
    • (2014)CULZSS-bitProceedings of the 2014 International Workshop on Data Intensive Scalable Computing Systems10.1109/DISCS.2014.9(57-64)Online publication date: 16-Nov-2014

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media