Please use this identifier to cite or link to this item:
|Title:||Assigning and scheduling hierarchical task graphs to heterogeneous resources|
|Abstract:||Task Scheduling is an important problem having many practical applications. More often than not, precedence constraints exist between tasks, and a common way to capture them is through Directed Acyclic Graphs (DAGs). A DAG might contain a great number of tasks representing complex real life scenarios. It might be the case that logical groupings of tasks exist giving a hierarchical nature to the graph. Such Hierarchical Task Graphs (HTGs) have nodes that are further analyzed to DAGs or to other HTGs. In this paper a method of solving an HTG problem is presented based on the idea of gradually solving the problem by replacing subgraphs with virtual nodes. Integer Programming is used to generate virtual nodes that replace a subgraph, results from solving the subgraph problem using. So a series of subproblems are solved and starting from the deeper levels of the HTG a solution to the full problem emerges.|
|Appears in Collections:||Δημοσιεύσεις σε Συνέδρια|
Files in This Item:
There are no files associated with this item.
Show full item record
Items in CRIS are protected by copyright, with all rights reserved, unless otherwise indicated.