Is there a name for "yield first result parallel map"?
You might be able to achieve this in a system for distributed promises / distributed futures.

Some systems will have an operation any that does what you want: if p1,p2,..,pn are promises, then any(p1,p2,..,pn) returns a new promise q that resolves as soon as any of the promises p1,..,pn do.  In other words, once the first promise resolves, q immediately resolves (with that value), without waiting for any of the other promises to resolve.  See, e.g., promise.any in Javascript Q, Promise.any in Bluebird or Promise.any? in Concurrent Ruby.

That said, this is only half the story.  When one promise resolves, what happens to the other promises?  Do they keep executing or get terminated?  The answer will probably depend on the specific system.  If you're unlucky, all the other computations keep running, eventually the other promises resolve, and then their result is just thrown away.  That'd be a waste.

However, if you're lucky -- if the system supports it, and the underlying scheduler is smart enough -- then perhaps the scheduler will terminate the computations associated with the other promises as soon as it is known that they are not needed.  How could that be implemented?  One way is that the implementation of any might cancel all of the other promises as soon as one of them resolves.  The system could be designed to propagate cancellation transitively, and the scheduler could be implemented to terminate any in-progress computation that exists solely to resolve a promise that has subsequently been cancelled.

Ultimately, it's likely to be system-dependent whether the other computations are terminated or not in this situation, and you might need to test individual systems to determine whether they do what you want.