Transparent Scheduling of Composite Web Services

Dyachuk, Dmytro, and Deters, Ralph. "Transparent Scheduling of Composite Web Services." Serdica Journal of Computing 1.3 (2007): 267-278. <http://eudml.org/doc/11425>.

@article{Dyachuk2007,
abstract = {Composite Web Services (CWS) aggregate multiple Web Services 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 and 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.},
author = {Dyachuk, Dmytro, Deters, Ralph},
journal = {Serdica Journal of Computing},
keywords = {Web Services; Composite Web Service; LWKR; SJF; Scheduling; Admission Control; CWS performance},
language = {eng},
number = {3},
pages = {267-278},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Transparent Scheduling of Composite Web Services},
url = {http://eudml.org/doc/11425},
volume = {1},
year = {2007},
}

TY - JOUR
AU - Dyachuk, Dmytro
AU - Deters, Ralph
TI - Transparent Scheduling of Composite Web Services
JO - Serdica Journal of Computing
PY - 2007
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 1
IS - 3
SP - 267
EP - 278
AB - Composite Web Services (CWS) aggregate multiple Web Services 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 and 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.
LA - eng
KW - Web Services; Composite Web Service; LWKR; SJF; Scheduling; Admission Control; CWS performance
UR - http://eudml.org/doc/11425
ER -