The sample scenario below is designed to show the dependencies between the send sequence of the LUWs and the queue assignment of the individual calls. An example demonstrates which queue assignment exists after a certain transaction has been sent. Try demo program RSTRFCT3 as well.
The diagram shows the transaction sequence as dictated by the application as well as the respective queue usage of the individual calls: For example, transaction T3 contains two qRFC calls assigned to queue Q1 and two calls assigned to queue Q3.
In contrast, transaction T6 contains only the qRFC call with the addition AS SEPARATE UNIT, assigned to queue Q6.
From the queue usage shown in the above example the following initial assignment for the individual queues results:
After Sending T1
After transaction T1 was sent successfully, the transactions T3 and T4 are prepared for sending. This results in the following queue assignment:
First, the calls of T1 are sent in all involved queues (Q1, Q2, Q3, and Q4).
All other independent transactions that share queue participants with T1 are prepared for sending afterwards. In this case, these are transactions T3 and T4.
The transactions T2, T5, T6, and T7 remain in wait mode until T3 and T4 have been sent successfully.
Only after this the waiting transactions are started automatically one after another.