Merlin: Parallel Searching

Making use of available resources:

For N-CPU machines, superstructure searching can run on 1 thru N CPUs simultaneously.

Implemented via Program Objects ('tho this is hidden).

Options to merlinserver control how many CPUs to use.

The result...

Using N CPUs, most "hard" searches run roughly N times faster.

Table of Contents

Merlin: Parallel Searching

Making use of available resources:

For N-CPU machines, superstructure searching can run on 1 thru N CPUs simultaneously. Implemented via Program Objects ('tho this is hidden). Options to merlinserver control how many CPUs to use.

The result...

Using N CPUs, most "hard" searches run roughly N times faster.

For N-CPU machines, superstructure searching can run on 1 thru N CPUs simultaneously.

Implemented via Program Objects ('tho this is hidden).

Options to merlinserver control how many CPUs to use.