Advanced

Partial task assignment of task graphs under heterogeneous resource constraints

Szymanek, Radoslaw LU and Kuchcinski, Krzysztof LU (2003) Proceedings 2003. Design Automation Conference In Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451) p.244-249
Abstract
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... (More)
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 (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
scheduling, constraint logic programming, clustering technique, heterogeneous resource constraints, partial task assignment, task graphs
in
Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)
pages
244 - 249
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
Proceedings 2003. Design Automation Conference
external identifiers
  • WOS:000184080900044
  • Scopus:0042635853
DOI
10.1109/DAC.2003.1219002
language
English
LU publication?
yes
id
7e24cd0c-096e-45fe-b6e0-41f927f2c142 (old id 612676)
date added to LUP
2007-12-03 11:52:35
date last changed
2016-10-13 04:42:34
@misc{7e24cd0c-096e-45fe-b6e0-41f927f2c142,
  abstract     = {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       = {Szymanek, Radoslaw and Kuchcinski, Krzysztof},
  keyword      = {scheduling,constraint logic programming,clustering technique,heterogeneous resource constraints,partial task assignment,task graphs},
  language     = {eng},
  pages        = {244--249},
  publisher    = {ARRAY(0x988ad38)},
  series       = {Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)},
  title        = {Partial task assignment of task graphs under heterogeneous resource constraints},
  url          = {http://dx.doi.org/10.1109/DAC.2003.1219002},
  year         = {2003},
}