Bibliographic record
Abstract
Approximate computing has the potential to improve performance and energy efficiency in high-performance processors. This work focuses on the impact of approximating conventionally non-trivial instructions to trivial instructions. Instructions which do not need to be processed due to the nature of their operands, such as division by 1 or addition with 0 are trivial instructions. By approximating instructions which results in an acceptable level of accuracy in programs' outputs, we can increase the number of trivial instructions and enhance power and performance of trivial bypassing. To approximate integer values, we mask the least significant bits (LSBs) of instructions' operands. The number of masked bits is under the control of programmers. To approximate floating-point values, we propose two different schemes. The first scheme sets a threshold and approximates the values that lie within the threshold region. A 32- or 64-bit comparator, depending on the operand size, is used for comparison between the operand and the threshold. Thus, instructions which would have used the expensive floating-point units are bypassed and only a comparator and a few gates are used instead. The second scheme reduces cost of approximation by replacing full-blown comparators with smaller ones and performing inexact comparisons between the operand and the threshold. Our evaluations using a diverse set of benchmarks reveal that precise comparison and trivial bypassing improve energy-delay by 21% and 13%, respectively while the inexact approximation improves energy-delay by 22%.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".