Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Scheduling of Composite Web Services
| |
|
Posters of the 2006 DOA (Distributed Objects and Applications) International Conference
Scheduling of Composite Web Services
Dmytro Dyachuk1 and Ralph Deters1 
| (1) |
Department of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan, S7N 5C9, Canada |
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.
Keywords: Web Services, Composite Web Service, LWKR, SJF, Scheduling, Admission Control.
An erratum to this chapter can be found at http://dx.doi.org/10.1007/11915034_125.
Fulltext Preview (Small, Large)
|
|
|
|
|
|