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).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
