Optimizing the Needleman–Wunsch Algorithm Using Dual-GPU Tiling for Enhanced Computational Performance
This study addresses the scalability limitation of the Needleman-Wunsch (NW) algorithm by introducing a dual-GPU computational model that integrates a tiling strategy with semi-parallel kernel scheduling that effectively scales across matrix dimensions from 36 cells to over 400 million cells.