Abstract
A driving factor in Digital System DS architecture is the feature size of the silicon implementation process. We present Moore’s laws and focus on the shrink laws, which relate chip performance to feature size. The theory is backed with experimental measures from [14], relating performance to feature size, for various memory, processor and FPGA chips from the past decade. Conceptually shrinking back existing chips to a common feature size leads to common architectural measures, which we call normalised: area, clock frequency, memory and operations per cycle. We measure and compare the normalised compute density of various chips, architectures and silicon technologies.
A Reconfigurable System RS is a standard processor tightly coupled to a Programmable Active Memory PAM, through a high bandwidth digital link. The PAM is a FPGA and SRAM based coprocessor. Through software configuration, it may emulate any specific custom hardware, within size and speed limits. RS combine the flexibility of software programming to the performance level of application specific integrated circuits ASIC. We analyse the performance achieved by P1, a first generation RS [13]. It still holds some significant absolute speed records: RSA cryptography, applications from high-energy physics, and solving the Heat Equation. We observe how the software versions for these applications have gained performance, through better microprocessors. We compare with the performance gain which can be achieved, through implementation in P2, a second-generation RS [16].
Recent experimental systems, such as the Dynamically Programmable Arithmetic Array in [19] and others in [14], present advantages over current FPGA, both in storage and compute density. RS based on such chips are tailored for video processing, and similar compute, memory and IO bandwidth intensive. We characterise some of the architectural features that a RS must posses in order to be fit to shrink: automatically enjoy the optimal gain in performance through future shrinks. The key to scale, for any general purpose system, is to embed memory, computation and communication at a much deeper level than presently done.
This research was partly done at Hewlett Packard Laboratories, Bristol U.K.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. University of Illinois Press, Urbana (1949)
Mead, C., Conway, L.: Introduction to VLSI systems. Addison Wesley, Reading (1980)
Preparata, F.P., Vuillemin, J.: Area-time optimal VLSI networks for computing integer multiplication and Discrete Fourier Transform. In: Proceedings of I.C.A.L.P. Springer, Haifa (July 1981)
Vuillemin, J.: A combinatorial limit to the computing power of VLSI circuits. IEEE Transactions on Computers C-32(3), 294–300 (1983)
Wegener, I.: The Complexity of Boolean Functions. John Wiley & sons, Chichester (1987)
McBryan, O.A., Frederickson, P.O., Linden, J., Schüller, A., Solchenbach, K., Stüben, K., Thole, C.-A., Trottenberg, U.: Multigrid methods on parallel computers-a survey of recent developments. In: Impact of Computing in Science and Engineering, 3(1), 1–75. Academic Press, London (1991)
Vuillemin, J.: Contribution à la résolution numérique des équations de Laplace et de la chaleur. Mathematical Modelling and Numerical Analysis, AFCET, Gauthier- Villars, RAIRO 27(5), 591–611 (1993)
Shand, M., Vuillemin, J.: Fast implementation of RSA cryptography. In: 11-th IEEE Symposium on Computer Arithmetic, Windsor, Ontario, Canada (1993)
Mead, C.: Scaling of MOS Technology to Submicrometre Feature Sizes. Journal of VLSI Signal Processing 8(1), 9–26 (1994)
Vuillemin, J.: Fast linear Hough transform. In: The International Conference on Application-Specific Array Processors, pp. 1–9. IEEE press, Los Alamitos (1994)
Vuillemin, J.: On circuits and numbers. IEEE Trans. on Computers 43(8), 868–879 (1994)
12. L. Moll, J. Vuillemin, P. Boucard and L. Lundheim, Real-time High-Energy Physics Applications on DECPeRLe-1 Programmable Active Memory, Journal of VLSI Signal Processing, Vol 12, pp. 21-33, 1996. 347, 347, 347
Vuillemin, J., Bertin, P., Roncin, D., Shand, M., Touati, H., Boucard, P.: Boucard Programmable Active Memories: the Coming of Age. IEEE Trans. on VLSI 4(1), 56–69 (1996)
DeHon, A.: Reconfigurable Architectures for General-Purpose Computing. MIT, Artificial Intelligence Laboratory, AI Technical Report No. 1586 (1996)
Sakashita, N., et al.: A 1.6-GB/s Data-Rate 1-Gb Synchronous DRAM with Hierarchical Square-Shaped Memory Block and Distributed Bank Architecture. IEEE Journal of Solid-state Circuits 31(11), 1645–1654 (1996)
Shand, M.: Pamette, a Reconfigurable System for the PCI Bus (1998), http://www.research.digital.com/SRC/pamette/
Xilinx, Inc., The Programmable Gate Array Data Book, Xilinx, 2100 Logic Drive, San Jose, CA 95124 USA (1998)
Moore, G.: An Update on Moore’s Law (1998), http://www.intel.com/pressroom/archive/speeches/gem93097.htm
Marshall, A., Stansfield, T., Vuillemin, J.: CHESS: a Dynamically Programmable Arithmetic Array for Multimedia Processing, Hewlett Packard Laboratories, Bristol (1998)
Shand, M.: An Update on RSA software performance. private communication (1998)
The millenium bug: how much did it really cost?, your newspaper (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vuillemin, J. (1999). Reconfigurable Systems: Past and Next 10 Years. In: Hernández, V., Palma, J.M.L.M., Dongarra, J.J. (eds) Vector and Parallel Processing – VECPAR’98. VECPAR 1998. Lecture Notes in Computer Science, vol 1573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10703040_26
Download citation
DOI: https://doi.org/10.1007/10703040_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66228-0
Online ISBN: 978-3-540-48516-2
eBook Packages: Springer Book Archive