Skip to Main content Skip to Navigation
Conference papers

A Lower Bound for Dynamic Scheduling of Data Parallel Programs

Abstract : 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. Supported in part by the Irvine Research Unit in Advanced Computing and NASA under grant #NAG5-3692. Professor Alain Greiner is gratefully acknowledged. Supported by Capes, Brazilian Government, grant number 1897/95-11.
Document type :
Conference papers
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Tuesday, October 17, 2017 - 5:21:42 PM
Last modification on : Thursday, March 21, 2019 - 2:30:40 PM

Links full text



Fabricio Alves Barbosa da Silva, Miguel Campos, Isaac Scherson. A Lower Bound for Dynamic Scheduling of Data Parallel Programs. 4th International Euro-Par Conference, Sep 1998, Southampton, United Kingdom. pp.367-372, ⟨10.1007/BFb0057875⟩. ⟨hal-01618346⟩



Record views