Before revision:  We apply our method to SQ(d,K) resp LL(d,K) with exponential job sizes of mean one. For these policies, jobs arrive in batches of size K and join the K servers with the shortest queue resp least amount of work left. For SQ(d ,K) we obtain \frac{1{\log(d/K)} as limiting value, while for LL(d,K) we find the limit to be }  equal to \frac{K}{d-K}.
After revision:  We apply our method to SQ(d,K) resp LL(d,K) {\log(d/K)} as limiting value, while for LL(d,K) we find the limit to be } equal to \frac{K}{d-K}.