Before revision:  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:  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 } policy, which assigns batches of K jobs to the K least loaded servers among d randomly selected servers, satisfies the assumptions and the limit is equal to \frac{K}{d-K}.