Standard

Efficient parallel string comparison. / Krusche, Peter; Tiskin, Alexander.

In: Advances in Parallel Computing, Vol. 15, 01.01.2008, p. 193-200.

Research output: Contribution to journal › Article › peer-review

Harvard

Krusche, P & Tiskin, A 2008, 'Efficient parallel string comparison', Advances in Parallel Computing, vol. 15, pp. 193-200.

APA

Krusche, P., & Tiskin, A. (2008). Efficient parallel string comparison. Advances in Parallel Computing, 15, 193-200.

Vancouver

Krusche P, Tiskin A. Efficient parallel string comparison. Advances in Parallel Computing. 2008 Jan 1;15:193-200.

Author

Krusche, Peter ; Tiskin, Alexander. / Efficient parallel string comparison. In: Advances in Parallel Computing. 2008 ; Vol. 15. pp. 193-200.

BibTeX

@article{093b452362914d678f68b810f6329e44,
title = "Efficient parallel string comparison",
abstract = "The longest common subsequence (LCS) problem is a classical method of string comparison. Several coarse-grained parallel algorithms for the LCS problem have been proposed in the past. However, none of these algorithms achieve scalable communication. In this paper, we propose the first coarse-grained parallel LCS algorithm with scalable communication. Moreover, the algorithm is work-optimal, synchronisation-efficient, and solves a more general problem of semi-local string comparison, improving in at least two of these aspects on each of the predecessors. {\textcopyright} 2008 The authors and IOS Press. All rights reserved.",
author = "Peter Krusche and Alexander Tiskin",
year = "2008",
month = jan,
day = "1",
language = "English",
volume = "15",
pages = "193--200",
journal = "Advances in Parallel Computing",
issn = "0927-5452",
publisher = "Elsevier",

}

RIS

TY - JOUR

T1 - Efficient parallel string comparison

AU - Krusche, Peter

AU - Tiskin, Alexander

PY - 2008/1/1

Y1 - 2008/1/1

N2 - The longest common subsequence (LCS) problem is a classical method of string comparison. Several coarse-grained parallel algorithms for the LCS problem have been proposed in the past. However, none of these algorithms achieve scalable communication. In this paper, we propose the first coarse-grained parallel LCS algorithm with scalable communication. Moreover, the algorithm is work-optimal, synchronisation-efficient, and solves a more general problem of semi-local string comparison, improving in at least two of these aspects on each of the predecessors. © 2008 The authors and IOS Press. All rights reserved.

AB - The longest common subsequence (LCS) problem is a classical method of string comparison. Several coarse-grained parallel algorithms for the LCS problem have been proposed in the past. However, none of these algorithms achieve scalable communication. In this paper, we propose the first coarse-grained parallel LCS algorithm with scalable communication. Moreover, the algorithm is work-optimal, synchronisation-efficient, and solves a more general problem of semi-local string comparison, improving in at least two of these aspects on each of the predecessors. © 2008 The authors and IOS Press. All rights reserved.

UR - http://www.scopus.com/inward/record.url?scp=84906502934&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84906502934

VL - 15

SP - 193

EP - 200

JO - Advances in Parallel Computing

JF - Advances in Parallel Computing

SN - 0927-5452

ER -

ID: 127710382