Several methods exist for classifying a process, and all operate concurrently.
A top-down strictest first matching algorithm is used to provide for maximum configuration flexibility. You can organize process groupings by user with special cases for programs with certain names, by pathname with special cases for certain users, or any other arrangement. This example examines CPU allocation, with the assumption that each class can consume all the CPU it is given. Two classes, A and B, are in the same tier. Then WLM distributes the remaining CPU cycles according to any CPU target share values.