Lines Matching refs:time

8 threads. Each logical thread is serviced for a *time slice* by a
9 physical thread. If a thread runs longer than a time slice, as most do,
11 appendix details the costs incurred by time slicing.
14 The most obvious is the time for *context switching* between logical
26 not a cache primer.) When a logical thread gets its time slice, as it
27 references a piece of data for the first time, this data will be pulled
31 Time slicing undoes this, because if a thread A finishes its time slice,
34 data. When thread A gets its next time slice, it will need to reload
36 worse yet, the next time slice for thread A may be on a different
41 lock on a resource, and its time slice runs out before it releases the
42 lock. No matter how short a time the thread intended to hold the lock,
44 turn at a time slice to come up. Any other threads waiting on the lock
45 either pointlessly busy-wait, or lose the rest of their time slice. The