By Topic

A new resource constrained asynchronous scheduling method through transformation of dataflow graphs

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
$33 $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)
E. Kim ; Dept. of Inf. & Commun., Kwangju Inst. of Sci. & Technol., South Korea ; Dong-Ik Lee

With the increase of popularity in an asynchronous system design style, the request for asynchronous high-level synthesis tools is increasing continuously. In this paper, we suggest a new resource constrained asynchronous scheduling method which is performed through transformation of a dataflow graph (DFG). Experimental results show that the suggested scheduling method can produce a correct and efficient schedule from an initial DFG and the resulting schedule leads to a faster and more flexible asynchronous system compared to a corresponding synchronous system

Published in:

Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on  (Volume:5 )

Date of Conference:

2001