loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)
Affine Nested Loop Programs and their Binary Parameterized Dataflow Graph Counterparts
Steamboat Springs, Colorado, USA
September 11-September 13
ISBN: 0-7695-2682-9
Ed F. Deprettere, Leiden University
Todor Stefanov, Leiden University
Shuvra S. Bhattacharyya, University of Maryland
Mainak Sen, University of Maryland
Parameterized static affine nested loop programs can be automatically converted to input-output equivalent Kahn Process Network specifications. These networks turn out to be close relatives of parameterized cyclo-static dataflow graphs. Token production and consumption can be cyclic with a finite number of cycles or finite non-cyclic. Moreover the token production and consumption sequences are binary.
Citation:
Ed F. Deprettere, Todor Stefanov, Shuvra S. Bhattacharyya, Mainak Sen, "Affine Nested Loop Programs and their Binary Parameterized Dataflow Graph Counterparts," asap, pp.186-190, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.