Skip to main content

Runtime reconfigurable routing

  • Reconfigurable Architectures Workshop Peter M. Athanas, Virginia Tech, USA Reiner W. Hartenstein, University of Kaiserslauteren, Germany
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1388))

Abstract

This paper is concerned with practicable solutions to a dynamic circuit reconfiguration problem: how to perform runtime routing of data between blocks of circuitry. The solutions use a ‘virtual circuitry’ approach based on the notion of Swappable Logic Units (SLUs). They involve a continuum of three types of routing model in which communication channels are made available using some form of extra configured logic supplied by an operating system. These models involve trade-offs between flexibility, speed and cell count; however, all stop short of any impractical attempt at arbitrary routing at run time. The models also illustrate a blurring of traditional notions of ‘hardware’ and ‘software’, at a point where circuitry meets instruction sequences.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brebner, “Relating Routing Graphs and Two-dimensional Grids”, Proc. VLSI Algorithms and Architectures, North Holland Publ., 1984, pp.221–231.

    Google Scholar 

  2. Brebner and Gray, “Use of reconfigurability in variable-length code detection at video rates”, Proc. 5th International Workshop on Field-Programmable Logic and Applications, Springer LNCS 975, 1995, pp.429–438.

    Google Scholar 

  3. Brebner, “A Virtual Hardware Operating System for the Xilinx XC6200”, Proc. 6th International Workshop on Field-Programmable Logic and Applications, Springer LNCS 1142, 1996, pp.327–336.

    Google Scholar 

  4. Brebner, “The Swappable Logic Unit: a Paradigm for Virtual Hardware”, Proc. 5th Annual IEEE Symposium on Custom Computing Machines, IEEE Computer Society Press 1997, pp.77–86.

    Google Scholar 

  5. Burns, Donlin, Hogg, Singh and de Wit, “A Dynamic Reconfiguration Run Time System”, Proc. 5th Annual IEEE Symposium on Custom Computing Machines, IPSEE Computer Society Press 1997, pp.66–75.

    Google Scholar 

  6. Donlin, “A Dynamically Self-Modifying Processor Architecture and its Application to Active Networking”, Working Paper, Department of Computer Science, University of Edinburgh, September 1997.

    Google Scholar 

  7. Eggers, Lysa ht, Dick and McGregor, “Fast Reconfigurable Crossbar Switching in FPGAs”, broc. 6th International Workshop on Field-Programmable Logic and Applications, Springer LNCS 1142, 1996, pp.297–306.

    Google Scholar 

  8. Jones, “The Ultimate RISC”, Computer Architecture News 16 3, June 1988, pp.48–55.

    Article  Google Scholar 

  9. Mead and Conway, Introduction to VLSI Systems, Reading:Addison-Wesley 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brebner, G., Donlin, A. (1998). Runtime reconfigurable routing. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_668

Download citation

  • DOI: https://doi.org/10.1007/3-540-64359-1_668

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64359-3

  • Online ISBN: 978-3-540-69756-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics