User talk:Mamoon

Dr. Torki Altameem and Dr. Mohammed Amoon

Scheduling Tasks for Distributed systems

The scheduling problem for parallel and distributed systems can be abstractly defined as; when there is a parallel work to be done and parallel processing system to do it, there is a question of how to assign this work to the system processors to obtain minimal execution time.

The scheduling of a parallel work may be done statically or dynamically. In static scheduling, there is a priori fully knowledge of the execution times of tasks, the communication times between processors, and the precedence relations between tasks before the run-time. Thus, static scheduling techniques can be applied at compile time. Each task in the task graph has a static assignment to a particular processor, and each time that task is submitted for execution, it is assigned to that processor. On the other hand, dynamic scheduling assumes no priori knowledge about the tasks of the DAG to be scheduled.