Evaluation and comparison of Load Balancing in RTDS using Information theoretic entropy

Load Balancing is very important requirement of any Distributed System. Migration of task is one of the eminent methodologies for the same purpose. Till now utilization is the only key based on which source and destination processor of victim task are being selected. This paper evaluates information theoretic based entropy factor that works similar to utilization factor and its better performance in task migration methodology. We have computed the performance of our system by calculating the Average scheduling latency, Deadline missing rate, Migration rate and finally the Execution ratio of total tasks for 5 and 10 numbers of processors of RTDS.