Multithreading for degree controllable parallel string pattern matching with k-mismatches

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04

Volumn 2, Issue , 2004, Pages 623-629

  Park, Jin Hwan ^a  

^a STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

Approximate string matching; Broadcasting; K mismatches; Multithreading; Parallelism

Indexed keywords

ALGORITHMS; BIOLOGY; BROADCASTING; COMPUTER SOFTWARE; ERROR CORRECTION; JAVA PROGRAMMING LANGUAGE; MATHEMATICAL MODELS; SPEECH RECOGNITION;

APPROXIMATE STRING MATCHING; K-MISMATCHES; MULTITHREADING; PARALLELISM;

PATTERN MATCHING;

EID: 11844303025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Ricardo Baeza and G. H. Gonnet, "A New Approach to Text Searching," Comm. ACM, Vol. 35, pp. 74-81, Oct. 1992.
2. A. A. Bertossi, F. Luccio, L. Pagli, and E. Lodi, "A Parallel Solution to the Approximate String Matching Problem," The Computer Journal, Vol. 35, pp. 524-526, 1992.
3. Dany Breslauer and Zvi Galil, "An Optimal O(log log n) Time Parallel String Matching Algorithm," Siam J. Comput., Vol. 19, pp. 1051-1058, Dec. 1990.
4. P. Brinch-Hanson, "Java's Insecure Parallelism," ACM SIGPLAN Notices, 34, 4, pp. 38-45, April 1999.
5. Rajkumar Buyya, High Performance Cluster Computing, Prentice Hall, 1999.
6. H. D. Cheng and K. S. Fu, "VLSI Architecture for String Matching and Pattern Matching," Pattern Recognition, Vol. 20, pp. 125-141, 1987.
7. Z. Ding and L. Yang, "Concurrent Object-Oriented Data Flow Diagrams," Proceedings of 2001 International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 1315-1321, June 2001.
8. Bradly Fawcett, Reconfiguring a computing pattern, Electronic Engineering Times, Manhasset, April 1995.
9. M. J. Foster and H. T. Kung, "The Design of Special-Purpose VLSI Chips," Computer, pp. 26-38, Jan. 1980.
10. Zvi Galil and R. Giancarlo, "Improved String Matching with K Mismatches," SIGACT News 17, pp. 52-54, 1986.
11. Zvi Galil, "A Constant-Time Optimal Parallel String-Matching Algorithm," Journal of the ACM, Vol. 42, pp. 908-918, July 1995.
12. Merrill E. Isenman and Dennis E. Shasha, "Performance and Architectural Issues for String Matching," IEEE Trans. on Computers, Vol. 39, No. 2, pp. 238-250, Feb. 1990.
13. Pettery Jokinen, Jorma Tarhio and Esko Ukkonen, "A Comparison of Approximate String Matching Algorithms," Software-Practice and Experience, Vol. 26, pp. 1439-1457, Dec. 1996.
14. I. H. Kazi, et al., "A Speculative Thread Pipelining Parallelization Model for Java," Proc. Intl. Parallel and Dist. Proc. Symposium, pp. 559-64, May 2000.
15. G. Landau and U. Vishkin, "Efficient String Matching with K Mismatches," Theoretical Comput. Sci., 43, pp. 239-249, 1986.
16. Thierry Lecroq, "Experimental Results on String Matching Algorithms," Software-Practice and Experience, Vol. 25, pp. 727-765, Jul. 1995.
17. Bil Lewis and Daniel Berg, Threads Primer, Prentice Hall, 1996.
18. Yen-Chun Lin, "An Efficient Systolic Algorithm for the Longest Common Subsequent Problem," The Journal of Supercomputing, 12:373-385, 1998.
19. Daniel P. Lopresti, P-NAC: a systolic array for comparing nucleic acid sequences, Computer, July 1987, pp. 98-99.
20. Amar Mukherjee, "Hardware Algorithms for Determining Similarity Between Two Strings," IEEE Trans. on Computers, Vol. 38, No. 4, pp. 600-603, April 1989.
21. Amar Mukhopadhyay, "Hardware Algorithms for Nonnumeric Computation," IEEE trans. on Computers, Vol. C-28, No. 6, pp. 384-394, June 1979.
22. Jin H. Park and K. M. George, "Efficient Parallel Hardware Algorithms for String Matching," Microprocessors and Microsystems, vol. 23, No. 3, pp. 155-168, Oct. 1999.
23. Jin H. Park and Kyung H. Ju, "An Experimental Result on Java Threads for High Performance Computation," Proceedings of the 2002 International Conference on Paralle and Distributed Processing Techniques and Applications, pp. 997-1003, Las Vegas, NV, June 2002.
24. Jin H. Park and K. Li, "Parallel Broadcasting Scheme for Approximate String Matching with k-Mismatches," High Performance Computing Systems and Applications, Ch. 24, pp. 355-374, Kluwer Academic Publishers, 2002.
25. Raghu Sastry, N. Ranganathan, "A Systolic Array for Approximate String Matching," Proc. Int'l Conf. Computer Design, pp. 402-405, Cambridge, Mass., 1993.
26. Raghu Sastry, N. Ranganathan, and Klinton Remedios, "CASM: A VLSI Chip for Approximate String Matching," IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. 17, pp. 824-830, Aug. 1995
27. Jorma Tarhio and Esko Ukkonen, "Approximate Boyer-Moore String Matching," Siam J. Comput., Vol. 22, pp. 243-260, April 1993.
28. Robert A. Wagner, "The String-to-String Correction Problem," Journal of the ACM, Vol. 21, pp. 168-173, Jan. 1974.
29. P. Welch, "Java Threads in the Light of 0ccam/CSP," Architectures, Languages and Patterns for Parallel and Dist. Applications, WotUG-21, IOS Press, 1998.
30. Sun Wu and Udi Manber, "Fast Text Searching Allowing Errors," Comm. ACM, Vol. 35, pp. 83-91, Oct. 1992.