Back to Search
Start Over
Fast scheduling of soft aperiodic tasks in real-time systems
- Source :
- Electronics Letters. 37:401
- Publication Year :
- 2001
- Publisher :
- Institution of Engineering and Technology (IET), 2001.
-
Abstract
- An efficient method for scheduling soft aperiodic tasks in uni-processor real-time systems is presented. Simulation results show that fast average response times can be achieved while the time complexity of the method is O(1).
- Subjects :
- Fixed-priority pre-emptive scheduling
Computational complexity theory
Least slack time scheduling
Computer science
Aperiodic graph
Real-time computing
Processor scheduling
Dynamic priority scheduling
Parallel computing
Electrical and Electronic Engineering
Time complexity
Fair-share scheduling
Scheduling (computing)
Subjects
Details
- ISSN :
- 00135194
- Volume :
- 37
- Database :
- OpenAIRE
- Journal :
- Electronics Letters
- Accession number :
- edsair.doi...........b973c22f3551c20d6de13b17a59135c8