Calculating the maximum, execution time of real-time programs
Real-Time Systems
Algorithms for scheduling imprecise computations with timing constraints
SIAM Journal on Computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Optimal Reward-Based Scheduling for Periodic Real-Time Tasks
IEEE Transactions on Computers
Real-time dynamic voltage scaling for low-power embedded operating systems
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Experimental Analysis of Timing Validation Methods for Distributed Real-Time Systems
The Journal of Supercomputing
MAST: Modeling and Analysis Suite for Real Time Applications
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Rate Monotonic Analysis: The Hyperbolic Bound
IEEE Transactions on Computers
An Augmented k-ary Tree Multiprocessor with Real-Time Fault-Tolerant Capability
The Journal of Supercomputing
Enhanced Utilization Bounds for QoS Management
IEEE Transactions on Computers
Parallel Concurrency Control Activity for Transaction Management in Real-time Database Systems
The Journal of Supercomputing
Superlinear Performance in Real-Time Parallel Computation
The Journal of Supercomputing
Delay Control and Parallel Admission Algorithms for Real-Time Anycast Flow
The Journal of Supercomputing
Schedulability Analysis of Periodic Fixed Priority Systems
IEEE Transactions on Computers
Rate monotonic vs. EDF: judgment day
Real-Time Systems
A methodology to implement real-time applications onto reconfigurable circuits
The Journal of Supercomputing
A generalized real-time obstacle avoidance method without the Cspace calculation
Journal of Computer Science and Technology
Sensitivity analysis for fixed-priority real-time systems
Real-Time Systems
Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
IEEE Transactions on Computers
Revisiting fixed priority techniques
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Utilization bound for periodic task set with composite deadline
Computers and Electrical Engineering
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Power efficient rate monotonic scheduling for multi-core systems
Journal of Parallel and Distributed Computing
A comparative study of rate monotonic schedulability tests
The Journal of Supercomputing
Lowest priority first based feasibility analysis of real-time systems
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Designing real-time systems is a challenging task and many conflicting issues arise in the process. Among them, the most fundamental one is the adjustment of appropriate values for task parameters such as task periods, deadlines, and computation times that directly influence the system feasibility. Task periods and deadlines are generally known at design stage and remains fixed throughout, however, task computation times fluctuates significantly. For a better quality of service or higher system utilization, higher task computation values are required, while this flexibility comes at the price of system infeasibility. To the best of our knowledge, no optimal solution exists for extracting the optimal task computation times in a given range so that the overall system remains feasible under a specific scheduling algorithm. In this paper, we present a generalized bound on the task schedulability defined as a nonlinear inequality h i 驴0 in the space of the execution times c i . Based on this bound, the adjustment problem of tasks execution times, which determines the optimum c i for a better system performance while still meeting all temporal requirements, is addressed by solving the standard nonlinear constrained optimization problem. Simulations on synthetic task sets are presented to compare the performance of our work with the most celebrated result, i.e., LL-bound by Liu and Layland in (J. ACM 20(1):40---61, 1973).