Changes between Version 16 and Version 17 of Check

Timestamp:

Oct 12, 2010, 5:39:49 PM (14 years ago)

Author:

andrei.voinescu

Comment:

--

Check

@@ -143 +143 @@
 
 = Scheduling =
+The Scheduling algorithm is presented as a stand-alone application that gathers information about the network from a Resource Directory (types of nodes, topology).
+
+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>
+
+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.
+
+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. 
 = Self-healing =