Lines Matching refs:scheduler

38 cooperative scheduler (L-thread) subsystem. More details of the L-thread
140 in ``--rx/--tx`` are used to affinitize threads to the selected scheduler.
162 affinitize threads to the selected cpu-set (scheduler). Thus it is possible to
191 a) Start every thread on different scheduler (1:1)::
282 On initialization an L-thread scheduler is started on every EAL thread. On all
345 The subsystem provides a simple cooperative scheduler to enable arbitrary
362 on a single CPU, the scheduler must frequently switch between the threads,
379 ready, and the scheduler may employ a time slice giving each thread a maximum
385 L-thread scheduler performs the same multiplexing function for L-threads
386 within a single pthread as the OS scheduler does for pthreads within an
387 application process. The L-thread scheduler is simply the main loop of a
394 other, nor can the L-thread scheduler preempt a running L-thread (i.e.
397 explicitly and of their own volition return to the scheduler at frequent
407 call to the L-thread scheduler. Thus it is only necessary to preserve the
424 pointers to threads that are ready to run. The L-thread scheduler is a simple
427 scheduler loop) and restoring the context of the next thread from its thread
431 in its main loop) thus returning to the scheduler's own main loop. Yielding
434 and forth the between L-threads and scheduler loop.
528 By contrast the L-thread subsystem has fixed functionality, the scheduler policy
653 same scheduler may freely perform signal or broadcast operations. L-threads
712 yielding thread is inserted into a peer ready queue of another scheduler.
715 ready queue on the destination scheduler.
719 scheduler can be orders of magnitude faster than the same measurement for
730 of the scheduler loop. This means that the worst case jitter on timer expiry
771 scheduler maintains its own caches of objects: lthreads, their stacks, TLS,
776 If an L-thread has been affinitized to a different scheduler, then it can
792 on the destination scheduler, if the destination is a on another NUMA node it
860 initialized. Other than global variables each scheduler is initialized
868 L-thread scheduler.
881 The L-thread scheduler is started by calling the function ``lthread_run()``
886 the scheduler have exited, and the scheduler has been explicitly stopped by
890 All these function do is tell the scheduler that it can exit when there are no
896 **Important Note:** It is assumed when the scheduler exits that the application
897 is terminating for good, the scheduler does not free resources before exiting
898 and running the scheduler a subsequent time will result in undefined behavior.
935 cannot block without stalling the scheduler and with it all other cooperative
948 * Affinitizing the thread to another scheduler devoted (as a matter of policy)
962 run on the same scheduler then it its probably safe to remove locks and spin
974 another ready L-thread to be resumed, thus not blocking the scheduler. When
980 When the contending L-threads are running on the same scheduler then an
982 scheduler completely (see :ref:`porting_infinite_loops` below).
1006 consequence of stalling the L-thread scheduler and unless the delay is very
1108 pthread is the L-thread scheduler thread, and, although an L-thread is
1109 terminating, there must be a return to the scheduler in order that the system
1165 a single pthread. The current scheduler is defined by