Scheduling Periodic Jobs that Allow Imprecise Results
IEEE Transactions on Computers
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Evaluating Dynamic Failure Probability for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Minimizing Aperiodic Response Times in a Firm Real-Time Environment
IEEE Transactions on Software Engineering
Overload Management in Real-Time Control Applications Using m,k $(m,k)$-Firm Guarantee
IEEE Transactions on Parallel and Distributed Systems
Efficient admission control algorithms for multimedia servers
Multimedia Systems
Optimal Reward-Based Scheduling for Periodic Real-Time Tasks
IEEE Transactions on Computers
IEEE Transactions on Computers
Rate-Based Resource Allocation Models for Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Best-Effort Scheduling of (m, k)-Firm Real-Time Streams in Multihop Networks
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Dynamic class-based queue management for scalable media servers
Journal of Systems and Software
Firm Real-Time System Scheduling Based on a Novel QoS Constraint
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Periodic Resource Model for Compositional Real-Time Guarantees
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Scheduling algorithms based on weakly hard real-time constraints
Journal of Computer Science and Technology
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers
IEEE Transactions on Computers
Energy-efficient dual-voltage soft real-time system with (m,k)-firm deadline guarantee
Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
Optimal scheduling in a queue with differentiated impatient users
Performance Evaluation
Firm Real-Time System Scheduling Based on a Novel QoS Constraint
IEEE Transactions on Computers
Analysis of window-constrained execution time systems
Real-Time Systems
Adaptive Resource Allocation Control for Fair QoS Management
IEEE Transactions on Computers
Tardiness bounds under global EDF scheduling on a multiprocessor
Real-Time Systems
Compositional real-time scheduling framework with periodic model
ACM Transactions on Embedded Computing Systems (TECS)
Dynamic priority scheduling-based MAC for wireless sensor networks
International Journal of Sensor Networks
A dynamic scheduler for real-time periodic tasks with quality of service requirements
AIC'06 Proceedings of the 6th WSEAS International Conference on Applied Informatics and Communications
Optimal Control of Discrete Event Systems with Weakly Hard Real-Time Constraints
Discrete Event Dynamic Systems
Energy-Aware Error Correction for QoS-Provisioning Real-Time Communications in Wireless Networks
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On scheduling soft real-time tasks with lock-free synchronization for embedded devices
Proceedings of the 2009 ACM symposium on Applied Computing
DLB: a novel real-time QoS control mechanism for multimedia transmission
International Journal of High Performance Computing and Networking
Optimization scheduling of MPEG-4 FGS video coding stream under the feasible mandatory constraint
Multimedia Tools and Applications
A combined delay and throughput proportional scheduling scheme for differentiated services
Computer Communications
Scalability and QoS guarantee for streams with (m,k)-firm deadline
Computer Standards & Interfaces
A forcing collision resolution approach able to prioritize traffic in CSMA-based networks
Computer Communications
Distributed DBP: a (m,k)-firm based distributed approach for QoS provision in IEEE 802.15.4 networks
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Energy-aware dual-mode voltage scaling for weakly hard real-time systems
Proceedings of the 2010 ACM Symposium on Applied Computing
Enhanced fixed-priority scheduling with (m,k)-firm guarantee
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Analysis of a window-constrained scheduler for real-time and best-effort packet streams
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
An incremental approach to scheduling during overloads in real-time systems
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Assessment of the IEEE 802.11e EDCA protocol limitations when dealing with real-time communication
EURASIP Journal on Wireless Communications and Networking
Reconfiguration-aware real-time scheduling under QoS constraint
Proceedings of the 16th Asia and South Pacific Design Automation Conference
Energy minimization for real-time systems with (m; k)-guarantee
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Providing delay constraint services with the palindrome scheduler schemes
AEE'06 Proceedings of the 5th WSEAS international conference on Applications of electrical engineering
Combining scheduling and concurrency control of real-time transactions within the MOA architecture
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Energy reduction for scheduling a set of multiple feasible interval jobs
Journal of Systems Architecture: the EUROMICRO Journal
F-RT-ETM: toward analysis and formalizing real time transaction and data in real-time database
MEDI'11 Proceedings of the First international conference on Model and data engineering
Dual-mode r-reliable task model for flexible scheduling in reliable real-time systems
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Experiments study on a dynamic priority scheduling for wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Enhanced WFQ algorithm with (m,k)-firm guarantee
ICESS'04 Proceedings of the First international conference on Embedded Software and Systems
WWIC'05 Proceedings of the Third international conference on Wired/Wireless Internet Communications
Research: A multiclass priority-based slotted-ring network for LAN-ATM interworking
Computer Communications
Using differentiated services to support Internet telephony
Computer Communications
Best-effort scheduling of (m,k)-firm real-time streams in multihop networks
Computer Communications
Packet scheduling with delay and loss differentiation
Computer Communications
Compositional real-time scheduling framework for periodic reward-based task model
Journal of Systems and Software
Formal analysis of sporadic bursts in real-time systems
Proceedings of the Conference on Design, Automation and Test in Europe
Challenges and new trends in probabilistic timing analysis
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Co-design of control and platform with dropped signals
Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems
The BGW model for QoS aware scheduling of real-time embedded systems
Proceedings of the 11th ACM international symposium on Mobility management and wireless access
Improving schedulability and energy efficiency for real-time systems with (m,k)-guarantee
ACM SIGBED Review - Special Issue on the Work-in-Progress (WiP) session of the 33rd IEEE Real-Time Systems Symposium (RTSS'12)
Hi-index | 15.00 |
The problem of scheduling multiple streams of real-time customers. is addressed in this paper. The paper first introduces the notion of (m, k)-firm deadlines to better characterize the timing constraints of real-time streams. More specifically, a stream is said to have (m, k)-firm deadlines if at least m out of any k consecutive customers must meet their deadlines. A stream with (m, k)-firm deadlines experiences a dynamic failure if fewer than m out of any k consecutive customers meet their deadlines.The paper then proposes a priority-based policy for scheduling N such streams on a single server to reduce the probability of dynamic failure. The basic idea is to assign higher priorities to customers from streams that are closer to a dynamic failure so as to improve their chances of meeting their deadlines. The paper proposes a heuristic for assigning these priorities. The effectiveness of this approach is evaluated through simulation under various customer arrival and service patterns. The scheme is compared to a conventional scheme where all customers are serviced at the same priority level and to an imprecise computation model approach. The evaluation shows that substantial reductions in the probability of dynamic failure are achieved when the proposed policy is used.