Code-Size Minimization in Multiprocessor Real-Time Systems

— Program code size is a critical factor in determining the manufacturing cost of many embedded systems, particularly those aimed at the extremely costconscious consumer market. However, most prior theoretical research on partitioning algorithms for real-time multiprocessor platforms has only focused on ensuring that the cumulative computing requirements of the tasks assigned to each processor does not exceed the processor’s computing capacity. We consider the problem of task partitioning in multiprocessor platforms in order to minimize the total code size, in application systems in which there may be several different implementations of each task available, with each implementation having different code sizes and different computing requirements. We prove that the general problem is intractable, and present polynomialtime algorithms for solving (well-defined) special cases of the general problem.

• Type: Conference
• Year: 2005
• Where: IPPS
• Authors: Sanjoy K. Baruah, Nathan Fisher
• Keywords: Code Sizes, Computing Requirements, Distributed And Parallel Computing, IPPS 2005, Multiprocessor Platforms