The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Programmable active memories: reconfigurable systems come of age
Abstract
Programmable active memories (PAM) are a novel form of universal reconfigurable hardware coprocessor. Based on field-programmable gate array (FPGA) technology, a PAM is a virtual machine, controlled by a standard microprocessor, which can be dynamically and indefinitely reconfigured into a large number of application-specific circuits. PAM's offer a new mixture of hardware performance and software versatility. We review the important architectural features of PAM's, through the example of DECPeRLe-1, an experimental device built in 1992. PAM programming is presented, in contrast to classical gate-array and full custom circuit design. Our emphasis is on large, code-generated synchronous systems descriptions; no compromise is made with regard to the performance of the target circuits. We exhibit a dozen applications where PAM technology proves superior, both in performance and cost, to every other existing technology, including supercomputers, massively parallel machines, and conventional custom hardware. The fields covered include computer arithmetic, cryptography, error correction, image analysis, stereo vision, video compression, sound synthesis, neural networks, high-energy physics, thermodynamics, biology and astronomy. At comparable cost, the computing power virtually available in a PAM exceeds that of conventional processors by a factor 10 to 1000, depending on the specific application, in 1992. A technology shrink increases the performance gap between conventional processors and PAM's. By Noyce's law, we predict by how much the performance gap will widen with time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Computer Architecture: A Quantitative Approach
Hennessy, J. L., & Patterson, D. A. (1989) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 9,375
The Feynman Lectures on Physics
(2013) · Choice Reviews Online · doi:10.5860/choice.50-6817 · Cited by 1,866
Real time correlation-based stereo: algorithm, implementations and applications
Faugeras, O. D., Hotz, B., Mathieu, H., Viéville, T., Zhang, Z., Fua, P., Théron, E., Moll, L., Berry, G., Vuillemin, J. E., et al. (1993) · Cited by 395
Self-citationFast implementations of RSA cryptography
Shand, M., & Vuillemin, J. (2002) · Proceedings of IEEE 11th Symposium on Computer Arithmetic · doi:10.1109/arith.1993.378085 · Cited by 221
Self-citationSchlack, M. (1993) · Datamation · Cited by 153
Programmable active memories: a performance assessment
Bertin, P., Roncin, D., & Vuillemin, J. E. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56731-3_12 · Cited by 136
Self-citationA Survey of Hardware Implementations of RSA
Brickell, E. F. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_34 · Cited by 99
Cited by
Reconfigurable computing: a survey of systems and software
Compton, K., & Hauck, S. (2002) · ACM Computing Surveys · doi:10.1145/508352.508353 · Cited by 1,240
Garp: a MIPS processor with a reconfigurable coprocessor
Hauser, J. R., & Wawrzynek, J. (2002) · Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186) · doi:10.1109/fpga.1997.624600 · Cited by 792
The roles of FPGAs in reprogrammable systems
Hauck, S. (1998) · Proceedings of the IEEE · doi:10.1109/5.663540 · Cited by 373
Trimberger, S. M. S. (2018) · IEEE Solid-State Circuits Magazine · doi:10.1109/mssc.2018.2822862 · Cited by 77
Metadata
- Authors
- Vuillemin, J. E., Bertin, P., Roncin, D., Shand, M., Touati, H. H., & Boucard, P.
- Venue
- IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Published
- 1996-03
- Volume
- 4
- Issue
- 1
- Pages
- 56-69
- ISSN
- 1063-8210 (ISSN-L)
- 1557-9999
- OpenAlex
- W2150405043
- Cited by
- 289
- References
- 9
- FWCI
- 36.02
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.