Abstract
The translation into SDFGL graphs of PIPVAL expressions without array creation constructs is straightforward. The basic mapping rules for such expressions are developed directly from Brock’s translation algorithms [29]. These algorithms consist of two functions which map ordinary Val expressions and iteration bodies into their respective graph representations. The translation algorithm for for-iter expressions is based on a combination of these functions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gao, G.R. (1991). Mapping Rules for Expressions without Array Creation Constructs. In: A Code Mapping Scheme for Dataflow Software Pipelining. The Kluwer International Series in Engineering and Computer Science, vol 125. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3988-9_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3988-9_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6782-6
Online ISBN: 978-1-4615-3988-9
eBook Packages: Springer Book Archive