Editing Temporal multithreading (section)

==Variations==
There are many possible variations of temporal multithreading, but most can be classified into two sub-forms:

;[[Granularity (parallel computing)|Coarse-grained]]: The main processor pipeline contains only one thread at a time.  The processor must effectively perform a rapid [[context switch]] before executing a different thread.  This fast context switch is sometimes referred to as a ''thread switch''.  There may or may not be additional penalty cycles when switching.

:There are many possible variations of coarse-grained temporal multithreading, mainly concerning the algorithm that determines when thread switching occurs.  This algorithm may be based on one or more of many different factors, including cycle counts, [[Cache miss#CACHE-MISS|cache misses]], and [[Unbounded nondeterminism#Fairness|fairness]].

;[[Granularity (parallel computing)|Fine-grained]] (or interleaved): The main processor pipeline may contain multiple threads, with context switches effectively occurring between pipe stages (e.g., in the [[barrel processor]]). This form of multithreading can be more expensive than the coarse-grained forms because execution resources that span multiple pipe stages may have to deal with multiple threads.  Also contributing to cost is the fact that this design cannot be optimized around the concept of a "background" thread &mdash; any of the concurrent threads implemented by the hardware might require its [[State (computer science)|state]] to be read or written on any cycle.<ref>{{Cite book|title = Operating System Concepts|last = Silberschatz|first = Abraham|publisher = Wiley, 9th Edition|year = 2012|isbn = 978-1118063330|pages = 283}}</ref>