T. N'Takp and F. Suter (France)
Scheduling, Grid computing, PTG, Allocation.
Two of the main characteristics of computation grids are their heterogeneity and the sharing of resources between different users. This is the cost of the tremendous comput ing power offered by such platforms. Scheduling several applications concurrently in such an environment is thus challenging. In this paper we propose a first step towards the scheduling of multiple parallel task graphs (PTG), a class of applications that can benefit of large and powerful platforms, by focusing on the allocation process. We con sider the application of a resource constraint on the sched ule and determine the number of processors allocated to the different tasks of a PTG while respecting that constraint. We present two different allocation procedures and validate them in simulation over a wide range of scenarios with re gard to their respect of the resource constraint and their im pact on the completion time of the scheduled applications. We find that our procedures provide a guarantee on the re source usage for a low cost in terms of execution time.
Important Links:
Go Back
