• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 3 of 3

The Comparand Pattern

by Pascal Costanza, Arno Haase
"... The Comparand pattern provides a means to interpet different objects as being identical for certain contexts. It does so by introducing an instance variable in each class of interest - the comparand - and using it for comparison. Identification of different objects is needed when more than one refer ..."
Abstract - Add to MetaCart
The Comparand pattern provides a means to interpet different objects as being identical for certain contexts. It does so by introducing an instance variable in each class of interest - the comparand - and using it for comparison. Identification of different objects is needed when more than one

Optical Implementation of a Constant-Time Multicomparand Bit-Parallel Magnitude-Comparison Algorithm Using Wavelength- and . . .

by Detofsky, Abram Detofsky, Peng Yin Choo, Ahmed Louri , 1998
"... highly dependent on word size. One magnitude-comparison algorithm 9 succeeds in achieving word and bit parallelism, but it requires that multiple comparands be processed in serial fashion. In this Letter we present an algorithm and architecture that perform magnitude- comparison processing in a m ..."
Abstract - Add to MetaCart
multiple-comparand word-parallel (many words compared with many words) and bit-parallel (many bits compared simultaneously) manner. Binary patterns are represented by spatially distributed orthogonally polarized locations on a twodimensional pixelated grid. We define logical 1 as vertically polarized

Power Efficient Comparators for Long Arguments in Superscalar Processors

by Dmitry Ponomarev, Gurhan Kucuk, Oguz Ergin, Kanad Ghose
"... Traditional pulldown comparators that are used to implement associative addressing logic in superscalar microprocessors dissipate energy on a mismatch in any bit position in the comparands. As mismatches occur much more frequently than matches in many situations, such circuits are extremely energy–i ..."
Abstract - Add to MetaCart
as long as 32 bits in size. Such long comparands are routinely used in the load–store queues, caches, BTBs and TLBs. We use the actual layout data and the realistic bit patterns of the comparands (obtained from the simulated execution of SPEC 2000 benchmarks) to show the energy impact from the use
Results 1 - 3 of 3
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University