Abstract
The research in distributed automotive systems have mainly been centered around periodic tasks scheduling. In this paper, we present an algorithm using synthetic utilization that can check the schedulability of aperiodic local tasks and aperiodic end-to-end tasks with precedence relation in flow shop model. If the scheduling algorithm for aperiodic end-to-end tasks executed in a multiple stage pipeline is applied to the flow shop model, sometimes the actually schedulable tasks are decided to be not schedulable because of the fact that the actually unschedulable tasks are decided to be schedulable. The algorithm presented in this paper solves this problem, and the simulation shows that the schedulability increases 10%.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
