Abstract
The task allocation problem consists in defining a space and time sharing of system resources that can meet all logical and operational constraints of the tasks being considered. For real-time tasks with predictable behavior (periodic), static allocation provides a reliable way to meet temporal scheduling requirements, together with other operational constraints, such as task replication for fault-tolerance. Unfortunately, finding an optimal feasible allocation is known to be NP-hard, and thus heuristic approaches have been proposed. In this paper, the use of a new heuristic to generate static allocations for critical periodic tasks in real-time distributed control systems is described.
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.
