Integrating Job Parallelism in Real-Time Scheduling Theory
| dc.creator | Collette, S. | |
| dc.creator | Cucu, L. | |
| dc.creator | Goossens, J. | |
| dc.date | 2008-05-21 | |
| dc.date.accessioned | 2026-07-07T09:40:10Z | |
| dc.date.available | 2026-07-07T09:40:10Z | |
| dc.description | We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. We prove that the time-complexity of the feasibility problem of these systems is linear relatively to the number of (sporadic) tasks for a fixed number of processors. We propose a scheduling algorithm theoretically optimal (i.e., preemptions and migrations neglected). Moreover, we provide an exact feasibility utilization bound. Lastly, we propose a technique to limit the number of migrations and preemptions. | |
| dc.identifier | https://arxiv.org/abs/0805.3237 | |
| dc.identifier | http://arxiv.org/abs/0805.3237 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/161402 | |
| dc.subject | Operating Systems | |
| dc.title | Integrating Job Parallelism in Real-Time Scheduling Theory | |
| dc.type | text |