Task partitioning utilizing available time on multiprocessor systems for a given schedule

摘要

The partitioning of a task at compile time on a multiprocessor system for a given schedule is considered. The optimal distribution of the partition is found. The homogeneous and heterogenous cases are considered. An algorithm is shown that performs the partitioning while ensuring efficient utilization of resources. Tests are developed to predict the profitability of the partition.