Runtime reconfigurable routing

11Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper is concerned with practicable solutions to a dynamic circuit reconfiguration problem: how to perform rnntime 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 mm time. The models also illustrate a blurring of traditional notions of ‘hardware’ and ‘software’, at a point where circuitry meets instruction sequences.

Cite

CITATION STYLE

APA

Brebner, G., & Donlin, A. (1998). Runtime reconfigurable routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1388, pp. 25–30). Springer Verlag. https://doi.org/10.1007/3-540-64359-1_668

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free