Multilevel feedback scheduling uses these data structures.
Kendall notation allows one to characterize models based on actual instances of this structure. Multilevel feedback scheduling uses these data structures. Double ended ones are possible while heaps and their variants are typically used to implement priority ones. This data structure supports a front operation and this data type is usually contrasted with a stack. For 10 points, name this data structure that is first in first out and are exemplified by lines at grocery stores.
Kendall notation allows one to characterize models based on actual instances of this structure.
{queue} [prompt on {FIFO}]