Parallelism in LASSAP, a LArge Scale Sequence compArisons Package

摘要

We present the parallel module of a program called LASSAP which is intended to raise numerous limitations of current sequence comparison programs and which is able to handle homologies searches at a large scale level. This module is MIMD oriented, taking advantages of the intrinsic parallelism of most problems. It can run on various architectures (shared memory and message passing) and achieves near perfect speed-up on highly parallel machines (more than 100 processors). Work in progress focus on the way to deal with a network of parallel supercomputers, taking advantage of the specificities of each of them.