Lines Matching refs:in

9 which are otherwise non-coherent, in situations where the hardware
17 final value seen in that memory location when all the votes have been
21 in finite time, a CPU will only enter the election in the first place if
68 whether an election is in progress, and plays a role analogous to the
69 "entering" array in Lamport's bakery algorithm [1].
95    vlocks can be cascaded in a voting hierarchy to permit better scaling
96    if necessary, as in the following hypothetical example for 4096 CPUs:
125    we can read the whole array in one transaction (providing the number
135    ...in place of code equivalent to:
147    reducing bus contention in contended cases.
152    we do not care which element of currently_voting appears in which
153    bits of Rt, so there is no need to worry about endianness in this
156    If there are too many CPUs to read the currently_voting array in
164    to keep the code simple this was not attempted in the initial
171    when executing the algorithm in cached memory.
181    -1 as in the pseudocode).  This allows statically-allocated vlocks
183    them in .bss.
193 use in ARM-based big.LITTLE platforms, with review and input gratefully
200 License, as defined in linux/COPYING.