Optimal partitioning of randomly generated distributed programs
IEEE Transactions on Software Engineering
Task Allocation and Precedence Relations for Distributed Real-Time Systems
IEEE Transactions on Computers
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
Partitioning Techniques for Large-Grained Parallelism
IEEE Transactions on Computers
Optimal Partitioning of Random Programs Across Two Processors
IEEE Transactions on Software Engineering
Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Module Allocation of Real-Time Applications to Distributed Systems
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Constraint improvements for MILP-based hardware synthesis
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
A comparison of list schedules for parallel processing systems
Communications of the ACM
Operating Systems Theory
Analysis, Modeling and Optimization of Multiprocessing Execution Time
Analysis, Modeling and Optimization of Multiprocessing Execution Time
Assignment of Tasks in a Distributed Processor System with Limited Memory
IEEE Transactions on Computers
| Hi-index | 0.00 |
This paper describes a formal synthesis approach to design of optimal application-specific heterogeneous multiprocessor systems. The method generates a static task execution schedule along with the structure of the multiprocessor system and a mapping of subtasks to processors. The approach itself is quite general, but its application is demonstrated with a specific style of design. The approach involves creation of a Mixed Integer-Linear Programming (MILP) model and solution of the model. A primary component of the model is the set of relations that must be satisfied to ensure proper ordering of various events in the task execution as well as to ensure completeness and correctness of the system. Several experiments and tradeoff studies have been performed using the approach. These results indicate that the approach can be useful tool in designing application-specific multiprocessor systems.