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

Real-time scheduling for pipelined execution of data flow graphs on a realistic multiprocessor architecture

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)
Jonsson, J. ; Dept. of Comput. Eng., Chalmers Univ. of Technol., Goteborg, Sweden ; Vasell, J.

Multimedia and digital signal processing applications have swiftly emerged as important areas for embedded computer systems. Therefore, it is imperative that computer architectures are devised that can cope with the increased burden of processing power implied by these applications. We present a heuristic static real-time scheduling method called real time data flow (RTDF), for mapping data flow graphs onto fixed-size homogeneous multiprocessor architectures. The primary objective of RTDF is to minimize the iteration period of an application. Several other methods with this goal have been proposed in particular in the digital signal processing domain. Similar to many of these, RTDF attempts to minimize the iteration period by exploiting pipelining parallelism. In contrast, however; RTDF assumes an architecture model where communication network characteristics such as message service capacity, communication distance and communication link contention are modeled in a realistic fashion. Therefore, with the aid of RTDF, systems can be designed that support applications with high sample rates without having to resort to dedicated architectures. We show experimentally that RTDF achieves near-optimal iteration periods when communication cost is negligible and that communication overhead only affects the iteration periods of graphs with loops

Published in:

Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on  (Volume:6 )

Date of Conference:

7-10 May 1996

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.