Weight Bound Limits in Supertasking Approach for Guaranteed Timeline Constraints

Farooq Muhammad (1) , Fabrice Muller (1) , Michel Auguin (1)

1 LEAT - Laboratoire d'Electronique, Antennes et Télécommunications

We investigated the problem of supertasking in Pfair-scheduled multi-processor systems. In this approach, a set of tasks (component tasks) is grouped together to form a supertask, which is then scheduled as an ordinary Pfair task. Whenever a supertask is scheduled, its processor time is allocated to its component tasks according to an internal scheduling algorithm. Supertasking approach does not provide guarantees that its component tasks will respect the timeline constraints. In this paper, we propose a new condition for constructing a supertask from its component tasks in such a way that all timing constraints of its component tasks are guaranteed without compromising on schedulability loss. This condition is expressed as weight bound relation b/w supertask and its component tasks.

Mots clés: scheduling; task analysis; Pfair task; Pfair-scheduled multiprocessor systems; component tasks; guaranteed timeline constraints; internal scheduling algorithm; schedulability loss; supertasking approach; weight bound limits; Multiprocessing systems; Parallel processing; Partitioning algorithms; Processor scheduling; Real time systems; Resource management; Runtime; Scalability; Scheduling algorithm; Timing; Pfair scheduling; multiprocessor scheduling; real time system; schedulability; supertasking

Domaines: Système d'exploitation [cs.OS]; Architectures Matérielles [cs.AR]; Performance et fiabilité [cs.PF]

Farooq Muhammad, Fabrice Muller, Michel Auguin. Weight Bound Limits in Supertasking Approach for Guaranteed Timeline Constraints. 2008 International Conference on Parallel Processing Workshops (ICPP-W), Sep 2008, Portland, United States. pp.9-16, ⟨10.1109/ICPP-W.2008.24⟩. ⟨hal-01786924⟩