On an improved parallel construction of suffix arrays for low bandwidth pc-cluster

Loading...
Thumbnail Image
Date
2003
Authors
Kok, Jun Lee
Nur'Aini, Abdul Rashid
Rosni, Abdullah
Norhashidah, Md. Ali
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
An algorithm for the parallel construction of suffix arrays generation for any texts with larger alphabet size on distributed memory architecture is presented. Our main goal is to achieve constant communication complexity for any string with large alphabet size while the number of processors involved in the computation is increased, and to derive a practical implementation that works well for typical input string. Our experiments using several genomes and texts data set on low cost network PC-cluster shows that our algorithm works well and scalable. We present some experimental evidence to show that our parallel algorithm works well even in low bandwidth network architecture.
Description
Presentation Paper
Keywords
Computer Science , Mathematic , Knowledge Representating , Affordable Computing
Citation