Scheduling in multiprocessor system using genetic algorithms

Multiprocessors have emerged as a powerful computing means for running real-time applications, especially where a uniprocessor system would not be sufficient enough to execute all the tasks. The high performance and reliability of multiprocessors have made them a powerful computing resource. Such computing environment requires an efficient algorithm to determine when and on which processor a given task should execute. This paper investigates dynamic scheduling of real-time tasks in a multiprocessor system to obtain a feasible solution using genetic algorithms combined with well-known heuristics, such as 'Earliest Deadline First' and 'Shortest Computation Time First'. A comparative study of the results obtained from simulations shows that genetic algorithm can be used to schedule tasks to meet deadlines, in turn to obtain high processor utilization.Peer ReviewedPostprint (published version

AGENT MEETING SCHEDULER

This dissertation is purposed to record all the data gathered throughout author's study and research for this project. A deep study of agent algorithm is conducted based on current available agent meeting scheduler from combination of software agent and algorithm data structure knowledge. The current problem of typical meeting scheduler is it is time consuming and inefficient; and also a resource needs to be allocated to perform the meeting scheduling job. Agent meeting scheduler will be used to replace this typical meeting scheduler to make it more efficient in term of deciding meeting time. The study is meant to research and select suitable algorithm to be implemented in agent meeting scheduler. An agent meeting scheduler prototype then will be developed to prove that the selected algorithm is working properly. Qualitative research method is being used to gather necessary data on agent algorithm and this data will be used to select the suitable algorithm. Through the research conducted on available algorithm for agent meeting scheduler, genetic algorithm is selected to be used in this project. The agent meeting scheduler prototype then will be developed by using PHP language. PHP is selected for its interactivity and extensibility

AGENT MEETING SCHEDULER

This dissertation is purposed to record all the data gathered throughout author's study and research for this project. A deep study of agent algorithm is conducted based on current available agent meeting scheduler from combination of software agent and algorithm data structure knowledge. The current problem of typical meeting scheduler is it is time consuming and inefficient; and also a resource needs to be allocated to perform the meeting scheduling job. Agent meeting scheduler will be used to replace this typical meeting scheduler to make it more efficient in term of deciding meeting time. The study is meant to research and select suitable algorithm to be implemented in agent meeting scheduler. An agent meeting scheduler prototype then will be developed to prove that the selected algorithm is working properly. Qualitative research method is being used to gather necessary data on agent algorithm and this data will be used to select the suitable algorithm. Through the research conducted on available algorithm for agent meeting scheduler, genetic algorithm is selected to be used in this project. The agent meeting scheduler prototype then will be developed by using PHP language. PHP is selected for its interactivity and extensibility

Scheduling in multiprocessor system using genetic algorithms

Multiprocessors have emerged as a powerful computing means for running real-time applications, especially where a uniprocessor system would not be sufficient enough to execute all the tasks. The high performance and reliability of multiprocessors have made them a powerful computing resource. Such computing environment requires an efficient algorithm to determine when and on which processor a given task should execute. This paper investigates dynamic scheduling of real-time tasks in a multiprocessor system to obtain a feasible solution using genetic algorithms combined with well-known heuristics, such as 'Earliest Deadline First' and 'Shortest Computation Time First'. A comparative study of the results obtained from simulations shows that genetic algorithm can be used to schedule tasks to meet deadlines, in turn to obtain high processor utilization.Peer Reviewe