We compare the delays experienced by packet flows when transmitted using different scheduling algorithms across a crossbar switch. The two scheduling algorithms we consider are iterative SLIP [McKeown 1999] and QCSMA [Jiang & Walrand 2010]. We first compare them under the assumptions that all packets have the same length, and then under the assumption that the half the packets have the maximum allowable length and half have the minimum allowable length. Our findings suggest that the variation in packet length has a non-negligible effect on throughput vs delay results. For long-lived TCP connections with varying packet lengths, QCSMA derived schedulers seem to do only marginally better than SLIP. In highly loaded core switches with many short-lived TCP connections, we expect to see a large improvement in delay performance of QCSMA over SLIP.