Efficient scheduling algorithms for real-time distributed systems

Dynamic scheduling has been always a challenging problem for real-time distributed systems. EDF (Earliest Deadline First) algorithm has been proved to be optimal scheduling algorithm for single processor real-time systems and it performs well for distributed systems also. In this paper, we have proposed scheduling algorithms for client/server distributed system with soft timing constraints. The algorithms are proposed with modifications in conventional EDF algorithm. The proposed algorithms are simulated; results are obtained and measured in terms of SR (Success Ratio) & ECU (Effective CPU Utilization). Finally the results are compared with EDF algorithm in the same environment. It has been observed that the proposed algorithms ares equally efficient during underloaded conditions and they perform much better during overloaded conditions.