Home

Approximate String Matching on the DADO2 Parallel Computer

Toshikatsu Mori; Salvatore Stolfo

Title:
Approximate String Matching on the DADO2 Parallel Computer
Author(s):
Mori, Toshikatsu
Stolfo, Salvatore
Date:
Type:
Technical reports
Department:
Computer Science
Permanent URL:
Series:
Columbia University Computer Science Technical Reports
Part Number:
CUCS-361-88
Publisher:
Department of Computer Science, Columbia University
Publisher Location:
New York
Abstract:
This paper presents an approximate string matching algorithm on the 1023-processor parallel computer DADO2. To allow proximity in matching between the text and search pattern, the dynamic programming method is used as the matching algorithm. This paper includes timing measurements and comparison with a conventional sequential computer (VAX). The results show significant speedup over the sequential computer.
Subject(s):
Computer science
Item views:
77
Metadata:
View

In Partnership with the Center for Digital Research and Scholarship at Columbia University Libraries/Information Services.