Task partitioning upon heterogeneous multiprocessor platforms

@article{Baruah2004TaskPU,
  title={Task partitioning upon heterogeneous multiprocessor platforms},
  author={Sanjoy K. Baruah},
  journal={Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.},
  year={2004},
  pages={536-543}
}
Given a collection of recurring tasks or processes that comprise the software for a real-time system, and a collection of available processing units of different kinds upon which to execute them, the heterogeneous multiprocessor partitioning problem is concerned with determining whether the given tasks can be partitioned among the available processing units in such a manner that all timing constraints are met. It is shown that this problem is intractable (NP-hard in the strong sense). Efficient… CONTINUE READING

2 Figures & Tables

Topics

Statistics

051015'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

78 Citations

Semantic Scholar estimates that this publication has 78 citations based on the available data.

See our FAQ for additional information.