Changeset 97e1553 in rtems-docs


Ignore:
Timestamp:
01/17/17 09:39:08 (6 years ago)
Author:
Sebastian Huber <sebastian.huber@…>
Branches:
5, am, master
Children:
418dee8
Parents:
7d78d31
git-author:
Sebastian Huber <sebastian.huber@…> (01/17/17 09:39:08)
git-committer:
Sebastian Huber <sebastian.huber@…> (01/18/17 10:31:46)
Message:

c-user: Add support for references via bibtex

​https://sphinxcontrib-bibtex.readthedocs.io/en/latest/index.html

Update #2871.

Files:
3 added
6 edited

Legend:

Unmodified
Added
Removed

  • c-user/conf.py

    r7d78d31 r97e1553  
    33
    44from conf import *
     5
     6extensions = ['sphinxcontrib.bibtex']
    57
    68version = '4.11.99'

  • c-user/index.rst

    r7d78d31 r97e1553  
    7878        example_application
    7979        glossary
     80        zreferences
    8081
    8182*       :ref:`genindex`

  • c-user/symmetric_multiprocessing_services.rst

    r7d78d31 r97e1553  
    186186
    187187Clustered scheduling helps to control the worst-case latencies in
    188 multi-processor systems, see *Brandenburg, Bjorn B.: Scheduling and Locking in
    189 Multiprocessor Real-Time Operating Systems. PhD thesis,
    190 2011.http://www.cs.unc.edu/~bbb/diss/brandenburg-diss.pdf*.  The goal is to
    191 reduce the amount of shared state in the system and thus prevention of lock
     188multi-processor systems, see :cite:`Brandenburg:2011:SL`. The goal is to reduce
     189the amount of shared state in the system and thus prevention of lock
    192190contention. Modern multi-processor systems tend to have several layers of data
    193191and instruction caches.  With clustered scheduling it is possible to honour the
    … …  
    205203  boosting), and
    206204
    207 - semaphores using the :ref:`Multiprocessor Resource Sharing Protocol` (MrsP).
     205- semaphores using the Multiprocessor Resource Sharing Protocol :cite:`Burns:2013:MrsP`.
    208206
    209207The clustered scheduling approach enables separation of functions with
    … …  
    236234empty, then it is appended to the FIFO.  So there is FIFO fairness with respect
    237235to the highest priority task of each scheduler instances. See also
    238 *Brandenburg, Bjorn B.: A fully preemptive multiprocessor semaphore protocol
    239 for latency-sensitive real-time applications. In Proceedings of the 25th
    240 Euromicro Conference on Real-Time Systems (ECRTS 2013), pages 292-302,
    241 2013.http://www.mpi-sws.org/~bbb/papers/pdf/ecrts13b.pdf*.
     236:cite:`Brandenburg:2013:OMIP`.
    242237
    243238Such a two level queue may need a considerable amount of memory if fast enqueue

  • cpu-supplement/conf.py

    r7d78d31 r97e1553  
    33
    44from conf import *
     5
     6extensions = ['sphinxcontrib.bibtex']
    57
    68version = '1.0'

  • cpu-supplement/index.rst

    r7d78d31 r97e1553  
    5858        sparc64
    5959        command
     60        zreferences
    6061
    6162*       :ref:`genindex`

  • cpu-supplement/port.rst

    r7d78d31 r97e1553  
    330330``_CPU_Context_Initialize()`` function.  There are support functions available
    331331via ``#include <rtems/score/tls.h>`` which implement Variants I and II
    332 according to Ulrich Drepper, *ELF Handling For Thread-Local Storage*.
     332according to :cite:`Drepper:2013:TLS`.
    333333
    334334``_TLS_TCB_at_area_begin_initialize()``
Note: See TracChangeset for help on using the changeset viewer.