I’m a swiss Master student in Computer Science. I’m very interested in C++, open source projects, Linux, Intel Assembly and Agile. I'm currently working on Eddi, a new programming language that I created to improve my skills in C++. I've also worked a lot on Java technologies (Sprint, Osgi, Play!, ...), but I'm not currently working with Java anymore. Baptiste is a DZone MVB and is not an employee of DZone and has posted 51 posts at DZone. You can read more from them at their website. View Full User Profile

Asynchronous Message Passing in JR

07.05.2010
| 4767 views |
  • submit to reddit

We’ve now covered the basic synchronization systems (semaphore, monitors) and we know how to declare operations and capabilities . It’s time to go to an other form of synchronization :Message Passing. In this post, we’ll focus in Asynchronous Message Passing, we’ll cover later, the synchronous message passing system with RendezVous.

When we use message passing, the threads don’t share data anymore, they share channels. You can see channels as an abstraction of a network between several processes. The processes will send messages to each other and the other will wait for receive a message. Normally, with that form of synchronization, the channels are the only objects shared between the threads. So you don’t need to share memory. That makes it possible to distribute the processes across several virtual machines or computers, of course, this also works on a simple computer, like any other program. In message passing, we often see models with several clients and a server that manage the messages.

In Java, you will do that with Socket or RMI but in JR, this system is really easily integrated. We’ll use operations as messages queues and send/receive operations in the queue to respectively send a message to the queue and receive a message from the queue. The operations must not be implemented to achieve asynchronous message passing. If the operations is implemented, this will make a remote procedure call, but we’ll not cover that system for now. And because, it’s asynchronous, the operations cannot have a return type. The operations visibility is the same as the method visibility. So if an operation is static in class A, a send statement on this operation can be serviced by any process who has the visibility to access this operation.

So we will need these kind of operations :

private static op void channel(int);

To send a message to a channel, you just have to use the send keyword followed by the name of the operations with the arguments :

send channel(12);
The send operation does not block, when the same is sent, the send operation is released.

To receive a message, you have to use the receive keyword, followed by the variables name in which put the values of the arguments :

int x;
receive channel(x);
The variables must have been declared before used in the receive statement. It’s a little weird when we start, but it’s really practical to assign them in one operation even if we have a lot of parameters. When the processes are on the same virtual machines, the parameters are passed like for any method in Java, by value. If we put all that together in processes :
public class AMP1 {
private static op void channel(int);

private static process p1{
send channel(12);
}

private static process p2{
int x;
receive channel(x);
System.out.println(x);
}

public static void main(String... args){}
}

The messages are received in the order they are sent for each sender. But it’s possible that a message sent by Thread 1 before an other message sent by Thread 2 will be received after the one of Thread 2. Normally this would never appears when working in a simple computer, but that could appear often when working with several computers. So don’t make any assumptions on the order your messages will be received.

With all that, we can solve the producer-consumer problem really easily :

public class ProducerConsumer {
private static final int N = 12; //Number of producers and consumers

private static op void deposit(String); //The channel

public static void main(String... args){}

private static process Producer((int i = 0; i < N; i++)){
send deposit("Producer" + i);
}

private static process Consumer((int i = 0; i < N; i++)){
String data;
receive deposit(data);
System.out.println("Consumer" + i + " : " + data);
}
}

No need for great explanations. A Producer send a message with the informations it has produced and doesn’t wait for the receive. And a Consumer wait for a deposit (a send) with a receive statement and print the result when it has received the message.

Just as you can invoke operations with capabilities, you can also send messages through a capability. It’s very easy to share channels because this is only a variable. We often send the channels in a message for an answer.

Let’s imagine a simple problem. We have N clients that needs resources shared by all the clients. We need something to manage the resources. So we’ll use a kind of server to achieve that. So we can start with something really simple for the clients :

op void request();
op void resource(Resource);
op void release(Resource);

send request();
receive resource(resource);
//Use resources
send release(resource);

That seems good, but there is some problems :
  • How can the server distinguish the clients ? If it sends a message to resource any client can take it, we need a way to create a channel between one client and the server (also called private channels). For this we’ll use a capability as a channel.
  • If the server wait for request messages, it cannot wait for release messages and vice-versa. A solution is to have two process in the servers, but with that, you must synchronize the two process. A better solution is to create an operation that give informations about the type of request.

So here, is the new version of client :

enum Type {REQUEST, RELEASE};
op void request(Type, cap void (Resource), Resource);

cap void (Resource) channel = new op void (Resource);
send request(Type.REQUEST, channel, null);

Resource resource;
receive channel(resource);
send request(Type.RELEASE, noop, resource);

and now the server :

cap void (Resource) client;
Type type;
Resource resource;

Queue<Resource> resources = new LinkedQueue<Resource>();
//Fill the queue of resources
Queue<cap void (int)> clients = new LinkedQueue<cap void int>();

while(true){
receive request(type, client, resource);

if(type == Type.REQUEST){
if(resources.isEmpty()){
clients.add(client);
} else {
send client(resource.pop());
}
} else {
if(clients.isEmpty()){
resources.put(resource);
} else {
send clients.pop()(resource);
}
}
}

Really easy no ? And that code can be distributed with only minor changes. And it works for any number of process your want. You will find the complete code of this problem joined to this post.

We have now covered the complete informations about Asynchronous Message Passing in JR. I hope you found that article interesting. The next post will be about the RendezVous in JR. RendezVous are a very powerful way to achieve synchronization also with message passing, but synchronous.

The complete source

 

From http://www.baptiste-wicht.com/2010/07/asynchronous-message-passing-jr/

Published at DZone with permission of Baptiste Wicht, author and DZone MVB.

(Note: Opinions expressed in this article and its replies are the opinions of their respective authors and not those of DZone, Inc.)