8 | | Task scheduling is one of the most important management aspects in a distributed system because this component |
9 | | should achieve two main goals: on the one hand efficient use of available resources and on the other hand high performance in |
10 | | solving tasks. Because of the fact that the scheduling problem is an NP-Complete problem, a near-optimal algorithm is a desired |
11 | | solution. A third goal is the fact that the algorithm should provide the results very fast. |
12 | | This project's aim is to develop a parallel solution for a near-optimal algorithm for dependent task scheduling in distributed systems. |
| 9 | Task scheduling is one of the most important management aspects in a distributed system because this component should achieve two main goals: on the one hand efficient use of available resources and on the other hand high performance in solving tasks. Because of the fact that the scheduling problem is an NP-Complete problem, a near-optimal algorithm is a desired solution. A third goal is the fact that the algorithm should provide the results very fast. This project's aim is to develop a parallel solution for a near-optimal algorithm for dependent task scheduling in distributed systems. |