High performance pattern matching with dynamic load balancing on heterogeneous systems

Proceedings - 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2006

Volumn 2006, Issue , 2006, Pages 285-290

  Park, Jin Hwan ^a   Demirdag, Bernard A ^a  

^a STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

Distributed processing; Dynamic load balancing; Multithreading; Parallelism; RMI; String matching

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER NETWORKS; JAVA PROGRAMMING LANGUAGE; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

DYNAMIC LOAD BALANCING; HETEROGENEOUS SYSTEMS; MULTITHREADING; STRING MATCHING;

PATTERN MATCHING;

EID: 33750202866     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDP.2006.41     Document Type: Conference Paper

References (19)

1. Ricardo Baeza and G. H. Gonnet, "A New Approach to Text Searching," Comm. ACM, Vol. 35, pp. 74-81, Oct. 1992.
2. 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.
3. Richard Cole, Ramesh Hariharan, Mike Paterson, and Uri Zwick, "Tighter Lower Bounds on the Exact Complexity of String Matching," Siam J. Comput., Vol. 24, pp. 30-45, Feb. 1995.
4. M. Foster and H. Kung,"The Design of Special-Purpose VLSI Chips," Computer, pp.26-38, Jan. 1980.
5. Zvi Galil and R. Giancarlo, "Improved String Matching with K Mismatches," SIGACT News 17, pp. 52-54, 1986.
6. Zvi Galil, "A Constant-Time Optimal Parallel String-Matching Algorithm," Journal of the ACM, Vol. 42, pp. 908-918, July 1995.
7. Hwang and Xu, Scallable Parallel Computing, McGraw Hill, 1988.
8. 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.
9. 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.
10. G. Landau and U. Vishkin, "Efficient String Matching with K Mismatches," Theoretical Comput. Sci., 43, pp. 239-249, 1986.
11. Thierry Lecroq, "Experimental Results on String Matching Algorithms," Software-Practice and Experience, Vol. 25, pp. 727-765, Jul. 1995.
12. Bil Lewis and Daniel Berg, Threads Primer, Prentice Hall, 1996.
13. M. L. Liu, Distributed Computing, Pearson Addison-Wesley, 2004.
14. Amar Mukhopadhyay, "Hardware Algorithms for Nonnumeric Computation," IEEE trans. on Computers, Vol. C-28, No. 6, pp. 384-394, June 1979.
15. Gonzalo Navarro and Mathieu Raffinot, Flexible Pattern Matching in Strings, Cambridge University Press, 2002.
16. 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.
17. th IASTED International Conference on Parallel and Distributed Computing and Systems, pp. 534-541, Cambridge, MA, Nov. 2004.
18. 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.
19. Robert A. Wagner, "The String-to-String Correction Problem," Journal of the ACM, Vol. 21, pp. 168-173, Jan. 1974.