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

Simple item page
dc.contributor.authorKok, Jun Lee
dc.contributor.authorNur'Aini, Abdul Rashid
dc.contributor.authorRosni, Abdullah
dc.contributor.authorNorhashidah, Md. Ali
dc.date.accessioned2014-11-14T07:36:10Z
dc.date.available2014-11-14T07:36:10Z
dc.date.issued2003
dc.descriptionPresentation Paperen_US
dc.description.abstractAn 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.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/475
dc.language.isoenen_US
dc.subjectComputer Scienceen_US
dc.subjectMathematicen_US
dc.subjectKnowledge Representatingen_US
dc.subjectAffordable Computingen_US
dc.titleOn an improved parallel construction of suffix arrays for low bandwidth pc-clusteren_US
dc.typePresentationen_US
Files
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Pusat Pengajian Pengurusan - Tesis