A Critic on Real-Time Scheduling Strategies

Manupriya Hasija Hasija


The present scenario of the computing era is
dominated by the real-time systems. The real-time systems
are gaining popularity in the field of job scheduling as both
uni-processor and multi-processor architectures to satisfy
the requirements of time-constrained applications like flight
controls, avionics, multimedia data streaming, etc. The
application areas are also growing by huge amounts due to
increasing human dependency on machines. Hence to
balance between ever-increasing needs and exponentiallyrising
overheads; the necessity of new approaches, which can
ensure the best results not only limited to reliable logical
results but also acceptable temporal results too, is expected
to increase. This paper reviews various existing scheduling
algorithms suggesting further dissimilar techniques and
endeavors to compare and suggest which approach best suits
which scenarios based on their primary pluses.


Scheduling algorithms, FCFS, SJF, EDF, G-EDF, Backfilling, Conservative Backfilling, EASY, Best-Gap

Full Text:



  • There are currently no refbacks.

Copyright (c)

Subscribe to Print Journals