Efficient scheduling algorithms for real-time distributed systems

@article{Shah2010EfficientSA,
  title={Efficient scheduling algorithms for real-time distributed systems},
  author={Apurva Shah and Ketan Kotecha},
  journal={2010 First International Conference On Parallel, Distributed and Grid Computing (PDGC 2010)},
  year={2010},
  pages={44-48}
}
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… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

B

  • S Baruah, G Koren
  • Mishra, et al.,”On-line scheduling in the…
  • 2010
1 Excerpt

A

  • A. Burns, D. Prasa
  • Bondavalli, et el., “The Meaning and role of…
  • 2000
1 Excerpt

The Meaning and role of value in scheduling flexible real - time systems ”

  • D. Prasa A. Burns, A. Bondavalli
  • Journal of Systems Architecture
  • 2000

D Ove r : An optimal on - line scheduling algorithm for overloaded real - time systems ”

  • D. Shasha
  • SIAM J of Computing
  • 1995

Similar Papers

Loading similar papers…