Changes between Version 18 and Version 19 of Check

Timestamp:

Oct 12, 2010, 5:48:36 PM (14 years ago)

Author:

andrei.voinescu

Comment:

--

Check

@@ -148 +148 @@
 
 {{{
-./check-schedule <RD> <input file> <task mapping>
+./check-schedule <RD> <tdag> <task mapping>
 }}}
 
-The input file needed is a Task Dependency Acyclic Graph (DAG). One run of the application is enough to calculate the best scheduling of the application over the network, the application will directly access the nodes and start the required tasks.
+Input files:
+  * tdag is a Task Dependency Acyclic Graph. It contains a graph of data dependencies between tasks and their associated bandwidth. The format is a textfile containing
+    * t, number of tasks
+    * d, number of dependencies
+    * each edge in the dependency graph on one line, providing for each a tuple (x,y,z) with x,y being incident tasks and z being the bandwidth.
+
+One run of the application is enough to calculate the best scheduling of the application over the network, the application will directly access the nodes and start the required tasks.
 
 The task mapping input file associates the Task Dependency Acyclic Graph to the names of the tasks that have to be run on the network.