Details
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 5th IEEE European Conference on Web Services, ECOWS 07 |
| Pages | 213-222 |
| Number of pages | 10 |
| Publication status | Published - 2007 |
| Event | 5th IEEE European Conference on Web Services, ECOWS 07 - Halle, Germany Duration: 26 Nov 2007 → 28 Nov 2007 |
Publication series
| Name | Proceedings of the 5th IEEE European Conference on Web Services, ECOWS 07 |
|---|
Abstract
For improved flexibility and concurrent usage existing transaction management models for Web services relax the isolation property of Web service-based transactions. Correctness of the concurrent execution then has to be ensured by commit order-preserving transaction schedulers. However, local schedulers of service providers typically do take into account neither time constraints for committing the whole transaction, nor the individual services' constraints when scheduling decisions are made. This often leads to an unnecessary blocking of transactions by (possibly long-running) others. In this paper, we propose a novel nonblocking scheduling mechanism that is used prior to the actual service invocations. Its aim is to reach an agreement between the client and all participating providers on what transaction processing times have to be expected, accepted, and guaranteed. This enables service consumers to find a set of best suited providers fitting their deadlines. Service providers on the other hand can benefit from the proposed mechanism due to the now possible intelligent scheduling of service invocations for best throughput. In fact, our experiments show a significant improvement in terms of overall throughput, service chain completions and resources' utilization.
ASJC Scopus subject areas
- Computer Science(all)
- General Computer Science
- Computer Science(all)
- Hardware and Architecture
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Proceedings of the 5th IEEE European Conference on Web Services, ECOWS 07. 2007. p. 213-222 4399750 (Proceedings of the 5th IEEE European Conference on Web Services, ECOWS 07).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Nonblocking scheduling for Web service transactions
AU - Alrifai, Mohammad
AU - Balke, Wolf Tilo
AU - Dolog, Peter
AU - Nejdl, Wolfgang
PY - 2007
Y1 - 2007
N2 - For improved flexibility and concurrent usage existing transaction management models for Web services relax the isolation property of Web service-based transactions. Correctness of the concurrent execution then has to be ensured by commit order-preserving transaction schedulers. However, local schedulers of service providers typically do take into account neither time constraints for committing the whole transaction, nor the individual services' constraints when scheduling decisions are made. This often leads to an unnecessary blocking of transactions by (possibly long-running) others. In this paper, we propose a novel nonblocking scheduling mechanism that is used prior to the actual service invocations. Its aim is to reach an agreement between the client and all participating providers on what transaction processing times have to be expected, accepted, and guaranteed. This enables service consumers to find a set of best suited providers fitting their deadlines. Service providers on the other hand can benefit from the proposed mechanism due to the now possible intelligent scheduling of service invocations for best throughput. In fact, our experiments show a significant improvement in terms of overall throughput, service chain completions and resources' utilization.
AB - For improved flexibility and concurrent usage existing transaction management models for Web services relax the isolation property of Web service-based transactions. Correctness of the concurrent execution then has to be ensured by commit order-preserving transaction schedulers. However, local schedulers of service providers typically do take into account neither time constraints for committing the whole transaction, nor the individual services' constraints when scheduling decisions are made. This often leads to an unnecessary blocking of transactions by (possibly long-running) others. In this paper, we propose a novel nonblocking scheduling mechanism that is used prior to the actual service invocations. Its aim is to reach an agreement between the client and all participating providers on what transaction processing times have to be expected, accepted, and guaranteed. This enables service consumers to find a set of best suited providers fitting their deadlines. Service providers on the other hand can benefit from the proposed mechanism due to the now possible intelligent scheduling of service invocations for best throughput. In fact, our experiments show a significant improvement in terms of overall throughput, service chain completions and resources' utilization.
UR - http://www.scopus.com/inward/record.url?scp=47749153778&partnerID=8YFLogxK
U2 - 10.1109/ECOWS.2007.15
DO - 10.1109/ECOWS.2007.15
M3 - Conference contribution
AN - SCOPUS:47749153778
SN - 978-0-7695-3044-4
T3 - Proceedings of the 5th IEEE European Conference on Web Services, ECOWS 07
SP - 213
EP - 222
BT - Proceedings of the 5th IEEE European Conference on Web Services, ECOWS 07
T2 - 5th IEEE European Conference on Web Services, ECOWS 07
Y2 - 26 November 2007 through 28 November 2007
ER -