Scheduling Strategies for Deadline Constrained Coallocation Jobs in Distributed Computing Environments

Different from coallocating jobs without deadline constraints that could be arranged to begin to run at specified start time simply, for a deadline constrained coallocating job, it can start to run within the time interval ranging from its earliest start time (i.e., ready time) to its latest start time (i.e., deadline-duration).This makes it more flexible for the scheduler to arrange resources. This paper put forward the problem of coallocating jobs with deadline requirements by co-reservations, provides a slot-based data structure to organize the temporal and spatial availability of multiprocessor systems, and proposed seven strategies to choose available resources on the basis of the number of free processing elements and the time intervals.

Provided by: AICIT Topic: Hardware Date Added: Feb 2012 Format: PDF

Find By Topic