904 search results - page 124 / 181 » Scheduling task graphs optimally with A |
CCGRID
2005
IEEE
14 years 2 months ago
2005
IEEE
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
—We present an optimal methodology for dynamic voltage scheduling problem in the presence of realistic assumption such as leakage-power and intra-task overheads. Our contribution...
CHI
2002
ACM
14 years 9 months ago
2002
ACM
Scheduling, routing, and layout tasks are examples of hardamount of computational effort expended on different subproblems. CHI?2002 This work may not be copied or reproduced in w...
LION
2010
Springer
14 years 1 months ago
2010
Springer
Abstract This paper proposes a flexible software architecture for interactive multiobjective optimization, with a user interface for visualizing the results and facilitating the s...