OGS algorithm for mapping dependent tasks to metacomputing environment

An application must be decomposed into some tasks (or subtasks) to be executed in metasystems. In this paper, an optimal generation scheduling (OGS) algorithm is introduced. First, the algorithm assigns a fixed priority for each task. It, then, filters out all independent tasks according to the same priority. Finally, it maps these independent tasks to all machines available using some heuristics by forerunners for comparison. In OGS Algorithm, expect machine ready time is used, the completion times of all predecessors are also considered as heuristic information. So, idle times in machines can be decreased, and the Makespan then be improved. By test, it is demonstrated that the performance of OGS exceeds GS algorithms.