Cart (Loading....) | Create Account
Close category search window
 

Caching in dataflow-based environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Steenput, E. ; Dept. of Electr. Meas., Vrije Univ., Brussels, Belgium ; Rolain, Y.

We propose that there are several advantages to integrating caching in the execution scheme of a dataflow-based environment. If each node has a cache to store its last result, the cache look-up overhead is eliminated, because each cache contains just one value. A node in a dataflow-based program must store its result anyway until its downstream neighbors are ready to execute. Additionally, there is no need to store previous arguments with the cached result for comparison. The validity of a node's cached value can be determined from the validity of the nodes on which it depends

Published in:

Instrumentation & Measurement Magazine, IEEE  (Volume:2 ,  Issue: 3 )

Date of Publication:

Sep 1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.