Abstract
Executing computing tasks with replications is an essential choice to achieve fault-tolerance in designing real-time, embedded systems. A problem of maximizing the number of real-time tasks with replications running on a multiprocessor embedded system is discussed in this letter. The partitioning problem can be modeled as a variant of the bin-packing problem. In the original problem, it is known that the first-fit (FF) method has a good worst-case performance bound of 4/3. Whether or not the same bound is achievable in the variant problem remains an open question. This letter closes the question by proving that the worst-case performance bound of using the FF method approaches to 2 but it never reaches it. Then, a tight bound of asymptotic worst-case performance is shown.
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.
