Resource Sharing among Prioritized Real-Time Applications on Multiprocessors

In this paper, we propose a new protocol for handling resource sharing among prioritized real-time applications composed on a multiprocessor platform. We propose an optimal priority assignment algorithm which assigns unique priorities to the applications based on information in their interfaces. We have performed experimental evaluations to compare the proposed protocol (called MSOS-Priority) to the current state of the art locking protocols under multiprocessor partitioned scheduling, i.e., MPCP, MSRP, FMLP, MSOS, and OMLP. The valuations show that MSOS-Priority mostly performs significantly better than alternative approaches.

Moghaddami Khalilzad, NimaMälardalens högskola,Inbyggda system(Swepub:mdh)nmd01 (author)
Nemati, Farhang,Senior Lecturer,1975-Mälardalens högskola,Inbyggda system(Swepub:mdh)fni01 (author)
Nolte, ThomasMälardalens högskola,Inbyggda system(Swepub:mdh)tne01 (author)
Mälardalens högskolaInbyggda system (creator_code:org_t)

In:ACM SIGBED Review - Special Issue on the 6th International Workshop on Compositional Theory and Technology for Real-Time Embedded Systems: Association for Computing Machinery (ACM), s. 46-55
In:ACM SIGBED Review: Association for Computing Machinery (ACM), s. 46-551551-3688

By the author/editor: Afshar, Sara; Moghaddami Khali ...; Nemati, Farhang, ...; Nolte, Thomas

About the subject

ENGINEERING AND TECHNOLOGY: ENGINEERING AND ...; and Electrical Engin ...; and Computer Systems

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.