Server-based scheduling of parallel real-time tasks
Proceedings of the tenth ACM international conference on Embedded software
A semi-partitioned approach for parallel real-time scheduling
Proceedings of the 20th International Conference on Real-Time and Network Systems
Dynamic scheduling algorithm for parallel real-time graph tasks
ACM SIGBED Review - Special Issue on the 24th Euromicro Conference on Real-Time Systems
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
Global EDF scheduling of directed acyclic graphs on multiprocessor systems
Proceedings of the 21st International conference on Real-Time Networks and Systems
Real-time programming on accelerator many-core processors
Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology
DFTS: A dynamic fault-tolerant scheduling for real-time tasks in multicore processors
Microprocessors & Microsystems
Supporting soft real-time parallel applications on multiprocessors
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
Multi-core processors offer a significant performance increase over single core processors. Therefore, they have the potential to enable computation-intensive real-time applications with stringent timing constraints that cannot be met on traditional single-core processors. However, most results in traditional multiprocessor real-time scheduling are limited to sequential programming models and ignore intra-task parallelism. In this paper, we address the problem of scheduling periodic parallel tasks with implicit deadlines on multi-core processors. We first consider a synchronous task model where each task consists of segments, each segment having an arbitrary number of parallel threads that synchronize at the end of the segment. We propose a new task decomposition method that decomposes each parallel task into a set of sequential tasks. We prove that our task decomposition achieves a resource augmentation bound of 2.62 and 3.42 when the decomposed tasks are scheduled using global EDF and partitioned deadline monotonic scheduling, respectively. Finally, we extend our analysis to directed a cyclic graph tasks. We show how these tasks can be converted into synchronous tasks such that the same transformation can be applied and the same augmentation bounds hold.