You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Partitioning Real-Time Systems on Multiprocessors with Shared Resources

Authors:

Farhang Nemati, Thomas Nolte, Moris Behnam

Research group:

Complex Real-Time Embedded Systems

Publication Type:

Conference/Workshop Paper

Venue:

Proceedings of 14th International Conference On Principles Of Distributed Systems (OPODIS10)

Abstract

In this paper we propose a blocking-aware partitioning algorithm which allocates a task set on a multiprocessor (multi-core) platform in a way that the overall amount of blocking times of tasks are decreased. The algorithm reduces the total utilization which, in turn, has the potential to decrease the total number of required processors (cores). In this paper we evaluate our algorithm and compare it with an existing similar algorithm. The comparison criteria includes both number of schedulable systems as well as processor reduction performance.

Bibtex

@inproceedings{Nemati1926,
author = {Farhang Nemati and Thomas Nolte and Moris Behnam},
title = {Partitioning Real-Time Systems on Multiprocessors with Shared Resources},
month = {December},
year = {2010},
booktitle = {Proceedings of 14th International Conference On Principles Of Distributed Systems (OPODIS10)},
url = {http://www.es.mdu.se/publications/1926-}
}