In Chapter 4 we showed how protected objects can provide an indirect means for tasks to communicate and synchronize. Protected functions and procedures provide safe access to shared data while protected entries provide the means for tasks to synchronize their activities. In this chapter we look at direct communication between tasks through Ada's rendezvous.

The rendezvous

Rendezvous is a sixteenth century French word which literally translates to “present yourself.” To rendezvous is to come together at a prearranged meeting place. In Ada, the rendezvous is a mechanism for controlled direct interaction between two tasks. The rendezvous provides a second way to synchronize tasks and transfer data between them.

Ada's rendezvous is based on a client-server model. One task, called the server, declares one or more services that it can offer to other tasks, the clients. These services are defined as entries in the server task's specification. Task entries are similar to protected entries. In fact, we may requeue a protected entry call onto a task entry and vice versa. A client task requests a rendezvous with a server by making entry calls just as if the server was a protected object. Server tasks indicate a willingness to accept a rendezvous on an entry by executing an accept statement. The accept statement may include code to be executed during the rendezvous.

For the rendezvous to take place, both the client and the server must have issued their requests.