Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.os.linux.misc > #14691 > unrolled thread

BFS source code

Back to article view | Back to comp.os.linux.misc

Contents

  BFS source code ruben safir <ruben@mrbrklyn.com> - 2015-05-02 23:28 -0400

#14691 — BFS source code

I'm confused by the documentation of the BFS scheduler.  it say that is has 
a single run queue for the entire system as a double linked list and then 
later it says:

BFS has 103 priority queues. 100 of these are dedicated to the static priority
of realtime tasks, and the remaining 3 are, in order of best to worst priority,
SCHED_ISO (isochronous), SCHED_NORMAL, and SCHED_IDLEPRIO (idle priority
scheduling). When a task of these priorities is queued, a bitmap of running
priorities is set showing which of these priorities has tasks waiting for CPU
time. When a CPU is made to reschedule, the lookup for the next task to get
CPU time is performed in the following way:



This seems like a contradiction.  where is the linked list in the code for BFS?

Ruben 

[toc] | [standalone]

Back to top | Article view | comp.os.linux.misc

csiph-web