diff options
| author | Sebastian Huber <sebastian.huber@embedded-brains.de> | 2014-05-13 15:57:43 +0200 |
|---|---|---|
| committer | Sebastian Huber <sebastian.huber@embedded-brains.de> | 2014-05-14 14:46:19 +0200 |
| commit | 5b1ff71ab76d892ac33651b69c89b7cd14ab3dee (patch) | |
| tree | 42deb6a618fc8c0392017849366ce0f266c86fbb /cpukit/score/include/rtems/score/schedulersimplesmp.h | |
| parent | sparc: Change asm to __asm__ to compile with -std=c99. (diff) | |
| download | rtems-5b1ff71ab76d892ac33651b69c89b7cd14ab3dee.tar.bz2 | |
score: Scheduler documentation
Diffstat (limited to 'cpukit/score/include/rtems/score/schedulersimplesmp.h')
| -rw-r--r-- | cpukit/score/include/rtems/score/schedulersimplesmp.h | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/cpukit/score/include/rtems/score/schedulersimplesmp.h b/cpukit/score/include/rtems/score/schedulersimplesmp.h index dcdc6819a5..880115faaf 100644 --- a/cpukit/score/include/rtems/score/schedulersimplesmp.h +++ b/cpukit/score/include/rtems/score/schedulersimplesmp.h @@ -3,7 +3,7 @@ * * @brief Simple SMP Scheduler API * - * @ingroup ScoreSchedulerSMP + * @ingroup ScoreSchedulerSMPSimple */ /* @@ -28,16 +28,16 @@ extern "C" { #include <rtems/score/schedulersmp.h> /** - * @defgroup ScoreSchedulerSMP Simple SMP Scheduler + * @defgroup ScoreSchedulerSMPSimple Simple Priority SMP Scheduler * - * @ingroup ScoreScheduler + * @ingroup ScoreSchedulerSMP * - * The Simple SMP Scheduler allocates a processor for the processor count - * highest priority ready threads. The thread priority and position in the - * ready chain are the only information to determine the scheduling decision. - * Threads with an allocated processor are in the scheduled chain. After - * initialization the scheduled chain has exactly processor count nodes. Each - * processor has exactly one allocated thread after initialization. All + * The Simple Priority SMP Scheduler allocates a processor for the processor + * count highest priority ready threads. The thread priority and position in + * the ready chain are the only information to determine the scheduling + * decision. Threads with an allocated processor are in the scheduled chain. + * After initialization the scheduled chain has exactly processor count nodes. + * Each processor has exactly one allocated thread after initialization. All * enqueue and extract operations may exchange threads with the scheduled * chain. One thread will be added and another will be removed. The scheduled * and ready chain is ordered according to the thread priority order. The |