How is the literal meaning of "rendezvous" related to its usage in distributed computing?
In this context, the rendezvous would mean "a bunch of threads meeting together" instead of people. Rendezvous is a method of synchronisation in which at least two threads "meet". In other words, each thread that reaches the rendezvous point waits until all other threads have reached the same point before proceeding. 

In the context of Distributed Algorithms the Rendezvous Problem is the task of devising an algorithm that will ensure that at least two entities (e.g., mobile agents) starting from different positions will meet after a finite amount of time in a specific environment (e.g., in a graph).