© Thomas Kunz 2000
SCE 574
200
   Ada Rendezvous
äInteraction mechanism
äRendezvous
äLooks like a procedure call in the source code
äStack.Init(...),  Stack.Push(....)
äRendezvous as a call-accept-release sequence
ä
ä
ä
ä
ä
ä
ä
ä
ä
äThe serving task can only serve one caller at a time, if its busy when a call arrives the calling task is placed in a queue for the entry
Task A
Task B
Call B.entry1
Idle
Busy
End accept releases caller
Wait for the next call
Idle
Other work
Potentially concurrent
processing in parallel with
other work
Accept the call