In this chapter, we consider a fundamental problem of task assignment in a server farm: which job should be assigned to which server? We propose the size-based task assignment policies with cycle stealing, SBCS-ID and SBCS-CQ, and analyze their performance via DR, which we have developed in Chapter 3. Our analysis shows that SBCS-IC and SBCS-CQ can provide an unbounded benefit over traditional task assignment policies with respect to mean response time.