loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Proceedings of The 26th EUROMICRO Conference (EUROMICRO'00) Volume I-Volume 1
Task Assignment and Scheduling under Memory Constraints
Maastricht, The Netherlands
September 05-September 07
ISBN: 0-7695-0780-8
Radoslaw Szymanek, Lund University
Krzysztof Kuchcinski, Lund University
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. This paper presents a new heuristic developed for task assignment and scheduling for such systems. These systems have also 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 consider them during searching for a valid solution. The heuristic presented in this paper is a part of the CLASS system (Constraint Logic Programming based System Synthesis).
Citation:
Radoslaw Szymanek, Krzysztof Kuchcinski, "Task Assignment and Scheduling under Memory Constraints," euromicro, vol. 1, pp.1084, Proceedings of The 26th EUROMICRO Conference (EUROMICRO'00) Volume I-Volume 1, 2000
Usage of this product signifies your acceptance of the Terms of Use.