Heuristic Scheduling for Distributed Hard Real-Time Systems

@inproceedings{Fohler1990HeuristicSF,
  title={Heuristic Scheduling for Distributed Hard Real-Time Systems},
  author={Gerhard Fohler and Christian Koza},
  year={1990}
}
In hard real-time systems it is of crucial importance to meet the speci ed timing constraints. For parallel execution of tasks the need for communication and synchronization among them has to be considered. These requirements of task-sets are represented in the form of precedence graphs. All tasks have to access the Cpu and the network such that the speci ed timing requirements can be guaranteed under all foreseen circumstances. This paper describes the development of an o -line scheduling… CONTINUE READING
20 Citations
19 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 19 references

A Graphical Design Environment for Distributed Real-Time Systems

  • Senft, Ch, R Zainlinger
  • Proceedings of the Twenty-Second Annual Hawaii…
  • 1989

et.al., Distributed Fault-Tolerant Real-Time Systems: The MARS Approach

  • H. Kopetz
  • IEEE Micro,
  • 1989

A Real-Time Language with a Schedulability Analyser

  • A. D. Stoy 87 Stoyenko
  • Ph. D. Thesis,
  • 1987

Guaranteed Responsetimes in a Distributed Hard-Real-Time Environment

  • D. W. Leinbaugh
  • IEEE Transactions on Software Engineering, Vol…
  • 1986

Similar Papers

Loading similar papers…