Detecting Concurrency-Related Problematic Activity Arrangement in WS-BPEL Programs

Detecting Concurrency-Related Problematic Activity Arrangement in WS-BPEL Programs

A composite web service often interacts with several partner web services hosted in different servers. These partner web services are represented as activities in a WS-BPEL program describing the composite web service. Invoking the maximal number of these activities concurrently is essential for imp...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Yitao Ni, Lu Zhang, Zhongjie Li, Tao Xie, Hong Mei
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Business
Data models
Marine vehicles
Semantics
Servers
Switches
Web services
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 217
container_issue
container_start_page 209
container_title
container_volume
creator Yitao Ni
Lu Zhang
Zhongjie Li
Tao Xie
Hong Mei
description A composite web service often interacts with several partner web services hosted in different servers. These partner web services are represented as activities in a WS-BPEL program describing the composite web service. Invoking the maximal number of these activities concurrently is essential for improving its performance. But complex message coupling and control dependency between activities in a composite web service may prevent them from being arranged correctly and efficiently. In this paper, we propose an approach for detecting problematic activity arrangement in a WS-BPEL program based on analyzing message propagation and activity dependency in the program. The underlying idea of our approach is to check whether activities with dependency are arranged as concurrent and whether activities without dependency are arranged as sequential. Our preliminary empirical results demonstrate the effectiveness of our approach.
doi_str_mv 10.1109/SCC.2011.108
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6009263</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6009263</ieee_id><sourcerecordid>6009263</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-9f112a3cb930da6a102d38604a7a2f0909b777ef5ba8dc795bf271cfd10aada3</originalsourceid><addsrcrecordid>eNotjE1LxDAUACMi6K578-alf6D1JWmT5ljr-gEFl63gcXlNX0uk7Uoahf57V3QucxmGsRsOCedg7uqyTARwnnDIz9gKtDJZmiohztmKp5nWkCtpLtlmnj_ghFJG5_qK7R8okA1u6qPyONkv72myS7ynAQO10c4fm4FGDM5GxSn7dmGJCu9x6mmkKURuit7r-H63rX7b3uM4X7OLDoeZNv9es_px-1Y-x9Xr00tZVLEzEGLTcS5Q2sZIaFEhB9HKXEGKGkUHBkyjtaYuazBvrTZZ0wnNbddyQGxRrtnt39UR0eHTuxH9clAARigpfwCBD07p</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Detecting Concurrency-Related Problematic Activity Arrangement in WS-BPEL Programs</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Yitao Ni ; Lu Zhang ; Zhongjie Li ; Tao Xie ; Hong Mei</creator><creatorcontrib>Yitao Ni ; Lu Zhang ; Zhongjie Li ; Tao Xie ; Hong Mei</creatorcontrib><description>A composite web service often interacts with several partner web services hosted in different servers. These partner web services are represented as activities in a WS-BPEL program describing the composite web service. Invoking the maximal number of these activities concurrently is essential for improving its performance. But complex message coupling and control dependency between activities in a composite web service may prevent them from being arranged correctly and efficiently. In this paper, we propose an approach for detecting problematic activity arrangement in a WS-BPEL program based on analyzing message propagation and activity dependency in the program. The underlying idea of our approach is to check whether activities with dependency are arranged as concurrent and whether activities without dependency are arranged as sequential. Our preliminary empirical results demonstrate the effectiveness of our approach.</description><identifier>ISBN: 1457708639</identifier><identifier>ISBN: 9781457708633</identifier><identifier>EISBN: 0769544622</identifier><identifier>EISBN: 9780769544625</identifier><identifier>DOI: 10.1109/SCC.2011.108</identifier><language>eng</language><publisher>IEEE</publisher><subject>Business ; Data models ; Marine vehicles ; Semantics ; Servers ; Switches ; Web services</subject><ispartof>2011 IEEE International Conference on Services Computing, 2011, p.209-217</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6009263$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6009263$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yitao Ni</creatorcontrib><creatorcontrib>Lu Zhang</creatorcontrib><creatorcontrib>Zhongjie Li</creatorcontrib><creatorcontrib>Tao Xie</creatorcontrib><creatorcontrib>Hong Mei</creatorcontrib><title>Detecting Concurrency-Related Problematic Activity Arrangement in WS-BPEL Programs</title><title>2011 IEEE International Conference on Services Computing</title><addtitle>scc</addtitle><description>A composite web service often interacts with several partner web services hosted in different servers. These partner web services are represented as activities in a WS-BPEL program describing the composite web service. Invoking the maximal number of these activities concurrently is essential for improving its performance. But complex message coupling and control dependency between activities in a composite web service may prevent them from being arranged correctly and efficiently. In this paper, we propose an approach for detecting problematic activity arrangement in a WS-BPEL program based on analyzing message propagation and activity dependency in the program. The underlying idea of our approach is to check whether activities with dependency are arranged as concurrent and whether activities without dependency are arranged as sequential. Our preliminary empirical results demonstrate the effectiveness of our approach.</description><subject>Business</subject><subject>Data models</subject><subject>Marine vehicles</subject><subject>Semantics</subject><subject>Servers</subject><subject>Switches</subject><subject>Web services</subject><isbn>1457708639</isbn><isbn>9781457708633</isbn><isbn>0769544622</isbn><isbn>9780769544625</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjE1LxDAUACMi6K578-alf6D1JWmT5ljr-gEFl63gcXlNX0uk7Uoahf57V3QucxmGsRsOCedg7uqyTARwnnDIz9gKtDJZmiohztmKp5nWkCtpLtlmnj_ghFJG5_qK7R8okA1u6qPyONkv72myS7ynAQO10c4fm4FGDM5GxSn7dmGJCu9x6mmkKURuit7r-H63rX7b3uM4X7OLDoeZNv9es_px-1Y-x9Xr00tZVLEzEGLTcS5Q2sZIaFEhB9HKXEGKGkUHBkyjtaYuazBvrTZZ0wnNbddyQGxRrtnt39UR0eHTuxH9clAARigpfwCBD07p</recordid><startdate>201107</startdate><enddate>201107</enddate><creator>Yitao Ni</creator><creator>Lu Zhang</creator><creator>Zhongjie Li</creator><creator>Tao Xie</creator><creator>Hong Mei</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201107</creationdate><title>Detecting Concurrency-Related Problematic Activity Arrangement in WS-BPEL Programs</title><author>Yitao Ni ; Lu Zhang ; Zhongjie Li ; Tao Xie ; Hong Mei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-9f112a3cb930da6a102d38604a7a2f0909b777ef5ba8dc795bf271cfd10aada3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Business</topic><topic>Data models</topic><topic>Marine vehicles</topic><topic>Semantics</topic><topic>Servers</topic><topic>Switches</topic><topic>Web services</topic><toplevel>online_resources</toplevel><creatorcontrib>Yitao Ni</creatorcontrib><creatorcontrib>Lu Zhang</creatorcontrib><creatorcontrib>Zhongjie Li</creatorcontrib><creatorcontrib>Tao Xie</creatorcontrib><creatorcontrib>Hong Mei</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yitao Ni</au><au>Lu Zhang</au><au>Zhongjie Li</au><au>Tao Xie</au><au>Hong Mei</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Detecting Concurrency-Related Problematic Activity Arrangement in WS-BPEL Programs</atitle><btitle>2011 IEEE International Conference on Services Computing</btitle><stitle>scc</stitle><date>2011-07</date><risdate>2011</risdate><spage>209</spage><epage>217</epage><pages>209-217</pages><isbn>1457708639</isbn><isbn>9781457708633</isbn><eisbn>0769544622</eisbn><eisbn>9780769544625</eisbn><abstract>A composite web service often interacts with several partner web services hosted in different servers. These partner web services are represented as activities in a WS-BPEL program describing the composite web service. Invoking the maximal number of these activities concurrently is essential for improving its performance. But complex message coupling and control dependency between activities in a composite web service may prevent them from being arranged correctly and efficiently. In this paper, we propose an approach for detecting problematic activity arrangement in a WS-BPEL program based on analyzing message propagation and activity dependency in the program. The underlying idea of our approach is to check whether activities with dependency are arranged as concurrent and whether activities without dependency are arranged as sequential. Our preliminary empirical results demonstrate the effectiveness of our approach.</abstract><pub>IEEE</pub><doi>10.1109/SCC.2011.108</doi><tpages>9</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 1457708639
ispartof 2011 IEEE International Conference on Services Computing, 2011, p.209-217
issn
language eng
recordid cdi_ieee_primary_6009263
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Business
Data models
Marine vehicles
Semantics
Servers
Switches
Web services
title Detecting Concurrency-Related Problematic Activity Arrangement in WS-BPEL Programs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T17%3A43%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Detecting%20Concurrency-Related%20Problematic%20Activity%20Arrangement%20in%20WS-BPEL%20Programs&rft.btitle=2011%20IEEE%20International%20Conference%20on%20Services%20Computing&rft.au=Yitao%20Ni&rft.date=2011-07&rft.spage=209&rft.epage=217&rft.pages=209-217&rft.isbn=1457708639&rft.isbn_list=9781457708633&rft_id=info:doi/10.1109/SCC.2011.108&rft_dat=%3Cieee_6IE%3E6009263%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=0769544622&rft.eisbn_list=9780769544625&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6009263&rfr_iscdi=true