Scheduling algorithm whereby a thread's priority is decayed by 1. See also FIFO, round robin, and sporadic.
Refers to the ability of the DCLZ algorithm to "adapt" or change to accommodate differences in the type of data to be compressed.
(adj.) Taking available information into account. For example, an adaptive mesh-generating algorithm generates a finer resolution mesh near to discontinuities such as boundaries and corners. An adaptive routing algorithm may send identical messages in different directions at different times depending on the local density information it has on message traffic. See also oblivious