Energy Efficient Task-Pull Scheduling Using Equal Length Cellular Automata in Distributed Computing

Energy efficient task-pull scheduling for distributed computing has been reported in this research work. Cellular Automata (CA) based scheduling algorithm has been projected in this report. We have emphasized on the usage of Equal Length Cellular Automata (ELCA) for the allocation of equal length task-pulls to maximize the employment of available processing units. We have introduced a behavioral discussion and examined the benefits of our proposed ELCA based taskpull scheduling methodology. High degree of randomness in generated equal length task-pulls and equal load distribution to available processing units have been established by experimental results. Low energy consumption for any distributed computing environment using ELCA scheduler has been successfully achieved. Efficient utilization of maximum number of available central processing units (CPUs) is achieved using proposed ELCA based scheduling.