1. A method for identifying a serialization bottleneck in a computer system, comprising the steps of: calculating the probability of a transaction request being queued before the transaction request is processed utilizing the mathematical formula: p q = ∑ n = 1 c - 1 ⁢ ⁢ cL n n ! * cL c c ! ⁢ ( 1 - L ) where p q is the probability of a transaction being queued; c is the total number of computing resources (expressed as an integer) and L is the utilization of each computing resource; providing an actual response time of a computing resource; providing an expected response time of the computing resource, and comparing the actual response time and the expected response time to derive a relationship between the actual and expected response time, whereby the relationship between the expected response time and the actual response time provides an indication of the presence of a serialization problem in a computing system.