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

Task assignment and scheduling under memory constraints

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)
Szymanek, R. ; Dept. of Comput. Eng., Lund Univ., Sweden ; Kuchcinski, K.

Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constraints. The paper presents a new heuristic developed for task assignment and scheduling for such systems. These systems also have a large number of constraints of different nature, such as cost, execution time, memory capacity and limitations on resource usage. The heterogeneous constraints require new synthesis methods which will take them into account while searching for a valid solution. The heuristic presented in the paper is a part of the CLASS system (Constraint Logic Programming based System Synthesis)

Published in:

Euromicro Conference, 2000. Proceedings of the 26th  (Volume:1 )

Date of Conference:

2000

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.