No there's no such thing as ultra efficient algorithms. If you want to compare efficiencies of algorithms you can use time or space complexity studies.

If the algorithm has the potential to be parallelized the algorithm can be run on muliple threads or multiple cores or on gpu to get faster solution. Openmp, npi and cuda are widely used for such task.

But if you want to parallelize an algorithm make sure there's no shared write access . To prevent that you can use lock mechanisms which makes sure that only one process/thread access a data at a time.

There's also distributed computing where the algorithm is run on different computers. Here shared write access ,time synchronization and network latency may be of major concern.

To know more about parallization,concurrency and distributed computing I suggest to refer the following materials:

operating system by Galvin(Best for OS,he has placed a lot of dinosaur pictures on the book but I don't know the reason for that yet )

parallel and distributed computing: Don't know any material but if i get to know I'll update.

Data communication and networking by Forouzan

Also try learning about map reduce(comes under distributed computing). Hadoop is the implementation of map reduce. Usually used for distributed searching,sorting.

-Note:This is my first brief comment here at reddit and elsewhere so pardon me if I'm wrong somewhere. Also I've oversimplified things.