We study the well known problem of throwing m balls into nbins. If each ball in the sequential game is allowed to selectmore than one bin, the maximum load of the bins can beexponentially reduced compared to the `classical balls intobins" game.We consider a static and a dynamic variant of a randomizedparallel allocation where each ball can choose a constantnumber of bins. All results hold with high probability. Inthe static case all m balls arrive at the same time. We analyzefor m = n ...