Harlow et al. (1983) have given a recursive formula which is fundamental for computing the bundle strength distribution under a general class of load sharing rules called monotone load sharing rules. As the bundle size increases, the formula becomes prohibitively complex and, by itself, does not give much insight into the relationship of the assumed load sharing rule to the overall strength distribution. In this paper, an algorithm is given which gives some additional insight into this relationship. Here it is shown how to explicitly compute the bundle strength survival distribution by using a new type of graph called the loading diagram. The graph is parallel in structure and recursive in nature and so would appear to lend itself to large-scale computation. In addition, the graph has an interesting property (which we refer to as the cancellation property) which is related to the asymptotics of the Weibull as a minimum stable law.
