Resurrecting Ada's Rendez-Vous in Java

Java is a programming language designed with concurrency in mind from its inception. However, the synchronization mechanism provided is a restricted version of Hoare's Monitors, being too low level for most applications. In this paper we propose a high level synchronization mechanism for Java, based on Ada's Rendez-Vous, adapting the notation and semantics to Java. The result is a nice and readable notation to control concurrency, even cleaner than the Ada original version. The Rendez-Vous syntax adds only one statement to Java, and we developed a preprocessor to translate the new statement to pure Java, using a class library which supports messages. Our implementation is available for downloading over the Internet.

• Type: Conference
• Year: 1998
• Where: SCCC
• Authors: Luis Mateu, José M. Piquer, Juan León
• Keywords: Ada Original Version, Level Synchronization Mechanism, SCCC 1998, Synchronization Mechanism, Theoretical Computer Science