메뉴 건너뛰기




Volumn 16, Issue , 2004, Pages 534-541

Performance of portable shared memory based parallel string matching software

Author keywords

Broadcasting; K mismatches; Multithreading; Parallel string matching; SMP; Synchronization

Indexed keywords

BROADCASTING; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; DATA STORAGE EQUIPMENT; MATHEMATICAL MODELS; PROBLEM SOLVING; SYNCHRONIZATION;

EID: 11844253173     PISSN: 10272658     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (1)

References (27)
  • 1
    • 84976680267 scopus 로고
    • A new approach to text searching
    • Oct.
    • R. Baeza and G. H. Gonnet, "A New Approach to Text Searching," Comm. ACM, Vol. 35, pp. 74-81, Oct. 1992.
    • (1992) Comm. ACM , vol.35 , pp. 74-81
    • Baeza, R.1    Gonnet, G.H.2
  • 2
    • 11844269423 scopus 로고
    • A parallel solution to the approximate string matching problem
    • 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.
    • (1992) The Computer Journal , vol.35 , pp. 524-526
    • Bertossi, A.A.1    Luccio, F.2    Pagli, L.3    Lodi, E.4
  • 3
    • 0025631378 scopus 로고
    • An optimal O(log log n) time parallel string matching algorithm
    • Dec.
    • D. Breslauer and Z. Galil, "An Optimal O(log log n) Time Parallel String Matching Algorithm," Siam J. Comput., Vol. 19. pp. 1051-1058, Dec. 1990.
    • (1990) Siam J. Comput. , vol.19 , pp. 1051-1058
    • Breslauer, D.1    Galil, Z.2
  • 4
    • 0000562146 scopus 로고    scopus 로고
    • Java's insecure parallelism
    • April
    • P. Brinch-Hanson, "Java's Insecure Parallelism," ACM SIGPLAN Notices, 34, 4, pp. 38-45, April 1999.
    • (1999) ACM SIGPLAN Notices , vol.34 , Issue.4 , pp. 38-45
    • Brinch-Hanson, P.1
  • 5
    • 0023207478 scopus 로고
    • VLSI Architecture for string matching and pattern matching
    • H. D. Cheng and K. S. Fu, "VLSI Architecture for String Matching and Pattern Matching," Pattern Recognition, Vol. 20. pp. 125-141, 1987.
    • (1987) Pattern Recognition , vol.20 , pp. 125-141
    • Cheng, H.D.1    Fu, K.S.2
  • 6
    • 0029245659 scopus 로고
    • Tighter lower bounds on the exact complexity of string matching
    • Feb.
    • R. Cole, R. Hariharan, M. Paterson, and U. Zwick, "Tighter Lower Bounds on the Exact Complexity of String Matching," Siam J. Compt., Vol. 24, pp. 30-45, Feb. 1995.
    • (1995) Siam J. Compt. , vol.24 , pp. 30-45
    • Cole, R.1    Hariharan, R.2    Paterson, M.3    Zwick, U.4
  • 7
    • 0042084130 scopus 로고
    • The design of special-purpose VLSI chips
    • Jan.
    • M. J. Foster and H. T. Kung, "The Design of Special-Purpose VLSI Chips," Computer, pp. 26-38, Jan. 1980.
    • (1980) Computer , pp. 26-38
    • Foster, M.J.1    Kung, H.T.2
  • 8
    • 0345937600 scopus 로고
    • Improved string matching with K mismatches
    • Z. Galil and R. Giancarlo, "Improved String Matching with K Mismatches," SIGACT News 17, pp. 52-54, 1986.
    • (1986) SIGACT News , vol.17 , pp. 52-54
    • Galil, Z.1    Giancarlo, R.2
  • 9
    • 0029333262 scopus 로고
    • A constant-time optimal parallel string-matching algorithm
    • July
    • Z. Galil, "A Constant-Time Optimal Parallel String-Matching Algorithm," Journal of the ACM, Vol. 42, pp. 908-918, July 1995.
    • (1995) Journal of the ACM , vol.42 , pp. 908-918
    • Galil, Z.1
  • 11
    • 0030412523 scopus 로고    scopus 로고
    • A comparison of approximate string matching algorithms
    • Dec.
    • P. Jokinen, J. Tarhio and E. Ukkonen, "A Comparison of Approximate String Matching Algorithms," Software-Practice and Experience, Vol.26, pp. 1439-1457, Dec. 1996.
    • (1996) Software-practice and Experience , vol.26 , pp. 1439-1457
    • Jokinen, P.1    Tarhio, J.2    Ukkonen, E.3
  • 12
    • 0010222572 scopus 로고    scopus 로고
    • Enabling java for high-performance computing: Exploiting distributed shared memory and remote method invocation
    • Oct.
    • T. Kielmann, P. Hatcher, et al., "Enabling Java for High-Performance Computing: Exploiting Distributed Shared Memory and Remote Method Invocation, Comm. of the ACM, Vol.44, Issue 10, Oct. 2001, pp. 110-117.
    • (2001) Comm. of the ACM , vol.44 , Issue.10 , pp. 110-117
    • Kielmann, T.1    Hatcher, P.2
  • 13
    • 38249042384 scopus 로고
    • Efficient string matching with K mismatches
    • G. Landau and U. Vishkin, "Efficient String Matching with K Mismatches," Theo. Comp. Sci., 43, pp. 239-249, 1986.
    • (1986) Theo. Comp. Sci. , vol.43 , pp. 239-249
    • Landau, G.1    Vishkin, U.2
  • 14
    • 0029344516 scopus 로고
    • Experimental results on string matching algorithms
    • Jul.
    • T. Lecroq, "Experimental Results on String Matching Algorithms," Software-Practice and Experience, Vol. 25, pp. 727-765, Jul. 1995.
    • (1995) Software-practice and Experience , vol.25 , pp. 727-765
    • Lecroq, T.1
  • 16
    • 0023382868 scopus 로고
    • P-NAC: A systolic array for comparing nucleic acid sequences
    • July
    • D. P. Lopresti, P-NAC: a systolic array for comparing nucleic acid sequences, Computer, July 1987, pp. 98-99.
    • (1987) Computer , pp. 98-99
    • Lopresti, D.P.1
  • 17
    • 34250812657 scopus 로고
    • Hardware algorithms for determining similarity between two strings
    • April
    • A. Mukherjee, "Hardware Algorithms for Determining Similarity Between Two Strings," IEEE Trans. on Computers, Vol. 38, No. 4, pp. 600-603, April 1989.
    • (1989) IEEE Trans. on Computers , vol.38 , Issue.4 , pp. 600-603
    • Mukherjee, A.1
  • 18
    • 0018480118 scopus 로고
    • Hardware algorithms for nonnumeric computation
    • June
    • A. Mukhopadhyay, "Hardware Algorithms for Nonnumeric Computation," IEEE trans. on Computers, Vol. C-28, No. 6, pp. 384-394, June 1979.
    • (1979) IEEE Trans. on Computers , vol.C-28 , Issue.6 , pp. 384-394
    • Mukhopadhyay, A.1
  • 20
    • 0346403189 scopus 로고    scopus 로고
    • Efficient parallel hardware algorithms for string matching
    • Oct.
    • J. 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.
    • (1999) Microprocessors and Microsystems , vol.23 , Issue.3 , pp. 155-168
    • Park, J.H.1    George, K.M.2
  • 22
    • 11844284990 scopus 로고    scopus 로고
    • Parallel broadcasting scheme for approximate string matching with k-mismatches
    • Ch. 24, Kluwer Academic Publishers
    • J. 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.
    • (2002) High Performance Computing Systems and Applications , pp. 355-374
    • Park, J.H.1    Li, K.2
  • 23
    • 0027848062 scopus 로고
    • A systolic array for approximate string matching
    • Cambridge, Mass.
    • R. Sastry, N. Ranganathan, "A Systolic Array for Approximate String Matching," Proc. Int'l Conf. Computer Design, pp. 402-405, Cambridge, Mass., 1993.
    • (1993) Proc. Int'l Conf. Computer Design , pp. 402-405
    • Sastry, R.1    Ranganathan, N.2
  • 25
    • 0015960104 scopus 로고
    • The string-to-string correction problem
    • Jan.
    • R. A. Wagner, "The String-to-String Correction Problem," Journal of the ACM, Vol. 21, pp. 168-173, Jan. 1974.
    • (1974) Journal of the ACM , vol.21 , pp. 168-173
    • Wagner, R.A.1
  • 27
    • 84976654685 scopus 로고
    • Fast text searching allowing errors
    • Oct.
    • S. Wu and U. Manber, "Fast Text Searching Allowing Errors," Comm. ACM, Vol. 35, pp. 83-91, Oct. 1992.
    • (1992) Comm. ACM , vol.35 , pp. 83-91
    • Wu, S.1    Manber, U.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.