Method of lookahead scheduling for grid

In this paper we propose a new method of resource distribution between computational jobs for a practically important form of a grid, where resources are used not only by grid, but are shared with their owners. The characteristic feature of the method, called Lookahead scheduling, is it's ability to build up a plan of resource allocations for some period of a time, unlike more common scheme, in which a scheduling is limited to forwarding jobs to free resources. Such “predictive” scheduling even in the conditions of shared resources has the property of a determinacy — realization of the plan is provided by means of advance reservation. The property of the determinacy makes the Lookahead method suitable for a multiple-processor job management.