Abstract | ||
---|---|---|
Distributed Shared Memory systems allow the use of the shared memory programming paradigm in distributed architectures where no physically shared memory exist. Scope consistent software DSMs provide a relaxed memory model that reduces the coherence overhead by ensuring consistency only at synchronisation operations, on a per-lock basis. Sequence comparison is a basic operation in DNA sequencing projects, and most of sequence comparison methods used are based on heuristics, that are faster but do not produce optimal alignments. Recently, many organisms had their DNA entirely sequenced, and this reality presents the need for comparing long DNA sequences, which is a challenging task due to its high demands for computational power and memory. In this article, we present and evaluate a parallelisation strategy for implementing a sequence alignment algorithm for long sequences in a DSM system. Our results on an eight-machine cluster presented good speedups, showing that our parallelisation strategy and programming support were appropriate. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1007/978-3-540-45209-6_74 | LECTURE NOTES IN COMPUTER SCIENCE |
Keywords | Field | DocType |
distributed architecture,dna sequence,programming paradigm,shared memory,sequence alignment,distributed shared memory,memory model | Programming paradigm,Shared memory,Computer science,Virtual memory,Parallel computing,Distributed memory,Heuristics,Memory model,Page fault,Distributed shared memory,Distributed computing | Conference |
Volume | ISSN | Citations |
2790 | 0302-9743 | 9 |
PageRank | References | Authors |
0.86 | 8 | 7 |
Name | Order | Citations | PageRank |
---|---|---|---|
Renata Cristina Faray Melo | 1 | 12 | 2.66 |
Maria Emilia Telles Walter | 2 | 148 | 23.82 |
Alba Cristina Magalhaes Alves De Melo | 3 | 253 | 33.90 |
Rodolfo Bezerra Batista | 4 | 28 | 3.31 |
Marcelo Nardelli Pinto Santana | 5 | 11 | 1.63 |
Thelmo E. S. Martins | 6 | 14 | 1.47 |
Tiago M. Fonseca | 7 | 14 | 1.47 |