Conventional wisdom suggests that a fast single-server queue is preferable to a number of slower single-server queues. The rationale is that if the service rate of the superposed queue is the sum of the service rates of the individual queues, then the average waiting time for the superposed queue is smaller than the weighted average waiting time of the individual queues. This argument, however, assumes that the service time of the customers is perfectly scalable. Unfortunately, this assumption rarely holds in reality. In this paper we analyze the superposition ofM/G/1 queues. We assume that there are scalable and unscalable components in the service time. On the basis of the criteria of average waiting time and average response time, we derive necessary and sufficient conditions for whether the superposition of queues is preferable. Examples of magnetic rotational disks are given to illustrate our findings.