Multi-cost job routing and scheduling in Grid networks

T. Stevens, M. De Leenheer, C. Develder, B. Dhoedt, Kostas Christodoulopoulos, Pannagiotis Kokkinos, E. Varvarigos

Research output: Contribution to journalArticleResearchpeer-review

26 Citations (Scopus)


A key problem in Grid networks is how to efficiently manage the available infrastructure, in order to satisfy user requirements and maximize resource utilization. This is in large part influenced by the algorithms responsible for the routing of data and the scheduling of tasks. In this paper, we present several multi-cost algorithms for the joint scheduling of the communication and computation resources that will be used by a Grid task. We propose a multi-cost scheme of polynomial complexity that performs immediate reservations and selects the computation resource to execute the task and determines the path to route the input data. Furthermore, we introduce multi-cost algorithms that perform advance reservations and thus also find the starting times for the data transmission and the task execution. We initially present an optimal scheme of non-polynomial complexity and by appropriately pruning the set of candidate paths we also give a heuristic algorithm of polynomial complexity. Our performance results indicate that in a Grid network in which tasks are either CPU- or data-intensive (or both), it is beneficial for the scheduling algorithm to jointly consider the computational and communication problems. A comparison between immediate and advance reservation schemes shows the trade-offs with respect to task blocking probability, end-to-end delay and the complexity of the algorithms.

Original languageEnglish
Pages (from-to)912-925
Number of pages14
JournalFuture Generation Computer Systems
Issue number8
Publication statusPublished - Sep 2009
Externally publishedYes


  • Algorithms
  • Network problems
  • Optimization
  • Scheduling

Cite this