| Abstract: |
This paper presents an efficient algorithm, which is able to distribute the workload dynamically in a distributed systems. In this algorithm, we do process allocation in such a way, that resource utilization will be robust and also managing the workload among different nodes (processors) and also kept a look on load sharing, so that no node will become (almost) idle. In this algorithm, I suggest a semi-distributed structure of nodes, so that certain problems (that usually appear in case of load balancing & load sharing in distributed system) can be solved without much effort. |
Advance Search