Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
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
Deadline Assignment in Distributed Hard Real-Time Systems with Relaxed Locality Constraints
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Convex Optimization
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)
IEEE Transactions on Computers
Sustainable Scheduling Analysis
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Distributed Systems: Principles and Paradigms (2nd Edition)
Distributed Systems: Principles and Paradigms (2nd Edition)
A Programming Model for Time-Synchronized Distributed Real-Time Systems
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
A Survey of Fault Management in Wireless Sensor Networks
Journal of Network and Systems Management
Robust Priority Assignment for Fixed Priority Real-Time Systems
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Optimal Discrete Rate Adaptation for Distributed Real-Time Systems
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Online Optimization for Latency Assignment in Distributed Real-Time Systems
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Automated Middleware QoS Configuration Techniques for Distributed Real-time and Embedded Systems
RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Delay-Aware Period Assignment in Control Systems
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Optimal Sampling Rate Assignment with Dynamic Route Selection for Real-Time Wireless Sensor Networks
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Power-Aware CPU Utilization Control for Distributed Real-Time Systems
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Optimizing Extensibility in Hard Real-Time Distributed Systems
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
End-to-End Delay Analysis of Distributed Systems with Cycles in the Task Graph
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
IEEE Network: The Magazine of Global Internetworking
Towards fault-tolerant embedded systems with imperfect fault detection
Proceedings of the 49th Annual Design Automation Conference
Journal of Systems and Software
Hi-index | 0.00 |
In distributed soft real-time systems, maximizing the aggregate quality-of-service (QoS) is a typical system-wide goal, and addressing the problem through distributed optimization is challenging. Subtasks are subject to unpredictable failures in many practical environments, and this makes the problem much harder. In this paper, we present a robust optimization framework for maximizing the aggregate QoS in the presence of random failures. We introduce the notion of K-failure to bound the effect of random failures on schedulability. Using this notion we define the concept of K-robustness that quantifies the degree of robustness on QoS guarantee in a probabilistic sense. The parameter K helps to tradeoff achievable QoS versus robustness. The proposed robust framework produces optimal solutions through distributed computations on the basis of Lagrangian duality, and we present some implementation techniques. Our simulation results show that the proposed framework can probabilistically guarantee sub-optimal QoS which remains feasible even in the presence of random failures.