A dynamic quality of service middleware agent for mediating application resource usage

Brandt, Scott; Nutt, Gary J; Berk, Toby S.; Mankovich, J.

doi:10.1109/real.1998.739756

Cited by 82 publications

(55 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To perform this calculation, the system must have, for each application, some representation of the relationship between the resources granted to the application and the application's perceived value to the user. The Dynamic QoS Resource Manager [12,13] and the QoS broker [65] both fall into this category. Oparah [70] describes a resource management system that extends Nemesis; it has the interesting feature that the user can assign positive or negative feedback to decisions made by the resource manager.…”

Section: Resource Management: System Support For Renegotiationmentioning

confidence: 99%

See 1 more Smart Citation

Using Hierarchical Scheduling to Support Soft Real-Time Applications in General-Purpose Operating Systems

Stankovic¹,

Regehr²

View full text Add to dashboard Cite

The CPU schedulers in general-purpose operating systems are designed to provide fast response time for interactive applications and high throughput for batch applications. The heuristics used to achieve these goals do not lend themselves to scheduling real-time applications, nor do they meet other scheduling requirements such as coordinating scheduling across several processors or machines, or enforcing isolation between applications, users, and administrative domains. Extending the scheduling subsystems of general-purpose operating systems in an ad hoc manner is time consuming and requires considerable expertise as well as source code to the operating system. Furthermore, once extended, the new scheduler may be as inflexible as the original.The thesis of this dissertation is that extending a general-purpose operating system with a general, heterogeneous scheduling hierarchy is feasible and useful. A hierarchy of schedulers generalizes the role of CPU schedulers by allowing them to schedule other schedulers in addition to scheduling threads. A general, heterogeneous scheduling hierarchy is one that allows arbitrary (or nearly arbitrary) scheduling algorithms throughout the hierarchy. In contrast, most of the previous work on hierarchical scheduling has imposed restrictions on the schedulers used in part or all of the hierarchy.This dissertation describes the Hierarchical Loadable Scheduler (HLS) architecture, which permits schedulers to be dynamically composed in the kernel of a general-purpose operating system. The most important characteristics of HLS, and the ones that distinguish it from previous work, are that it has demonstrated that a hierarchy of nearly arbitrary schedulers can be efficiently implemented in a general-purpose operating system, and that the behavior of a hierarchy of soft real-time schedulers can be reasoned about in order to provide guaranteed scheduling behavior to application threads. The flexibility afforded by HLS permits scheduling behavior to be tailored to meet complex requirements without encumbering users who have modest requirements with the performance and administrative costs of a complex scheduler.Contributions of this dissertation include the following.(1) The design, prototype implementation, and performance evaluation of HLS in Windows 2000. (2) A system of guarantees for scheduler composition that permits reasoning about the scheduling behavior of a hierarchy of soft real-time schedulers. Guarantees assure users that application requirements can be met throughout the lifetime of the application, and also provide application developers with a model of CPU allocation to which they can program. (3) The design, implementation, and evaluation of two augmented CPU reservation schedulers, which provide increase scheduling predictability when low-level operating system activity steals time from applications. iv AcknowledgmentsFirst of all, many thanks to my advisor Jack Stankovic for being supportive of me and my work, for giving me enough rope but not too much, for pushi...

show abstract

Section: Resource Management: System Support For Renegotiationmentioning

confidence: 99%

“…The Dynamic QoS Resource Manager (DQM) [12,13] is designed to operate without sophisticated scheduling support from the operating system. Real-time applications are expected to support a number of different execution levels, each of which is characterized by a 3-tuple consisting of resource usage, benefit, and period.…”

Section: Resource Management For the Cpumentioning

confidence: 99%

Using Hierarchical Scheduling to Support Soft Real-Time Applications in General-Purpose Operating Systems

Stankovic¹,

Regehr²

View full text Add to dashboard Cite

show abstract

“…In [24], Brand et al propose a mediation method for resource allocation based on the maximums processor usage and users' benefit as measures for QoS levels and present the Dynamic QoS Manager (DQM) middleware. DQM is based on the notion of applications' specified execution levels that reflect algorithmic modes in which applications can execute.…”

Section: Related Workmentioning

confidence: 99%

Time-bounded distributed QoS-aware service configuration in heterogeneous cooperative environments

Nogueira

Pinho

2009

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

The scarcity and diversity of resources among the devices of heterogeneous computing environments may affect their ability to execute services within the users' requested Quality of Service levels, particularly in open real-time environments where the characteristics of the computational load cannot always be predicted in advance but, nevertheless, response to events still has to be provided within precise timing constraints in order to guarantee a desired level of performance. This paper proposes a cooperative service execution, allowing resource constrained devices to collectively execute services with their more powerful neighbours, meeting non-functional requirements that otherwise would not be met by an individual execution. Nodes dynamically group themselves into a new coalition, allocating resources to each new service and establishing an initial service configuration which maximises the satisfaction of the QoS constraints associated with the new service and minimises the impact on the global QoS caused by the new service's arrival.However, the increased complexity of open real-time environments may prevent the possibility of computing optimal local and global resource allocations within a useful and bounded time. As such, the QoS optimisation problem is here reformulated as a heuristic-based anytime optimisation problem that can be interrupted at any time and quickly respond to environmental changes. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial service solution and effectively optimise the rate at which the quality of the current solution improves at each iteration of the algorithms, with an overhead that can be considered negligible when compared against the introduced benefits. AbstractThe scarcity and diversity of resources among the devices of heterogeneous computing environments may affect their ability to execute services within the users' requested Quality of Service levels, particularly in open real-time environments where the characteristics of the computational load cannot always be predicted in advance but, nevertheless, response to events still has to be provided within precise timing constraints in order to guarantee a desired level of performance. This paper proposes a cooperative service execution, allowing resource constrained devices to collectively execute services with their more powerful neighbours, meeting non-functional requirements that otherwise would not be met by an individual execution. Nodes dynamically group themselves into a new coalition, allocating resources to each new service and establishing an initial service configuration which maximises the satisfaction of the QoS constraints associated with the new service and minimises the impact on the global QoS caused by the new service's arrival.However, the increased complexity of open real-time environments may prevent the possibility of computing optimal local and global resource allocations within a useful and bounded time. As such, the QoS optimisat...

show abstract

“…The work applies particularly in the case of remote method invocations to objects over a wide-area network. The work noted in [12] builds a series of middleware-level agent based services, collectively referred to as Dynamic QoS Resource Manager, that dynamically monitors system and application states and switches execution levels within a computationally intensive application. These switching capabilities maximize the user-specified benefits, or promote fairness properties, depending on different algorithms implemented in the middleware.…”

Section: Related Workmentioning

confidence: 99%

QualProbes: Middleware QoS Profiling Services for Configuring Adaptive Applications

Li¹,

Nahrstedt²

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. It is widely accepted that in order to deliver the best Qualityof-Service (QoS), applications need to be adaptive to the fluctuating computing and communication environments. The middleware layer may assist by controlling the behavior of the applications so that they adapt and reconfigure themselves. In this paper, we present QualProbes, a set of middleware QoS Probing and Profiling services to discover such relationships at run-time. Our approach focuses on meeting the requirements of the critical performance criterion in the application. Such criterion may be affected by changes in more than one application-specific QoS parameters, and these parameters have diversely different resource usage patterns. QualProbes services are able to precisely capture the effects made to the critical performance criterion when resource availability varies, and thus enable more effective control of the application to adapt to resource variations. Our case study with OmniTrack, an omni-directional visual tracking application, provides solid proof that QualProbes significantly enhance our capabilities to satisfy the critical performance criterion, the tracking precision, while controlling the adaptation process of the application.

show abstract

A dynamic quality of service middleware agent for mediating application resource usage

Cited by 82 publications

References 16 publications

Using Hierarchical Scheduling to Support Soft Real-Time Applications in General-Purpose Operating Systems

Using Hierarchical Scheduling to Support Soft Real-Time Applications in General-Purpose Operating Systems

Time-bounded distributed QoS-aware service configuration in heterogeneous cooperative environments

QualProbes: Middleware QoS Profiling Services for Configuring Adaptive Applications

Contact Info

Product

Resources

About