This paper deals with the stablec-server queue with renewal input. The service time distributions may be different for the various servers. They are however all probability distributions of phase type. It is shown that the stationary distribution of the queue length at arrivals has an exact geometric tail of rate η, 0 0. The quantities η and ξ may be evaluated together by an elementary algorithm. For both distributions, the multiplicative constants which arise in the asymptotic forms may be fully characterized. These constants are however difficult to compute in general.