Access Restriction

Author O.’neil, Timothy W.
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Distributed Computing ♦ Numerous Customary Application ♦ Sample Application ♦ Synchronous Data-flow Graph ♦ Restricted Environment ♦ Static Time-optimal Schedule ♦ Limitless Functional Element ♦ Efficient Performance ♦ Previous Experiment ♦ Key Word Synchronous Data-flow Graph ♦ Time Complexity ♦ Digital Signal Processing ♦ Model System
Abstract Numerous customary applications in digital signal processing may be characterized by synchronous data-flow graphs (SDFGs). Our previous experiments with SDFGs led to the development of a technique which constructs a static time-optimal schedule on a model system possessing limitless functional elements. In this paper, we now introduce a modification of this method for scheduling an SDFG to realize efficient performance in a more restricted environment. Herein, we summarize our approach, assess its time complexity and exhibit its value on sample applications. Key Words Synchronous data-flow graphs, resource-constrained scheduling 1.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study