underflow
- noun
- /ˈʌndərfloʊ/
- Specialized
:
subdesbordamiento
- In computing, underflow occurs when a calculation results in a number smaller than the smallest representable value.
- underflow and overflow
- exponent underflow
- underflow condition
Examples
-
Underflow and overflow exceptions require an extra cycle in the WB stage for exponent correction.
Academic text (1996) -
If a conversion strategy is adopted, return values from conversion functions that indicate that exponent underflow or overflow has occurred must be heeded.
Academic text (1999) -
Also, certain exponent values close to overflow or underflow may take additional cycles.
Academic text (1999) -
For example, in the event of underflow, the rounder may be required to produce a denormalized result if a trap does not occur.
Academic text (1999) -
The first rounding cycle is used to confirm that a definite overflow or underflow condition exists.
Academic text (1999) -
The rounder confirms the exponent underflow condition.
Academic text (1999) -
Exponent underflow and overflow detection is a two-step process.
Academic text (1999) -
Exponent overflow and underflow are detected with a combination of the post-normalizer and the rounder.
Academic text (1999) -
Finally, binary exceptional conditions such as exponent overflow and underflow are detected through the combined use of the post-normalizer and the rounder.
Academic text (1999) -
The dataflow detects exponent underflow in the post-normalizer and rounder, as is subsequently discussed in detail.
Academic text (1999)
Antonyms
Surface Forms
Morphology
Etymology
Underflow comes from the simple parts under 'below' and flow 'a moving stream'. Imagine a tiny number as a drop of water trying to flow under the lowest pipe so it slips away and cannot be kept, so underflow in computing means a result too small to be stored.