Irule that waits?

We have found that it is NOT single threaded. Or at least what we are trying to do with it is not.

 

 

My question was going to be "Is there an iRule syntax for Semiphores/Mutexs?"

 

 

And the reason is that we have found in our case that concurrent access is a problem.

 

 

We have a token (similar to an HTTP session id) that is shared between users. That token is used to lookup the node for which all of these users should be connected.

 

 

Problem is that the first user to come through with any given token will find that there is no existing node assigned and thus will use the least connection algorithm to define the node for that token. The idea that all subsequent users with the same token would be sent to the same node is what we are trying to get.

 

 

The problem is that apparently some piece of this process is not concurrent safe as concurrent access has PROVEN to send one user to one node and the rest to another node. This occurs when two threads are attempting to determine the least connections at the same time over writting each other in the mapping table afterwards.

 

 

Anyway, if there is a capability to make it single threaded or a Mutex/Semiphore capability that would be great.