An energy-aware performance analysis of SWIMM : Smith-Waterman implementation on Intel's Multicore and Manycore architectures

By: Contributor(s): Material type: ArticleArticlePublication details: ref_localidad@NULL : , 2015Description: 1 archivo (2,3 MB)Subject(s): Online resources: Summary: Alignment is essential in many areas such as biological, chemical and criminal forensics. The well-known Smith–Waterman (SW) algorithm is able to retrieve the optimal local alignment with quadratic time and space complexity. There are several implementations that take advantage of computing parallelization, such as manycores, FPGAs or GPUs, in order to reduce the alignment effort. In this research, we adapt, develop and tune the SW algorithm named SWIMM on a heterogeneous platform based on Intel’s Xeon and Xeon Phi coprocessor. SWIMM is a free tool available in a public git repository https://github.com/ enzorucci/SWIMM. We efficiently exploit data and thread-level parallelism, reaching up to 380 GCUPS on heterogeneous architecture, 350 GCUPS for the isolated Xeon and 50 GCUPS on Xeon Phi. Despite the heterogeneous implementation obtaining the best performance, it is also the most energy-demanding. In fact, we also present a trade-off analysis between performance and power consumption. The greenest configuration is based on an isolated multicore system that exploits AVX2 instruction set architecture reaching 1.5 GCUPS/Watts.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
Capítulo de libro Capítulo de libro Biblioteca Fac.Informática A0800 (Browse shelf(Opens below)) Available DIF-A0800

Formato de archivo PDF. -- Este documento es producción intelectual de la Facultad de Informática - UNLP (Colección BIPA/Biblioteca)

Alignment is essential in many areas such as biological, chemical and criminal forensics. The well-known Smith–Waterman (SW) algorithm is able to retrieve the optimal local alignment with quadratic time and space complexity. There are several implementations that take advantage of computing parallelization, such as manycores, FPGAs or GPUs, in order to reduce the alignment effort. In this research, we adapt, develop and tune the SW algorithm named SWIMM on a heterogeneous platform based on Intel’s Xeon and Xeon Phi coprocessor. SWIMM is a free tool available in a public git repository https://github.com/ enzorucci/SWIMM. We efficiently exploit data and thread-level parallelism, reaching up to 380 GCUPS on heterogeneous architecture, 350 GCUPS for the isolated Xeon and 50 GCUPS on Xeon Phi. Despite the heterogeneous implementation obtaining the best performance, it is also the most energy-demanding. In fact, we also present a trade-off analysis between performance and power consumption. The greenest configuration is based on an isolated multicore system that exploits AVX2 instruction set architecture reaching 1.5 GCUPS/Watts.

Concurrency and Computation: Practice & Experience, 27(18), pp. 5517-5537.

There are no comments on this title.

to post a comment.

Powered by Koha