Dynamic scheduling of real-time tasks under precedence constraints
Real-Time Systems
How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling
IEEE Transactions on Computers
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Multiple Servers and Capacity Sharing for Implementing Flexible Scheduling
Real-Time Systems - Flexible Scheduling on Real-Time Systems
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
BWE: A Resource Sharing Protocol for Multimedia Systems with Bandwidth Reservation
MSE '02 Proceedings of the Fourth IEEE International Symposium on Multimedia Software Engineering
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Aperiodic Servers with Resource Constraints
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
A Bandwidth Inheritance Algorithm for Real-Time Task Synchronization in Open Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Experimental Evaluation of Code Properties for WCET Analysis
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
IRIS: A New Reclaiming Algorithm for Server-Based Real-Time Systems
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Task Synchronization in Reservation-Based Real-Time Systems
IEEE Transactions on Computers
Rewriting History to Exploit Gain Time
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Improving Soft Real-Time Performance through Better Slack Reclaiming
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Uniprocessor Scheduling Under Precedence Constraints
RTAS '06 Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
Optimal Dimensioning of a Constant Bandwidth Server
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Resource Sharing in EDF-Scheduled Systems: A Closer Look
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
The worst-case execution-time problem—overview of methods and survey of tools
ACM Transactions on Embedded Computing Systems (TECS)
Time-bounded distributed QoS-aware service configuration in heterogeneous cooperative environments
Journal of Parallel and Distributed Computing
Capacity sharing for overrun control
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Greedy reclamation of unused bandwidth constant-bandwidth servers
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
On the use of code mobility mechanisms in real-time systems
ACM SIGBED Review - Special Issue on the 10th International Workshop on Real-time Networks (RTN 2011)
A feedback-based decentralised coordination model for distributed open real-time systems
Journal of Systems and Software
Server-based scheduling of parallel real-time tasks
Proceedings of the tenth ACM international conference on Embedded software
| Hi-index | 0.00 |
This paper focuses on the scheduling of tasks with hard and soft real-time constraints in open and dynamic real-time systems. It starts by presenting a capacity sharing and stealing (CSS) strategy that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft tasks' overloads by making additional capacity available from two sources: (i) reclaiming unused reserved capacity when jobs complete in less than their budgeted execution time and (ii) stealing reserved capacity from inactive non-isolated servers used to schedule best-effort jobs. CSS is then combined with the concept of bandwidth inheritance to efficiently exchange reserved bandwidth among sets of inter-dependent tasks which share resources and exhibit precedence constraints, assuming no previous information on critical sections and computation times is available. The proposed Capacity Exchange Protocol (CXP) has a better performance and a lower overhead when compared against other available solutions and introduces a novel approach to integrate precedence constraints among tasks of open real-time systems.