1. A computer implemented method for influencing task placement within a multiple processor computer, the computer implemented method comprising: identifying a first set of tasks executing on a first CPU domain having a first cache domain, the first set of tasks utilizing a first set of resources; determining a memory demand for the first set of tasks; responsive to determining that the memory demand for a first task of the first set of tasks exceeds a memory demand threshold, classifying the first task as a memory bound task; maintaining a first memory hog queue for the first cache domain, wherein the first memory hog queue includes each task of the first set of tasks that is classified as a memory bound task; identifying a second set of tasks executing on the second CPU domain having a second cache domain, the second set of tasks utilizing a second set of resources; determining a memory demand for the second set of tasks; responsive to determining that the memory demand for a second task of the second set of tasks exceeds a memory demand threshold, classifying the second task as a memory bound task; maintaining a second memory hog queue for the second cache domain, wherein the second memory hog queue includes each task of the second set of tasks that is classified as a memory bound task; and rebalancing the first set of tasks and the second set of tasks to reduce contention for the first set of resources and the second set of resources among the first set of tasks and the second set of tasks, wherein the step of rebalancing the first set of tasks and the second set of tasks further comprises rebalancing memory bound tasks of the first set of tasks to the second CPU domain to reduce contention between the first set of tasks for the first cache domain.