Real-time calculus for scheduling hard real-time systems
Top Cited Papers
- 7 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 101-104
- https://doi.org/10.1109/iscas.2000.858698
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Performance bounds for flow control protocolsIEEE/ACM Transactions on Networking, 1999
- Dynamic Min-Max ProblemsDiscrete Event Dynamic Systems, 1999
- Application of network calculus to guaranteed service networksIEEE Transactions on Information Theory, 1998
- A multiframe model for real-time tasksIEEE Transactions on Software Engineering, 1997
- Fixed priority pre-emptive scheduling: An historical perspectiveReal-Time Systems, 1995
- A generalized processor sharing approach to flow control in integrated services networks: the multiple node caseIEEE/ACM Transactions on Networking, 1994
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- Minimax AlgebraPublished by Springer Nature ,1979
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973