Changes between Version 23 and Version 24 of Check

Timestamp:

Oct 12, 2010, 6:00:06 PM (14 years ago)

Author:

andrei.voinescu

Comment:

--

Check

@@ -148 +148 @@
 Prerequisite: Prior to executing the scheduler the sub-tasks of the application have to be already programmed on the nodes, as stopped tasks.
 
-{{{
-./check-schedule <RD> <input file> <task mapping>
-}}}
+./check-schedule <RD> <tdag> <tskmap>
 
-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:
 
-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. 
+  * 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
+    * a tuple (x,y,z) for each edge in the dependency graph on one line, with x,y being incident tasks and z being the bandwidth. 
+  * tskmap is a task mapping file, associating each task in Task Dependency Acyclic Graph to the names of the tasks that have to be run on the network.
+    * tuples (x,s) are present on every line, x being the task index in the tdag file and s being the name of the task associated. Tasks are started based on their names 
+
+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, provided the tasks are already present on the sensor nodes. 
 = Self-healing =