A Lower Bound for Dynamic Scheduling of Data Parallel Programs

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 allows for time slices to change dynamically and, under dynamically changing workload conditions is a good non-clairvoyant scheduling technique when the parallel computer is time sliced one job at a time. IBTS-parallel is proposed here as a dynamic scheduling paradigm which improves on IBTS by allowing also dynamically changing space sharing of the computer's processors. IBTS-parallel is also non-clairvoyant and it is characterized under the competitive ratio metric. A lower bound on its performance is also derived.

• Type: Conference
• Year: 1998
• Where: EUROPAR
• Authors: Fabrício Alves Barbosa da Silva, Luis Miguel Campos, Isaac D. Scherson
• Keywords: Distributed And Parallel Computing, Dynamically, EUROPAR 1998, Parallel Computer, Time Slicing IBTS