Abstract
In this paper a schedulability analysis algorithm for communicating tasks on a multiprocessor system is proposed. The precedence constraints caused by communications are represented by offsets and modified deadlines. The communication cost between two tasks residing on different processors has influence on both the offset as well as the modified deadline. To simplify the analysis, the algorithm classifies tasks into two groups: transactions and jobs. Transaction is a set of tasks with the same period length. Job is a set of tasks with precedence constraints within a transaction. Because of the precedence constraints, tasks within the same job can not interfere with each other. With this method the interference caused by higher priority tasks can be easily determined. In addition to precedence constraints, communication costs are also taken into account in the proposed algorithm which is different from the former schedulability analyses.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
