You may want to check out

Phrot, which is based on Glucas and can do:

-PRP tests on all k*b^n+-c numbers

-Proth tests (a full primality test) on k*2^n+1

-PRP tests on Generalized Fermat numbers

Note that any positive results returned by the PRP tests will need to be proven prime separately; aside from k*2^n+1, which Phrot can prove directly, you'll need to prove the primes with another program such as LLR or PFGW on an x86 machine. However, for most searches that would only be a small fraction of the overall computing time.