Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz,...
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
A distributed problem solving approach to job shop scheduling is described in this paper. The approach views the system as an Organisation. Agents are assigned di erent roles and ...
Grid technologies have enabled the aggregation of geographically distributed resources, in the context of a particular application. The network remains an important requirement for...