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

Towards an Efficient Approach for Resource Sharing in Real-Time Multiprocessor Systems

Authors:


Publication Type:

Conference/Workshop Paper

Venue:

6th IEEE International Symposium on Industrial Embedded Systems (SIES11), Work-in-Progress (WiP) session


Abstract

Supporting resource sharing in multiprocessor architectures is one of the problems which may limit the benefits that can be archived using this type of architecture. Many approaches and algorithms have been proposed to support resource sharing, however, most of them impose either high blocking times on tasks or require a large memory size. In this paper we investigate the possibility of combining the lock-based approaches and wait-free approaches (using multiple buffers) in order to decrease both the blocking time that may affect the schedulability of tasks and the required memory. To achieve this, we propose a solution based on evaluating the maximum allowed blocking time on each task according to the schedulability analysis, and then find the minimum memory requirement for each resource such that it limits the blocking times on tasks to be less than the maximum allowed blocking times.

Bibtex

@inproceedings{Behnam2096,
author = {Moris Behnam and Farhang Nemati and Thomas Nolte and H{\aa}kan Grahn },
title = {Towards an Efficient Approach for Resource Sharing in Real-Time Multiprocessor Systems},
month = {June},
year = {2011},
booktitle = {6th IEEE International Symposium on Industrial Embedded Systems (SIES11), Work-in-Progress (WiP) session},
url = {http://www.es.mdh.se/publications/2096-}
}