Partial task assignment of task graphs under heterogeneous resource constraints

Summary, in English

This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tasks to a particular resource. Our method simplifies the assignment and scheduling steps while imposing a small or no penalty on the final solution quality. This technique is specially suited for problems which have different resources constraints. Our method does not cluster tasks into a new task, as typical clustering techniques do, but specifies which tasks need to be executed on the same processor. Our experiments have shown that PAT, which may produce nonlinear groups of tasks, gives better results than linear clustering when multi-resource constraints are present. Linear clustering was proved to be optimal comparing to all other clusterings for problems with timing constraints only. In this paper, we show that, if used for multi-resource synthesis problem, as it is often used nowadays, linear clustering will produce inferior solutions

• Author: Radoslaw Szymanek; Krzysztof Kuchcinski
• Department/s: Department of Computer Science; Parallel Systems
• Publishing year: 2003
• Language: English
• Pages: 244-249
• Publication/Series: Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)
• Links: http://dx.doi.org/10.1109/DAC.2003.1219002
• Document type: Conference paper
• Publisher: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Topic: Computer Science
• Keywords: scheduling; constraint logic programming; clustering technique; heterogeneous resource constraints; partial task assignment; task graphs
• Conference name: Proceedings 2003. Design Automation Conference
• Conference date: 2003-06-02 - 2003-06-06
• Conference place: Anaheim, CA, United States
• Status: Published