summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorSebastian Huber <sebastian.huber@embedded-brains.de>2017-02-03 11:55:29 +0100
committerSebastian Huber <sebastian.huber@embedded-brains.de>2017-02-03 11:55:29 +0100
commit90a3c414ce86abcdef261579be6570a8b559498e (patch)
tree7d007af4926265379591ad23b68ffa89b8c6e576
parentc-user: Update scheduler helping protocol (diff)
downloadrtems-docs-90a3c414ce86abcdef261579be6570a8b559498e.tar.bz2
c-user: Add TAS and TTAS terms
-rw-r--r--c-user/glossary.rst6
-rw-r--r--c-user/symmetric_multiprocessing_services.rst4
2 files changed, 8 insertions, 2 deletions
diff --git a/c-user/glossary.rst b/c-user/glossary.rst
index aab9601..2fa7e98 100644
--- a/c-user/glossary.rst
+++ b/c-user/glossary.rst
@@ -668,6 +668,9 @@ Glossary
target
The system on which the application will ultimately execute.
+ TAS
+ An acronym for Test-And-Set.
+
task
thread
A logically complete thread of execution. It consists normally of a set
@@ -741,6 +744,9 @@ Glossary
missed. Rate Monotonic Scheduling can be used to determine if all
deadlines will be met under transient overload.
+ TTAS
+ An acronym for Test and Test-And-Set.
+
user extensions
Software routines provided by the application to enhance the
functionality of RTEMS.
diff --git a/c-user/symmetric_multiprocessing_services.rst b/c-user/symmetric_multiprocessing_services.rst
index 51d4eff..01246ae 100644
--- a/c-user/symmetric_multiprocessing_services.rst
+++ b/c-user/symmetric_multiprocessing_services.rst
@@ -643,8 +643,8 @@ variables,
Updates of the heir thread are done via a normal store operation. The thread
dispatch necessary indicator of another processor is set as a side-effect of an
inter-processor interrupt. So, this change notification works without the use
-of locks. The thread context is protected by a TTAS lock embedded in the
-context to ensure that it is used on at most one processor at a time.
+of locks. The thread context is protected by a :term:`TTAS` lock embedded in
+the context to ensure that it is used on at most one processor at a time.
Normally, only thread-specific or per-processor locks are used during a thread
dispatch. This implementation turned out to be quite efficient and no lock
contention was observed in the testsuite. The heavy-weight thread dispatch