9 | | Task scheduling is one of the most important management |
10 | | aspects in a distributed system because this component |
11 | | should achieve two main goals: on the one hand efficient use of |
12 | | available resources and on the other hand high performance in |
13 | | solving tasks. Because of the fact that the scheduling problem is |
14 | | an NP-Complete problem, a near-optimal algorithm is a desired |
15 | | solution. A third goal is the fact that the algorithm should provide |
16 | | the results very fast. This project presents the parallelization solution |
17 | | of one near-optimal algorithm for dependent task scheduling |
18 | | in distributed systems, algorithm that proved to provide very |
| 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. This project presents the parallelization solution |
| 12 | of one near-optimal algorithm for dependent task scheduling in distributed systems, algorithm that proved to provide very |