Maximizing reliability while scheduling real-time task-graphs on a cluster of computers

@article{Amin2005MaximizingRW,
  title={Maximizing reliability while scheduling real-time task-graphs on a cluster of computers},
  author={Alaa Amin and Reda A. Ammar and Sanguthevar Rajasekaran},
  journal={10th IEEE Symposium on Computers and Communications (ISCC'05)},
  year={2005},
  pages={1001-1006}
}
Improper scheduling of real-time applications on a cluster may lead to missing required deadlines and offset the gain of using the system and software parallelism. Most existing scheduling algorithms do not consider factors such as real-time deadlines, system reliability, processing power fragmentation, inter-task communication and degree of parallelism on performance. In this paper we introduce a new scheduling algorithm, which is based on using an objective function to guide the search for a… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-4 OF 4 CITATIONS

References

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

An approach for fault-tolerance in hard real-time distributed systems

  • Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
  • 1999

Dynamic scheduling of real-time aperiodic tasks on multiprocessor architectures

  • Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences
  • 1996
VIEW 2 EXCERPTS

Real-time scheduling using compact task graphs

  • Proceedings of 16th International Conference on Distributed Computing Systems
  • 1996
VIEW 1 EXCERPT