On availability of bit-narrow operations in general-purpose applications

Darko Stefanović, Margaret Rose Martonosi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

Program instructions that consume and produce small operands can be executed in hardware circuitry of less than full size. We compare different proposed models of accounting for the usefulness of bit-positions in operands, using a run-time profiling tool, both to observe and summarize operand values, and to reconstruct and analyze the program’s data-flow graph to discover useless bits.We find that under aggressive models, the average number of useful bits per integer operand is as low as 10, not only in kernels but also in general-purpose applications from SPEC95.

Original languageEnglish (US)
Title of host publicationField-Programmable Logic and Applications
Subtitle of host publicationThe Roadmap to Reconfigurable Computing - 10th International Conference, FPL 2000, Proceedings
EditorsHerbert Grunbacher, Reiner W. Hartenstein
PublisherSpringer Verlag
Pages412-422
Number of pages11
ISBN (Print)3540678999, 9783540678991
StatePublished - Jan 1 2000
Event10th International Conference on Field-Programmable Logic and Applications, FPL 2000 - Villach, Austria
Duration: Aug 27 2000Aug 30 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1896
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Field-Programmable Logic and Applications, FPL 2000
CountryAustria
CityVillach
Period8/27/008/30/00

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On availability of bit-narrow operations in general-purpose applications'. Together they form a unique fingerprint.

Cite this