Name: | Description: | Size: | Format: | |
---|---|---|---|---|
403.98 KB | Adobe PDF |
Advisor(s)
Abstract(s)
Due to the growing complexity and adaptability requirements of real-time systems, which often exhibit
unrestricted Quality of Service (QoS) inter-dependencies among supported services and user-imposed
quality constraints, it is increasingly difficult to optimise the level of service of a dynamic task set within
an useful and bounded time. This is even more difficult when intending to benefit from the full potential
of an open distributed cooperating environment, where service characteristics are not known beforehand
and tasks may be inter-dependent.
This paper focuses on optimising a dynamic local set of inter-dependent tasks that can be executed
at varying levels of QoS to achieve an efficient resource usage that is constantly adapted to the specific
constraints of devices and users, nature of executing tasks and dynamically changing system conditions.
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.