In this paper, we address the scheduling problem for Clos-network switches with no buffers at the central stage. Existing scheduling (dispatching) algorithms for this type of switch, such as CRRD and CMSD, are too complex for implementation. We consider efficient and practical dispatching algorithms and propose the k-selector based dispatching (KBD) algorithm. The KBD algorithm differs from other dispatching algorithms in the phase of matching within input modules. In KBD, only one kselector is used at each input module to select m out of nk requests to send to the corresponding central modules. As such, the interconnection wires are totally removed in input modules and the required time for the first phase is improved significantly. Through simulations, we show that KBD achieves comparable performance to CMSD under Bernoulli and bursty traffic.