mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Per Processor Spin-Lock Priority for Partitioned Multiprocessor Real-Time Systems
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. (Complex Real-Time Systems)ORCID iD: 0000-0002-0474-2904
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. (Complex Real-Time Systems)ORCID iD: 0000-0002-1687-930X
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. (Complex Real-Time Systems)ORCID iD: 0000-0001-6234-5117
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. (Complex Real-Time Systems)ORCID iD: 0000-0001-6132-7945
2014 (English)Report (Other academic)
Abstract [en]

Two traditional approaches exist for a task that is blocked on a global resource; a task either performs a non-preemptive busy wait, i.e., spins, or suspends and releases the processor. Previously, we have shown that both approaches can be viewed as spinning either at the highest priority HP or at the lowest priority on the processor LP, respectively. Based on this view, previously we have generalized a task's blocking behavioral model, as spinning at any arbitrary priority level. In this paper, we focus on a particular class of spin-lock protocols from the introduced flexible spin-lock model where spinning is performed at a priority equal to or higher than the highest local ceiling of the global resources accessed on a processor referred to as CP spin-lock approach. In this paper, we assume that all tasks of a specific processor are spinning on the same priority level. Given this class and assumption, we show that there exists a spin-lock protocol in this range that dominates the classic spin-lock protocol which tasks spin on highest priority level (HP). However we show that this new approach is incomparable with the CP spin-lock approach. Moreover, we show that there may exist an intermediate spin-lock approach between the priority used by CP spin-lock approach and the new introduced spin-lock approach that can make a task set schedulable when those two cannot. We provide an extensive evaluation results comparing the HP, CP and the new proposed approach.

Place, publisher, year, edition, pages
Västerås: Mälardalen University , 2014.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:mdh:diva-26523ISRN: MDH-MRTC-294/2014-1-SEOAI: oai:DiVA.org:mdh-26523DiVA: diva2:762478
Available from: 2014-11-11 Created: 2014-11-11 Last updated: 2014-11-12Bibliographically approved
In thesis
1. Lock-Based Resource Sharing in Real-Time Multiprocessor Platforms
Open this publication in new window or tab >>Lock-Based Resource Sharing in Real-Time Multiprocessor Platforms
2014 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Embedded systems are typically resource constrained, i.e., resources such as processors, I/O devices, shared buffers or shared memory can be limited for tasks in the system. Therefore, techniques that enable an efficient usage of such resources are of great importance.

In the industry, typically large and complex software systems are divided into smaller parts (applications) where each part is developed independently. Migration towards multiprocessor platforms has become inevitable from an industrial perspective. Due to such migration and to efficient use of system resources, these applications eventually may be integrated on a shared multiprocessor platform. In order to facilitate the integration phase of the applications on a shared platform, the timing and resource requirements of each application can be provided in an interface when the application is developed. The system integrator can benefit from such provided information in the interface of each application to ease the integration process. In this thesis, we have provided the resource and timing requirements of each application in their interfaces for applications that may need several processors to be allocated on when they are developed.

Although many scheduling techniques have been studied for multiprocessor systems, these techniques are usually based on the assumption that tasks are independent, i.e. do not share resources other than the processors. This assumption is typically not true. In this thesis, we provide an extension to such systems to handle sharing of resources other than processor among tasks. Two traditional approaches exist for multiprocessor systems to schedule tasks on processors. A recent scheduling approach for multiprocessors has combined the two traditional approaches and achieved a hybrid more efficient approach compared to the two previous one. Due to the complex nature of this scheduling approach the conventional approaches for resource sharing could not be used straight forwardly. In this thesis, we have modified resource sharing approaches such that they can be used in such hybrid scheduling systems. A second concern is that enabling resource sharing in the systems can cause unpredictable delays and variations in response time of tasks which can degrade system performance. Therefore, it is of great significance to improve the resource handling techniques to reduce the effect of imposed delays caused by resource sharing in a multiprocessor platform. In this thesis we have proposed alternative techniques for resource handling that can improve system performance for special setups.

Place, publisher, year, edition, pages
Västerås: Mälardalen University, 2014
Series
Mälardalen University Press Licentiate Theses, ISSN 1651-9256 ; 189
National Category
Computer Science
Research subject
Computer Science
Identifiers
urn:nbn:se:mdh:diva-26532 (URN)978-91-7485-178-6 (ISBN)
Presentation
2014-12-11, Lambda, Mälardalens högskola, Västerås, 09:15 (English)
Opponent
Supervisors
Available from: 2014-11-12 Created: 2014-11-11 Last updated: 2014-12-03Bibliographically approved

Open Access in DiVA

No full text

Other links

http://www.es.mdh.se/publications/3766-Per_Processor_Spin_Lock_Priority_for_Partitioned_Multiprocessor_Real_Time_Systems

Search in DiVA

By author/editor
Afshar, SaraBehnam, MorisJ. Bril, ReinderNolte, Thomas
By organisation
Embedded Systems
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 404 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf