mirror of
https://git.rtems.org/rtems-docs/
synced 2025-05-17 15:41:42 +08:00
parent
3348f192bd
commit
f1eb94b143
@ -1,7 +1,7 @@
|
||||
.. SPDX-License-Identifier: CC-BY-SA-4.0
|
||||
|
||||
.. Copyright (C) 2020 Richi Dubey (richidubey@gmail.com)
|
||||
.. Copyright (C) 2017, 2021 embedded brains GmbH (http://www.embedded-brains.de)
|
||||
.. Copyright (C) 2015, 2021 embedded brains GmbH (http://www.embedded-brains.de)
|
||||
.. Copyright (C) 1988, 1998 On-Line Applications Research Corporation (OAR)
|
||||
|
||||
Glossary
|
||||
@ -725,7 +725,8 @@ Glossary
|
||||
A simple approach to extend the priority inheritance protocol for
|
||||
clustered scheduling is priority boosting. In case a mutex is owned by a
|
||||
task of another cluster, then the priority of the owner task is raised to
|
||||
an artificially high priority, the pseudo-interrupt priority.
|
||||
an artificially high priority. This approach is not used in RTEMS, see also
|
||||
:term:`OMIP`.
|
||||
|
||||
priority inheritance
|
||||
An algorithm that calls for the lower priority task holding a resource to
|
||||
|
@ -330,7 +330,7 @@ O(m) Independence-Preserving Protocol (OMIP)
|
||||
|
||||
The :math:`O(m)` Independence-Preserving Protocol (OMIP) is a generalization of
|
||||
the priority inheritance protocol to clustered scheduling which avoids the
|
||||
non-preemptive sections present with priority boosting
|
||||
non-preemptive sections present with :term:`priority boosting`
|
||||
:cite:`Brandenburg:2013:OMIP`. The :math:`m` denotes the number of processors
|
||||
in the system. Similar to the uniprocessor priority inheritance protocol, the
|
||||
OMIP mutexes do not need any external configuration data, e.g. a ceiling
|
||||
|
Loading…
x
Reference in New Issue
Block a user