Abstract
This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.
| Original language | English |
|---|---|
| Article number | 108075 |
| Journal | Future Generation Computer Systems |
| Volume | 175 |
| DOIs | |
| State | Published - Feb 2026 |
Funding
This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research under Award Number DE-SC-0012704. This work was done in collaboration with the distributed computing research and development program within the ATLAS Collaboration. We thank our ATLAS colleagues, and in particular, the contributions of the ATLAS Distributed Computing team for their support. We would also like to express our deepest gratitude to Prof. Kaushik De at University of Texas at Arlington.
Keywords
- Date allocation
- Grid computing environments
- High performance computing
- Job scheduling
- Mixed integer linear programming