Name: | Description: | Size: | Format: | |
---|---|---|---|---|
327.14 KB | Adobe PDF |
Advisor(s)
Abstract(s)
Due to the growing complexity and adaptability requirements of real-time embedded systems, which often exhibit
unrestricted 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. This paper proposes an iterative refinement approach for a service’s QoS
configuration taking into account services’ inter-dependencies and quality constraints, and trading off the achieved
solution’s quality for the cost of computation. Extensive simulations demonstrate that the proposed anytime algorithm is
able to quickly find a good initial solution and effectively optimises the rate at which the quality of the current solution
improves as the algorithm is given more time to run. The added benefits of the proposed approach clearly surpass its
reducedoverhead.
Description
Keywords
Citation
Publisher
Springer