GMU Software Engineering Seminar Series
***********************************************
Date: Wednesday, 07/23/2008
Time: 11:00 – 12:00 PM
Location: 430A ST2
***********************************************
Title: On the problem of optimal service selection for service oriented architectures
Speaker: Daniel Menasce
Abstract: Service Oriented Architectures (SOA) enable a multitude of service providers (SP) to provide loosely coupled and interoperable services at different Quality of Service (QoS) and cost levels. This work considers business processes composed of activities that are supported by service providers. The structure of a business process may be expressed by languages such as BPEL and allows for constructs such as sequence, switch, while, flow, and pick. We consider the problem of finding the set of service providers that minimizes the total execution time of the business process subject to cost and execution time constraints. The problem is clearly NP-hard. However, we present an efficient algorithm that finds the optimal solution without having to explore the entire solution space. This algorithm can be used to find the optimal solution in problems of moderate size. A heuristic solution is also presented and experimental studies that compare the optimal and heuristic solution show that the average execution time obtained with a heuristic allocation of providers to activities does not exceed 6% of that of the optimal solution.
Bio: Daniel Menasce is the Associate Dean for Research and Graduate Studies and a Professor of Computer Science at the Volgenau School of IT & Engineering. He holds a PhD in Computer Science from UCLA and he is a Fellow of the ACM and a Senior Member of the IEEE. Menasce is the recipient of the lifetime A.A. Michelson Award from the Computer Measurement Group. He is the author of over 190 papers and five books published by Prentice Hall. His areas of interest include software performance engineering, autonomic computing, computer system performance modeling, e-commerce and web technologies.