Loading...
Please wait, while we are loading the content...
Similar Documents
Heuristics-based scheduling of composite web service workloads
| Content Provider | ACM Digital Library |
|---|---|
| Author | Li, Wen-Syan Phan, Thomas |
| Abstract | Web services can be aggregated to create composite workflows that provide streamlined functionality for human users or other systems. Although industry standards and recent research have sought to define best practices and to improve end-to-end workflow composition, one area that has not fully been explored is the scheduling of a workflow's web service requests to actual service provisioning in a multi-tiered, multi-organisation environment. This issue is relevant to modern business scenarios where business processes within a workflow must complete within QoS-defined limits. Because these business processes are web service consumers, service requests must be mapped and scheduled across multiple web service providers, each with its own negotiated service level agreement. In this paper we provide heuristics for scheduling service requests from multiple business process workflows to web service providers such that a business value metric across all workflows is maximised. We show that a genetic search algorithm is appropriate to perform this scheduling, and through experimentation we show that our algorithm scales well up to a thousand workflows and produces better mappings than traditional approaches. |
| Starting Page | 30 |
| Ending Page | 35 |
| Page Count | 6 |
| File Format | |
| ISBN | 1595934251 |
| DOI | 10.1145/1169091.1169096 |
| Language | English |
| Publisher | Association for Computing Machinery (ACM) |
| Publisher Date | 2006-11-27 |
| Publisher Place | New York |
| Access Restriction | Subscribed |
| Subject Keyword | Web services Qos Workflows Heuristics Scheduling |
| Content Type | Text |
| Resource Type | Article |
