Needed foundations for assuring the desirable behavior of software-reliant systems
Proceedings of the FSE/SDP workshop on Future of software engineering research
Energy-efficient scheduling for parallel real-time tasks based on level-packing
Proceedings of the 2011 ACM Symposium on Applied Computing
Partitioned scheduling of parallel real-time tasks on multiprocessor systems
ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
Globally scheduled real-time multiprocessor systems with GPUs
Real-Time Systems
Server-based scheduling of parallel real-time tasks
Proceedings of the tenth ACM international conference on Embedded software
Parallel scheduling for cyber-physical systems: analysis and case study on a self-driving car
Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems
| Hi-index | 0.00 |
The preemptive real-time scheduling of sporadic parallel task systems is studied. We present an algorithm, called Gang EDF, which applies the Earliest Deadline First (EDF) policy to the traditional Gang scheduling scheme. We also provide schedulability analysis of Gang EDF. Specifically, the total amount of interference that is necessary to cause a deadline miss is first identified. The contribution of each task to the interference is then bounded. Finally, verifying that the total amount of contribution does not exceed the necessary interference for every task, the schedulability test is derived. Although the techniques proposed herein are based on the prior results for the sequential task model, we introduce new ideas for the parallel task model.