Operational rationality through compilation of anytime algorithms
Operational rationality through compilation of anytime algorithms
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Flexible Soft Real-Time Processing in Middleware
Real-Time Systems - Flexible Scheduling on Real-Time Systems
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Quality Aspects in IT Service Management
DSOM '02 Proceedings of the 13th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management: Management Technologies for E-Commerce and E-Business Applications
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
On the theory of system administration
Science of Computer Programming
Parametric analysis for adaptive computation offloading
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Integrated Resource Management and Scheduling with Multi-Resource Constraints
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Dynamic QoS-Aware Coalition Formation
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
Dynamic Adaptation of Stability Periods for Service Level Agreements
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Time-bounded distributed QoS-aware service configuration in heterogeneous cooperative environments
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Due to the growing complexity and dynamism of many embedded application domains (including consumer electronics, robotics, automotive and telecommunications), it is increasingly difficult to react to load variations and adapt the system's performance in a controlled fashion within an useful and bounded time. This is particularly noticeable when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand and tasks may exhibit unrestricted QoS inter-dependencies. This paper proposes a novel anytime adaptive QoS control policy in which the online search for the best set of QoS levels is combined with each user's personal preferences on their services' adaptation behaviour. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves as the algorithms are given more time to run, with a minimum overhead when compared against their traditional versions.