Speeding up the “Puzzle” Benchmark a “bit”

Abstract

We show how Baskett's "Puzzle" benchmark can be speeded up at least an order of magnitude by utilizing <i>bit-vectors.</i> Unlike many optimization techniques, the use of bit-vectors enhances the readability and understandability of the code. Since bit-vectors already utilize word-wide parallelism, it is unlikely that parallel processors will be able to… (More)
DOI: 10.1145/147135.147143

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics