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

Darko Stefanović; Margaret Rose Martonosi

doi:10.1007/3-540-44614-1_44

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

Darko Stefanović, Margaret Rose Martonosi

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Field-Programmable Logic and Applications
Subtitle of host publication	The Roadmap to Reconfigurable Computing - 10th International Conference, FPL 2000, Proceedings
Editors	Reiner W. Hartenstein, Herbert Grunbacher
Publisher	Springer Verlag
Pages	412-422
Number of pages	11
ISBN (Print)	3540678999, 9783540678991
DOIs	https://doi.org/10.1007/3-540-44614-1_44
State	Published - 2000
Event	10th International Conference on Field-Programmable Logic and Applications, FPL 2000 - Villach, Austria Duration: Aug 27 2000 → Aug 30 2000

Publication series

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

Other

Other	10th International Conference on Field-Programmable Logic and Applications, FPL 2000
Country/Territory	Austria
City	Villach
Period	8/27/00 → 8/30/00

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-44614-1_44

Cite this

Stefanović, D., & Martonosi, M. R. (2000). On availability of bit-narrow operations in general-purpose applications. In R. W. Hartenstein, & H. Grunbacher (Eds.), Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing - 10th International Conference, FPL 2000, Proceedings (pp. 412-422). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1896). Springer Verlag. https://doi.org/10.1007/3-540-44614-1_44

Stefanović, Darko ; Martonosi, Margaret Rose. / On availability of bit-narrow operations in general-purpose applications. Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing - 10th International Conference, FPL 2000, Proceedings. editor / Reiner W. Hartenstein ; Herbert Grunbacher. Springer Verlag, 2000. pp. 412-422 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1d51eb95bfa74ea8ac5e1ad4273a2ff1,

title = "On availability of bit-narrow operations in general-purpose applications",

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{\textquoteright}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.",

author = "Darko Stefanovi{\'c} and Martonosi, {Margaret Rose}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 10th International Conference on Field-Programmable Logic and Applications, FPL 2000 ; Conference date: 27-08-2000 Through 30-08-2000",

year = "2000",

doi = "10.1007/3-540-44614-1_44",

language = "English (US)",

isbn = "3540678999",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "412--422",

editor = "Hartenstein, {Reiner W.} and Herbert Grunbacher",

booktitle = "Field-Programmable Logic and Applications",

address = "Germany",

}

Stefanović, D & Martonosi, MR 2000, On availability of bit-narrow operations in general-purpose applications. in RW Hartenstein & H Grunbacher (eds), Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing - 10th International Conference, FPL 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1896, Springer Verlag, pp. 412-422, 10th International Conference on Field-Programmable Logic and Applications, FPL 2000, Villach, Austria, 8/27/00. https://doi.org/10.1007/3-540-44614-1_44

On availability of bit-narrow operations in general-purpose applications. / Stefanović, Darko; Martonosi, Margaret Rose.
Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing - 10th International Conference, FPL 2000, Proceedings. ed. / Reiner W. Hartenstein; Herbert Grunbacher. Springer Verlag, 2000. p. 412-422 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1896).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Stefanović, Darko

AU - Martonosi, Margaret Rose

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2000.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84947577213&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947577213&partnerID=8YFLogxK

U2 - 10.1007/3-540-44614-1_44

DO - 10.1007/3-540-44614-1_44

M3 - Conference contribution

AN - SCOPUS:84947577213

SN - 3540678999

SN - 9783540678991

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 412

EP - 422

BT - Field-Programmable Logic and Applications

A2 - Hartenstein, Reiner W.

A2 - Grunbacher, Herbert

PB - Springer Verlag

T2 - 10th International Conference on Field-Programmable Logic and Applications, FPL 2000

Y2 - 27 August 2000 through 30 August 2000

ER -

Stefanović D, Martonosi MR. On availability of bit-narrow operations in general-purpose applications. In Hartenstein RW, Grunbacher H, editors, Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing - 10th International Conference, FPL 2000, Proceedings. Springer Verlag. 2000. p. 412-422. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44614-1_44

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

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this