Jinkyu Lee
Insik Shin
ABSTRACT
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.
- S. Athuraliya, V. H. Li, S. H. Low, and Q. Yin. REM: Active Queue Management. IEEE Network, pages 48--53, May 2001. Google Scholar
Digital Library
- N. Audsley, A. Burns, M. Richardson, and A. Wellings. Applying new scheduling theory to static priority pre-emptive scheudling. Software Engineering Journal, 8(5):284--292, 1993.Google ScholarCross Ref
- J. Balasubramanian, S. Tambe, B. Dasarathy, S. Gadgi, F. Porter, A. Gokhale, and D. C. Schmidt. NetQoPE: A model-driven network QoS provisioning engine for distributed real-time and embedded systems. In Proceedings of IEEE Real-Time Technology and Applications Symposium, pages 113--122, 2008. Google ScholarDigital Library
- S. Baruah and A. Burns. Sustainable scheduling analysis. In Proceedings of IEEE Real-Time Systems Symposium, pages 159--168, 2006. Google ScholarDigital Library
- S. Baruah, R. Howell, and L. Rosier. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-time Systems, 2:401--424, 1990. Google ScholarDigital Library
- D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Athena Scientific, 1997. Google ScholarDigital Library
- E. Bini and A. Cervin. Delay-aware period assignment in control systems. In Proceedings of IEEE Real-Time Systems Symposium, pages 291--300, 2008. Google ScholarDigital Library
- S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004. Google ScholarDigital Library
- G. C. Butazzo. Hard Real-Time Computing Systems. Springer, 2005. Google ScholarDigital Library
- Y. Chen, C. Lu, and X. Koutsoukos. Optimal discrete rate adaptation for distributed real-time systems. In Proceedings of IEEE Real-Time Systems Symposium, pages 181--192, 2007. Google ScholarDigital Library
- R. I. Davis and A. Burns. Robust priority assignment for fixed priority real-time systems. In Proceedings of IEEE Real-Time Systems Symposium, pages 3--14, 2007. Google ScholarDigital Library
- J. J. G. Garcia and M. G. Harbour. Optimized priority assignment for tasks and messages in distributed hard real-time systems. In Proceedings of the Third Workshop on Parallel and Distributed Real-Time Systems, pages 124--132, 1995. Google ScholarDigital Library
- P. Jayachandran and T. Abdelzaher. Bandwidth allocation for elastic real-time flows in multihop wireless networks based on network utility maximization. In Proceedings of International Conference on Distributed Computing Systems, pages 752--759, 2008. Google ScholarDigital Library
- P. Jayachandran and T. Abdelzaher. Delay composition algebra: A reduction-based schedulability algebra for distributed real-time systems. In Proceedings of IEEE Real-Time Systems Symposium, pages 259--269, 2008. Google ScholarDigital Library
- P. Jayachandran and T. Abdelzaher. End-to-end delay analysis of distributed systems with cycles in the task graph. In Proceedings of Euromicro Conference on Real-Time Systems, pages 13--22, 2009. Google ScholarDigital Library
- J. Jonsson and K. G. Shin. Deadline assignment in distributed hard real-time systems with relaxed locality constraints. In Proceedings of International Conference on Distributed Computing Systems, pages 432--440, 1997. Google ScholarDigital Library
- A. Kavimandan and A. Gokhale. Automated middleware QoS configuration techniques for distributed real-time and embedded systems. In Proceedings of IEEE Real-Time Technology and Applications Symposium, pages 93--102, 2008. Google ScholarDigital Library
- C. Liu and J. Layland. Scheduling algorithms for multi-programming in a hard-real-time environment. Journal of the ACM, 20(1):46--61, 1973. Google ScholarDigital Library
- S. H. Low. Optimization flow control, I: basic algorithm and convergence. IEEE/ACM Transactions on Networking, pages 861--874, Dec. 1999. Google ScholarDigital Library
- C. Lumezanu, S. Bhola, and M. Astley. Online optimization for latency assignment in distributed real-time systems. In Proceedings of International Conference on Distributed Computing Systems, pages 752--759, 2008. Google ScholarDigital Library
- M. D. Natale and J. A. Stankovic. Dynamic end-to-end guarantees in distributed real time systems. In Proceedings of IEEE Real-Time Systems Symposium, pages 216--227, 1994.Google ScholarCross Ref
- J. Palencia and M. G. Harbour. Offset-based response time analysis of distributed systems scheduled under EDF. In Proceedings of Euromicro Conference on Real-Time Systems, pages 3--12, 2003.Google ScholarCross Ref
- L. Paradis and Q. Han. A survey of fault management in wireless sensor networks. Journal of Network and Systems Management, 15:171--190, 2007. Google ScholarDigital Library
- W. Shu, X. Liu, Z. Gu, and S. Gopalakrishnan. Optimal Sampling Rate Assignment with Dynamic Route Selection for Real-Time Wireless Sensor Networks. In Proceedings of IEEE Real-Time Systems Symposium, pages 431--441, 2008. Google ScholarDigital Library
- A. Tanenbaum and M. van Steen. Distributed Systems: Principles and Paradigms (2nd ed.). Prentice Hall, 2007. Google ScholarDigital Library
- M. Treaster. A survey of fault-tolerance and fault-receovery techniques in parallel systems. ACM Computing Research Repository, abs/cs/0501002, 2005.Google Scholar
- X. Wang, X. Fu, X. Liu, and Z. Gu. Power-aware CPU utilization control for distributed real-time systems. In Proceedings of IEEE Real-Time Technology and Applications Symposium, pages 233--242, 2009. Google ScholarDigital Library
- H. Wu, B. Ravindran, E. D. Jensen, and P. Li. Time/utility function decomposition techniques for utility accrual scheduling algorithms in real-time distributed systems. IEEE Transactions on Computers, 54(9):1138--1153, 2005. Google ScholarDigital Library
- K. Yang, Y. Wu, J. Huang, X. Wang, and S. Verdu. Distributed Robust Optimization for Communication Networks. In Proceedings of the 27th Conference on Computer Communications, pages 1157--1165, 2008.Google ScholarCross Ref
- Y. Zhao, J. Liu, and E. A. Lee. A programming model for time-synchronized distributed real-time systems. In Proceedings of IEEE Real-Time Technology and Applications Symposium, pages 259--268, 2007. Google ScholarDigital Library
- Q. Zhu, Y. Yang, E. Scholte, M. D. Natale, and A. S.-Vincentelli. Optimizing extensibility in hard real-time distributed systems. In Proceedings of IEEE Real-Time Technology and Applications Symposium, pages 275--284, 2009. Google ScholarDigital Library
Index Terms
- Online robust optimization framework for QoS guarantees in distributed soft real-time systems
Recommendations
A new approach for ACET based scheduling of soft real-time systems
ICCOMP'08: Proceedings of the 12th WSEAS international conference on ComputersIn certain real-time systems worst-case execution time estimates often lead to a waste of resources. In hard real-time systems these types of estimates are essential to guarantee temporal requirements are met. However in soft-real time systems using ...
Framework for parameter mapping to provide end-to-end QoS guarantees in IntServ/DiffServ architectures
With the numerous emerging real-time and multimedia applications, there has been much interest for developing mechanisms which enable real-time services over the Internet. These applications have QoS requirements. From the end-user's point of view, QoS ...
Traffic shaping in real-time distributed systems: a low-complexity approach
In real-time systems, one generally identifies two types of timing requirements, hard and soft constraints. In this study, it is assumed that the Hard Real-Time traffic (HRT) is periodic with deadlines that must be guaranteed, while the Soft Real-Time ...
Comments