Title
Hard Real-Time scheduling on a multicore platform
Abstract
Multicore microcontrollers are rapidly penetrating the real-time systems market with a promise of increased processing throughput and lower energy consumption compared to traditional single-core processors. Consequently, it sparked a wave of research in Soft Real-Time (SRT) scheduling algorithms for multicore processors producing many different scheduling algorithms that are good at harnessing the added power of the multicore processors but lack the required determinism to be used in Hard Real-Time (HRT) systems.We present the Multicore Priority Ceiling Protocol scheduling algorithm for HRT systems along with its schedulability test for HRT systems running on a single instance of a modified RTOS. We also developed a tool that uses our schedulability test to solve the task partitioning problem using a Particle Swarm Optimization.
Year
DOI
Venue
2015
10.1109/SYSCON.2015.7116771
SysCon
Keywords
Field
DocType
protocols
Fixed-priority pre-emptive scheduling,Priority ceiling protocol,Fair-share scheduling,Scheduling (computing),Computer science,Parallel computing,Real-time operating system,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Embedded system
Conference
ISSN
Citations 
PageRank 
1944-7620
0
0.34
References 
Authors
4
3
Name
Order
Citations
PageRank
Vigeant, Guillaume100.34
Alain Beaulieu2407.78
Givigi, Sidney320.75