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

Co-optimization of buffer requirement and response time for SDF graph

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

3 Author(s)
Qi Zhu ; Fudan Univ., Shanghai, China ; Hui Lu ; Baifeng Wu

Synchronous data flow graph (SDF) is a model of computation that has been widely used in block diagram 'digit signal processing (DSP) programming environment. Many existing schedule methods of SDF have been developed to reduce run-time costs including the amount of memories used by executing codes and the response time of the target system. But because these methods deal with amount of memories and response time independently, they often generate contradicting results about these two kinds of run-time costs. For example, these methods reduce the amount of memory consumption but increasing response time. By contrast, earliest deadline first (EDF) reduce the response time, without considering the buffer requirement of the system. However, by adding a judging condition to EDF, on the one hand, we could schedule the SDF with an efficient response time, on the other hand, we could schedule the system with an efficient buffer requirement, while keeping the same response time. Hence, our improved EDF effectively makes up the deficiencies of SDF and EDF, thereby enhancing the utility of SDF and EDF.

Published in:

Computer Supported Cooperative Work in Design, 2004. Proceedings. The 8th International Conference on  (Volume:2 )

Date of Conference:

26-28 May 2004

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.