Compressing affinity data

If your temporary storage queue names contain a unique counter or a terminal name (termid), a very large number of basic affinity transaction groups might be created for what might seem to be a small number of logical queues.

For example, consider the queues ABCD0001 through ABCD1000, with the name comprising a fixed part (ABCD) and a counter 0001 through 1000. They might result in 1000 basic affinity transaction groups, each with relation, LUNAME, lifetime PCONV, and transactions ABCD and ABCE. These groups form one logical queue, ABCD*, which causes an affinity that might be described by one affinity transaction group. However, the result is 1000 basic affinity transaction groups.

The affinity data might be more readable if compressed to its logical form. Use the Builder to do this, because it combines all affinity transaction groups that contain the same transaction ID. The Builder output for the previous example would be one affinity transaction group with relation LUNAME, lifetime PCONV, and transactions ABCD and ABCE.


Concept Concept

Feedback


Timestamp icon Last updated: Friday, 22 November 2013


http://pic.dhe.ibm.com/infocenter/cicsts/v5r1/topic///ciuug83.html