Introduction to algorithms
Dynamic scheduling of real-time tasks under precedence constraints
Real-Time Systems
Allocating hard real-time tasks: an NP-hard problem made easy
Real-Time Systems
IEEE Spectrum
Allocation and Scheduling of Precedence-Related Periodic Tasks
IEEE Transactions on Parallel and Distributed Systems
A router architecture for real-time point-to-point networks
ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
A Robust Adaptive Metric for Deadline Assignment in Heterogeneous Distributed Real-Time Systems
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Optimal combined task and message scheduling in distributed real-time systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Applicability of simulated annealing methods to real-time scheduling and jitter control
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Optimized priority assignment for tasks and messages in distributed hard real-time systems
WPDRTS '95 Proceedings of the 3rd Workshop on Parallel and Distributed Real-Time Systems
An Engineering Approach to Decomposing End-to-End Delays on a Distributed Real-Time System
WPDRTS '96 Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems
Resource Conscious Design of Distributed Real-Time Systems: An End-to-End Approach
ICECCS '96 Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems
Effective Complexity Reduction for Optimal Scheduling of Distributed Real-Time Applications
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
IEEE Transactions on Computers
Embedded Systems Design
Hi-index | 0.00 |
Distributed real-time applications usually consist of several component tasks and must be completed by its end-to-end (E-T-E) deadline. As long as the E-T-E deadline of an application is met, the strategy used for dividing it up for component tasks does not affect the application itself. One would therefore like to “slice” each application E-T-E deadline and assign the slices to component tasks so as to maximize the schedulability of the component tasks, and hence the application. Distribution of the E-T-E deadline over component tasks is a difficult and important problem since there exists a circular dependency between deadline distribution and task assignment. We propose a new deadline-distribution scheme which has two major improvements over the best scheme known to date. It can distribute task deadlines prior to task assignment and relies on new adaptive metrics that yield significantly better performance in the presence of high resource contention. The deadline-distribution problem is formulated for distributed hard real-time systems with relaxed locality constraints, where schedulability analysis must be performed at pre-run-time, and only a subset of the tasks are constrained by pre-assignment to specific processors. Although it is applicable to any scheduling policy, the proposed deadline-distribution scheme is evaluated for a non-preemptive, time-driven scheduling policy. Using extensive simulations, we show that the proposed adaptive metrics deliver much better performance (in terms of success ratio and maximum task lateness) than their non-adaptive counterparts. In particular, the simulation results indicate that, for small systems, the adaptive metrics can improve the success ratio by as much as an order of magnitude. Moreover, the new adaptive metrics are found to exhibit very robust performance over a large variety of application and architecture scenarios.