Scheduling of composite web services

Authors:
Dmytro Dyachuk;Ralph Deters
Affiliations:
Department of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan, Canada;Department of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan, Canada
Venue:
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part I
Year:
2006

Citing 2
Cited 2

Scheduling Algorithms

Scheduling Algorithms
Adaptive Load Control in Transaction Processing Systems

VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases

Intelligent Overload Control for Composite Web Services

ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
Multi-user web service selection based on multi-QoS prediction

Information Systems Frontiers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Composite Web Services (CWS) aggregate multiple Web Services (WS) in one logical unit to accomplish a complex task (e.g business process) This aggregation is achieved by defining a workflow that orchestrates the underlying Web Services in a manner consistent with the desired functionality Since CWS can aggregate atomic WS and/or other CWS they foster the development of service layers and reuse of already existing functionality An important issue in the deployment of services is their run-time performance under various loads Due to the complex interactions of the underlying services, a CWS they can exhibit problematic and often difficult to predict behaviours in overload situations. This paper focuses on the use of request scheduling for improving CWS performance in overload situations Different scheduling policies are investigated in regards to their effectiveness in helping with bulk arrivals.