Sciweavers

236 search results - page 41 / 48
» Memory Bank Predictors
Sort
View
FCCM
2007
IEEE
111views VLSI» more  FCCM 2007»
14 years 2 months ago
A Structural Object Programming Model, Architecture, Chip and Tools for Reconfigurable Computing
A new platform for reconfigurable computing has an object-based programming model, with architecture, silicon and tools designed to faithfully realize this model. The platform is ...
Michael Butts, Anthony Mark Jones, Paul Wasson
ACISP
2000
Springer
14 years 4 days ago
An Extremely Small and Efficient Identification Scheme
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...
William D. Banks, Daniel Lieman, Igor Shparlinski
FPGA
2000
ACM
128views FPGA» more  FPGA 2000»
13 years 11 months ago
Factoring large numbers with programmable hardware
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...
Hea Joung Kim, William H. Mangione-Smith
JCC
2008
125views more  JCC 2008»
13 years 7 months ago
Efficient electronic integrals and their generalized derivatives for object oriented implementations of electronic structure cal
: For the new parallel implementation of electronic structure methods in ACES III (Lotrich et al., in preparation) the present state-of-the-art algorithms for the evaluation of ele...
Norbert Flocke, Victor Lotrich
SIGMETRICS
2008
ACM
13 years 7 months ago
DRAM is plenty fast for wirespeed statistics counting
Per-flow network measurement at Internet backbone links requires the efficient maintanence of large arrays of statistics counters at very high speeds (e.g. 40 Gb/s). The prevailin...
Bill Lin, Jun (Jim) Xu