Abstract. Proportional Fair (PF), a frequently used scheduling algorithm in 3G wireless networks, can unnecessarily starve “well-behaved” users in practice. One of the main causes behind PF-induced starvation is its inability to distinguish between users who are backlogged and users who are not. In this paper, we describe how a simple parallel PF instance can mitigate such starvation.