2. Prof. Vassil Alexandrov Janko Straßburg University of Reading, Aristotle University, University Carlos III European Commission Acknowledgments
3. Sequence Alignment on the Playstation 3 Six SPEs Smith-Waterman Algorithm only Accelerating Multiple SequenceAlignment with the Cell BE Processor Designed to accelerate a particular sequence alignment application Modeling and SchedulingWavefront Computations on the Cell Broadband Engine Smith-Waterman Algorithm State of the art
5. SIMD approach Working with vectors Parallelisation Using multiple SPEs Cell Processor features
6.
7. Used for aligning sequences of DNA nucleotides or amino acids (proteins)
8.
9. Needleman-Wunsch Scoring matrix Each cell’s value is based on its upper, left, and upper-left neighbour Main issue – data dependencies Sequence Alignment
15. Tiles grouped into blocks Each block is 16 tiles high or more Algorithm first covers one block, then moves to the next one Solution
16. Wavefront algorithm also applied on the tile level One antidiagonal – one or more vectors Vectorisation
17. Always try to transfer as much as possible Maximum transfer allowed – 16 KB Integer size – 4 B If tile size is 64, the transfer size is 64 X 64 X 2 = 8192 X 4 = 32768 B Solution – short integers New transfer size - 64 X 64 X 2 = 8192 X 2 = = 16 384 B = 16 KB Technical issues
21. It is possible to efficiently employ Cell Broadband Engine for Sequence alignment Further optimisation needed Reduction of context creations Inter-SPE communication Implementing sequence alignment across multiple pairs of sequences Using ALF – Accelerated Library Framework Conclusion
