Abstract
In this paper we present algorithms for jointly scheduling periodic tasks and hard aperiodic tasks with precedence relations in a distributed systems under the earliest deadline first algorithm. The periodic distributed processes are assumed to be guaranteed off-line and decomposed into a set of independent tasks by means of release time and deadline modifications. This paper proposes a similar on-line decomposition of aperiodic tasks using a guarantee algorithm based on dynamically-calculated response times. An extension of a dynamic slack stealing algorithm is proposed that allows to obtain minimal response times for aperiodic task with release time constraints. Based on such extension, an on-line algorithm splits every aperiodic distributed process into a set of independent tasks, determining the end-to-end response time and, therefore, allowing the use of hard aperiodic distributed processes.
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.
