Download now Free registration required
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, the authors present several multi-cost algorithms for the joint scheduling of the communication and computation resources that will be used by a Grid task. They 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, they introduce multi-cost algorithms that perform advance reservations and thus also find the starting times for the data transmission and the task execution.
- Format: PDF
- Size: 2359.1 KB