A new polynomial-time algorithm for linear programming
Combinatorica
Theory of linear and integer programming
Theory of linear and integer programming
Synthesis of application-specific multiprocessor systems including memory components
Journal of VLSI Signal Processing Systems - Special issue on application specific array processors (ASAP-92)
See MIPS run
Optimized rapid prototyping for real-time embedded heterogeneous multiprocessors
CODES '99 Proceedings of the seventh international workshop on Hardware/software codesign
Embedded system synthesis under memory constraints
CODES '99 Proceedings of the seventh international workshop on Hardware/software codesign
On the complexity of integer programming
Journal of the ACM (JACM)
A computational study of a multiple-choice knapsack algorithm
ACM Transactions on Mathematical Software (TOMS)
A constructive algorithm for memory-aware task assignment and scheduling
Proceedings of the ninth international symposium on Hardware/software codesign
Computers as components: principles of embedded computing system design
Computers as components: principles of embedded computing system design
Partial task assignment of task graphs under heterogeneous resource constraints
Proceedings of the 40th annual Design Automation Conference
Thumb: Reducing the Cost of 32-bit RISC Performance in Portable and Consumer Applications
COMPCON '96 Proceedings of the 41st IEEE International Computer Conference
Embedded System Design Framework for Minimizing Code Size and Guaranteeing Real-Time Requirements
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
An Efficient Compiler Technique for Code Size Reduction Using Reduced Bit-Width ISAs
Proceedings of the conference on Design, automation and test in Europe
Fast algorithms for bin packing
Journal of Computer and System Sciences
Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
A scalable GPU-based approach to accelerate the multiple-choice knapsack problem
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
Program code size is a critical factor in determining the manufacturing cost of many embedded systems, particularly those aimed at the extremely cost-conscious consumer market. However, the focus of most prior theoretical research on partitioning algorithms for real-time multiprocessor platforms has been 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 polynomial-time algorithms for solving (well-defined) special cases of the general problem.