We analyze the following problem: Each of K nodes of the d-cube wishes (at the same time) to broadcast a packet to all hypercube nodes. We present a simple distributed algorithm for performing this task efficiently for any value of K and for any K-tuple of broadcasting nodes, and some variations of this algorithm that apply to special cases. In particular, we obtain an easily implementable algorithm for the multinode broadcast task ( K=2 d ), which comes within a factor of 2 from the optimal.