1. A parallel computer system comprising: a plurality of compute nodes that each comprises a processor and memory, wherein the plurality of compute nodes are arranged in a tree network connected to a root node, wherein the root node is an I/O node; a service node connected to the I/O node to allow the plurality of compute nodes to communicate with the service node wherein compute nodes on a first and second level from the I/O node are considered nodes close to the I/O node and compute nodes on other levels are considered nodes further away from the I/O node, wherein the nodes close to the I/O node are determined by a static class routing table stored in each node on the first and second levels; a job scheduler executing on the service node, wherein the job scheduler distributes jobs to the plurality of compute nodes and selectively places a job on a node of the plurality of compute nodes based on a priority attribute of the job and at least one resource attribute of the job, wherein the priority attribute and the at least one resource attribute are stored with the job, wherein the job scheduler places a job with a high priority attribute on a node of the plurality of compute nodes close to the I/O node, and wherein the at least one resource attribute of the job is a constant data state, and wherein the job scheduler places a job with a constant data state attribute on a node of the plurality of compute nodes further away from the I/O node.