This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'02)
Queue Machines: Hardware Compilation in Hardware
Napa, California
September 22-September 24
ISBN: 0-7695-1801-X
Herman Schmit, Carnegie Mellon University
Benjamin Levine, Carnegie Mellon University
Benjamin Ylvisaker, Carnegie Mellon University
In this paper, we hypothesize that reconfigurable computing is not more widely used because of the logistical difficulties caused by the close coupling of applications and hardware platforms. As an alternative, we propose computing machines that use a single, serial instruction representation for the entire reconfigurable computing application. We show how it is possible to convert, at run-time, the parallel portions of the application into a spatial representation suitable for execution on a reconfigurable fabric. The conversion to spatial representation is facilitated by the use of an instruction set architecture based on an operand queue. We describe techniques to generate code for queue machines and hardware virtualization techniques necessary to allow any application to execute on any platform.
Citation:
Herman Schmit, Benjamin Levine, Benjamin Ylvisaker, "Queue Machines: Hardware Compilation in Hardware," fccm, pp.152, 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.