Master Thesis - 2006

As information communication technology progresses rapidly, the amount of information and the number of services supplied over networks have increased. Mobile agent is an emerging technology that makes it much easier to implement and maintain large scale and complex network systems. A system where a group of mobile agents act in parallel to complete a given task, is called multi-agent system.

Therefore in this thesis, I propose a fair and eective scheduling algorithm for multiagent systems which consider the processing status of the agents, CPU speed of the nodes and number of jobs run by each user. The proposed algorithm maintain eciency by prioritizing slower agents and assure fairness by allocating the same amount of CPU resources in total, to all the users regardless of number of jobs run by each user. Finally, the performance of the proposed algorithm is evaluated by simulation experiments.