Efficiently and transparently automating scalable on‐demand activation and deactivation of services with the activator pattern. (30th September 2011)

• Record Type: Journal Article
• Authors: Stal, Michael; Schmidt, Douglas C.; Otte, William R.; Fayad, Mohamed E.; Singh, Shivanshu K.
• Is Part Of: Software, practice & experience. Volume 43:Number 7(2013)
• Page Start: 789
• Page End: 806
• Publication Date: 2011-09-30
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.1119
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe1119-abs-0001"> <title>SUMMARY</title> <p id="spe1119-para-0001">Computing systems are increasingly designed as a collection of interacting services that constitute a set of functionality offered by a service provider or server to its clients. Many service‐oriented computing systems have constraints on the resources they allocate and manage. In these systems, certain types of services should consume resources only when they are accessed by clients, and clients should be shielded from where services are located, how they are deployed, and how their lifecycle is managed. The activator pattern provides an effective means to efficiently and transparently automate scalable on‐demand activation and deactivation of services accessed by many clients. This paper motivates the need for the activator pattern, describes the structure and dynamics of canonical implementations of the pattern, and examines the benefits and liabilities of applying this pattern to services in resource‐constrained computing systems. Copyright © 2011 John Wiley &amp; Sons, Ltd.</p> </abstract>