A Three-Dimensional Resource Scheduling Algorithm for a Network-aware Grid

An e-Infrastructure allows end-user's applications to easily and securely access heterogeneous grid resources (e.g., computing and storage elements). Since e-Science applications are often characterized by huge data transfers and high computational loads, the selection and allocation of grid resources dramatically affect their performance. This paper proposes a distributed resource allocation algorithm, referred to as MRA3D, capable of handling multiple resource requirements for jobs/tasks submitted to the grid computing environment of the e-Infrastructure. More specifically, MRA3D aims at minimizing the execution time of data-intensive applications by taking into account performance metrics describing both system and connectivity status of the computational resources. Simulations have been carried out to compare the performance of MRA3D with other resource allocation algorithms in a realistic environment by using synthetic as well as real workload traces.