XML has been widely adopted across a wide spectrum of applications. Its parsing efficiency, however, remains a concern, and can be a bottleneck. At the same time, with the trend towards multicore CPUs, parallelization to improve performance has become increasingly relevant. In previous work, we have investigated parallelizing DOM-style parsing and gained significant speedup. For streaming XML applications, however, SAX-style parsing is often required. In this paper, we present a technique and implementation of a parallel XML SAX parser. To handle inherent data dependencies in XML while still allowing reasonable scalability, we use a 4-stage software pipeline with a combination of strictly sequential stages and stages that can be further data-parallelized within the stage. We thus utilize a hybrid between pipelined parallelism and data parallelism. To demonstrate effectiveness, we test this approach on a Linux machine with two Intel Xeon L5320 CPUs for a total of 8 physical cores, and obtain good speedup up to about 8 CPUs.
{"title":"Hybrid Parallelism for XML SAX Parsing","authors":"Yinfei Pan, Y. Zhang, K. Chiu","doi":"10.1109/ICWS.2008.107","DOIUrl":"https://doi.org/10.1109/ICWS.2008.107","url":null,"abstract":"XML has been widely adopted across a wide spectrum of applications. Its parsing efficiency, however, remains a concern, and can be a bottleneck. At the same time, with the trend towards multicore CPUs, parallelization to improve performance has become increasingly relevant. In previous work, we have investigated parallelizing DOM-style parsing and gained significant speedup. For streaming XML applications, however, SAX-style parsing is often required. In this paper, we present a technique and implementation of a parallel XML SAX parser. To handle inherent data dependencies in XML while still allowing reasonable scalability, we use a 4-stage software pipeline with a combination of strictly sequential stages and stages that can be further data-parallelized within the stage. We thus utilize a hybrid between pipelined parallelism and data parallelism. To demonstrate effectiveness, we test this approach on a Linux machine with two Intel Xeon L5320 CPUs for a total of 8 physical cores, and obtain good speedup up to about 8 CPUs.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"178 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114090686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Today, multimedia system are still widely realized as monolithic systems. But building such applications using Service-Oriented Architectures - especially for the Processing and Delivery of continuous Multimedia data streams - has been a controversial topic since years. As a result, applications in the multimedia domain cannot yet benefit from Web service architectures. Thus, building and maintaining large-scale multimedia applications remains a difficult, costly, time-consuming and challenging problem. In this paper we present our approach for building large scale multimedia systems and compare it with the current state of the art, concentrating on the selection and validation of multimedia service composition.
{"title":"Multimedia Content Provisioning Using Service Oriented Architectures","authors":"I. Brunkhorst, S. Tönnies, Wolf-Tilo Balke","doi":"10.1109/ICWS.2008.37","DOIUrl":"https://doi.org/10.1109/ICWS.2008.37","url":null,"abstract":"Today, multimedia system are still widely realized as monolithic systems. But building such applications using Service-Oriented Architectures - especially for the Processing and Delivery of continuous Multimedia data streams - has been a controversial topic since years. As a result, applications in the multimedia domain cannot yet benefit from Web service architectures. Thus, building and maintaining large-scale multimedia applications remains a difficult, costly, time-consuming and challenging problem. In this paper we present our approach for building large scale multimedia systems and compare it with the current state of the art, concentrating on the selection and validation of multimedia service composition.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130747910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Composing adaptive and self-managing Web services needs plug-and-play architecture so that the deployment of control components does not require changes made to the Web services and the host middleware platforms. This is especially challenging for Web services running on COTS middleware platforms, such as Microsoft.Net. In this paper, we propose an architectural solution that introduces a management proxy between adaptive control components and Web services. The management proxy can be customized and seamlessly integrated with a COTS middleware platform by leveraging the existing middleware mechanisms. This solution enables dynamically composing adaptive Web services on COTS middleware without stopping its services. We demonstrate this architecture by a realistic Web service application built on .Net Windows Communication Foundation (WCF). The performance overhead incurred by this architecture is measured, and the results validate that our solution is efficient in terms of performance and flexibility.
组合自适应和自管理的Web服务需要即插即用的体系结构，这样控制组件的部署就不需要对Web服务和主机中间件平台进行更改。这对于运行在COTS中间件平台(如Microsoft.Net)上的Web服务来说尤其具有挑战性。在本文中，我们提出了一个在自适应控制组件和Web服务之间引入管理代理的体系结构解决方案。通过利用现有的中间件机制，可以定制管理代理并与COTS中间件平台无缝集成。此解决方案支持在COTS中间件上动态组合自适应Web服务，而无需停止其服务。我们通过一个基于。net Windows Communication Foundation (WCF)构建的实际Web服务应用程序来演示这种体系结构。测量了该体系结构产生的性能开销，结果验证了我们的解决方案在性能和灵活性方面是有效的。
{"title":"Composing Adaptive Web Services on COTS Middleware","authors":"Y. Liu, Simon Truong, Shiping Chen, Liming Zhu","doi":"10.1109/ICWS.2008.74","DOIUrl":"https://doi.org/10.1109/ICWS.2008.74","url":null,"abstract":"Composing adaptive and self-managing Web services needs plug-and-play architecture so that the deployment of control components does not require changes made to the Web services and the host middleware platforms. This is especially challenging for Web services running on COTS middleware platforms, such as Microsoft.Net. In this paper, we propose an architectural solution that introduces a management proxy between adaptive control components and Web services. The management proxy can be customized and seamlessly integrated with a COTS middleware platform by leveraging the existing middleware mechanisms. This solution enables dynamically composing adaptive Web services on COTS middleware without stopping its services. We demonstrate this architecture by a realistic Web service application built on .Net Windows Communication Foundation (WCF). The performance overhead incurred by this architecture is measured, and the results validate that our solution is efficient in terms of performance and flexibility.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130133545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
All words are used in books, in which each are organized into a category through a library classification system. Therefore, words used by bloggers are also written in books, which in turn are categorized into specific categories. If a blogger uses a particular word often, we can anticipate that the blogger will have interest areas coinciding with the related book categories. This paper suggests that bloggerspsila interests can be known through extracting keywords from blog entry titles and using book classification schemes. Because there were instances in which the keywords alone did not provide adequate information, the Naver (Korean search engine) related keywords search function was used because of its collective intelligence properties. During the experiment, test subjects picked the blogs and entry titles, which were analyzed using the 'Naver OpenAPI'. The results show that it is possible to know a blogger's interests using blog entry titles and book classifications.
{"title":"Algorithm for Extrapolating Blogger's Interests through Library Classification Systems","authors":"Y. S. Kim, Kibeom Lee, J. Ryu","doi":"10.1109/ICWS.2008.25","DOIUrl":"https://doi.org/10.1109/ICWS.2008.25","url":null,"abstract":"All words are used in books, in which each are organized into a category through a library classification system. Therefore, words used by bloggers are also written in books, which in turn are categorized into specific categories. If a blogger uses a particular word often, we can anticipate that the blogger will have interest areas coinciding with the related book categories. This paper suggests that bloggerspsila interests can be known through extracting keywords from blog entry titles and using book classification schemes. Because there were instances in which the keywords alone did not provide adequate information, the Naver (Korean search engine) related keywords search function was used because of its collective intelligence properties. During the experiment, test subjects picked the blogs and entry titles, which were analyzed using the 'Naver OpenAPI'. The results show that it is possible to know a blogger's interests using blog entry titles and book classifications.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131536263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Y. Murata, D. Sato, Y. Itoga, T. Takayama, Nobuyoshi Sato, S. Horiguchi
Despite the benefits those communities FM radio broadcasting services provide to their listeners, more than half of the community stations in Japan are struggling financially. This situation has arisen because the Internet has attracted advertising revenue away from radio broadcasting channels. One way to revive local FM radio broadcasting is by adding new representation function to radio signals. It is designed for many listeners to share the same information simultaneously. On the other hand, while the Web provides a variety of content, its ability to broadcast is inferior to that of TV or radio broadcasting. Combining radio broadcasting and the WWW provides a new broadcasting media. The control signals used for accessing the Web are put onto radio sound by using Acoustic OFDM technology. We developed and evaluated such a broadcasting system.
{"title":"New Broadcasting System Combined with Radio Broadcasting and WWW","authors":"Y. Murata, D. Sato, Y. Itoga, T. Takayama, Nobuyoshi Sato, S. Horiguchi","doi":"10.1109/ICWS.2008.130","DOIUrl":"https://doi.org/10.1109/ICWS.2008.130","url":null,"abstract":"Despite the benefits those communities FM radio broadcasting services provide to their listeners, more than half of the community stations in Japan are struggling financially. This situation has arisen because the Internet has attracted advertising revenue away from radio broadcasting channels. One way to revive local FM radio broadcasting is by adding new representation function to radio signals. It is designed for many listeners to share the same information simultaneously. On the other hand, while the Web provides a variety of content, its ability to broadcast is inferior to that of TV or radio broadcasting. Combining radio broadcasting and the WWW provides a new broadcasting media. The control signals used for accessing the Web are put onto radio sound by using Acoustic OFDM technology. We developed and evaluated such a broadcasting system.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134010781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web services search and discovery systems have received a great deal of attention recently. However, little attention has been given to a Web services filtering system. In this paper, we propose a design and architecture of a semantic Web services filtering system called SWFilter. SWFilter uses Prufer sequences transformed from Web services and user queries. The filtering process is performed in a bottom-up manner. Ontology information and compositions of Web services are also considered in the filtering process.
{"title":"SWFilter: Semantic Web Services Filtering System","authors":"Joonho Kwon, Sukho Lee","doi":"10.1109/ICWS.2008.132","DOIUrl":"https://doi.org/10.1109/ICWS.2008.132","url":null,"abstract":"Web services search and discovery systems have received a great deal of attention recently. However, little attention has been given to a Web services filtering system. In this paper, we propose a design and architecture of a semantic Web services filtering system called SWFilter. SWFilter uses Prufer sequences transformed from Web services and user queries. The filtering process is performed in a bottom-up manner. Ontology information and compositions of Web services are also considered in the filtering process.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116537010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
L. Bao, Sheng Chen, Xiyang Liu, Shengming Hu, Ping Chen
Despite the great momentum gained about the testing, analysis and verification of BPEL process, little attention has paid to the debugging issues, especially about the building of ad hoc debuggers. In this paper, we propose and implement RBDB (reversible BPEL debugger), a specially made reversible debugger for BPEL process. RBDB is built on the abstract debugging APIs to fulfill its functionality. A reversible concurrent debugging model and three strategies to handle different type of external Web services are introduced later. Finally, a comprehensive analysis of experiment data are presented. Evaluation results demonstrate that RBDB can improve users' efficiency significantly and decrease the invoking times of external services substantially.
{"title":"Towards a Reversible BPEL Debugger","authors":"L. Bao, Sheng Chen, Xiyang Liu, Shengming Hu, Ping Chen","doi":"10.1109/ICWS.2008.48","DOIUrl":"https://doi.org/10.1109/ICWS.2008.48","url":null,"abstract":"Despite the great momentum gained about the testing, analysis and verification of BPEL process, little attention has paid to the debugging issues, especially about the building of ad hoc debuggers. In this paper, we propose and implement RBDB (reversible BPEL debugger), a specially made reversible debugger for BPEL process. RBDB is built on the abstract debugging APIs to fulfill its functionality. A reversible concurrent debugging model and three strategies to handle different type of external Web services are introduced later. Finally, a comprehensive analysis of experiment data are presented. Evaluation results demonstrate that RBDB can improve users' efficiency significantly and decrease the invoking times of external services substantially.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123305622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
QoS-aware service composition intends to maximize the QoS of a composite service when selecting service providers. This paper proposes a service composition scheme that uses a combination of Integer Programming, case-based reasoning, and, genetic algorithms techniques. The scheme reduces the service composition costs by reusing existing compositions. Experiments show that, compared with solutions purely based on Integer Programming, the proposed scheme is effective in reducing the time for carrying out service composition.
{"title":"A Hybrid Approach to QoS-Aware Service Composition","authors":"Xinfeng Ye, Rami Mounla","doi":"10.1109/ICWS.2008.29","DOIUrl":"https://doi.org/10.1109/ICWS.2008.29","url":null,"abstract":"QoS-aware service composition intends to maximize the QoS of a composite service when selecting service providers. This paper proposes a service composition scheme that uses a combination of Integer Programming, case-based reasoning, and, genetic algorithms techniques. The scheme reduces the service composition costs by reusing existing compositions. Experiments show that, compared with solutions purely based on Integer Programming, the proposed scheme is effective in reducing the time for carrying out service composition.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125110536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ting Wang, Chang-Shing Perng, Tao Tao, Chunqiang Tang, Edward So, Chun Zhang, Rong N. Chang, Ling Liu
Effective management of Web Services systems relies on accurate understanding of end-to-end transaction flows, which may change over time as the service composition evolves. This work takes a data mining approach to automatically recovering end-to-end transaction flows from (potentially obscure) monitoring events produced by monitoring tools. We classify the caller-callee relationships among monitoring events into three categories(identity, direct-invoke, and cascaded-invoke), and propose unsupervised learning algorithms to generate rules for each type of relationship. The key idea is to leverage the temporal information available in the monitoring data and extract patterns that have statistical significance. By piecing together the caller-callee relationships a teach step along the invocation path, we can recover the end-to-end flow for every executed transaction. Experiments demonstrate that our algorithms outperform human experts in terms of solution quality, scale well with the data size, and are robust against noises in monitoring data.
{"title":"A Temporal Data-Mining Approach for Discovering End-to-End Transaction Flows","authors":"Ting Wang, Chang-Shing Perng, Tao Tao, Chunqiang Tang, Edward So, Chun Zhang, Rong N. Chang, Ling Liu","doi":"10.1109/ICWS.2008.59","DOIUrl":"https://doi.org/10.1109/ICWS.2008.59","url":null,"abstract":"Effective management of Web Services systems relies on accurate understanding of end-to-end transaction flows, which may change over time as the service composition evolves. This work takes a data mining approach to automatically recovering end-to-end transaction flows from (potentially obscure) monitoring events produced by monitoring tools. We classify the caller-callee relationships among monitoring events into three categories(identity, direct-invoke, and cascaded-invoke), and propose unsupervised learning algorithms to generate rules for each type of relationship. The key idea is to leverage the temporal information available in the monitoring data and extract patterns that have statistical significance. By piecing together the caller-callee relationships a teach step along the invocation path, we can recover the end-to-end flow for every executed transaction. Experiments demonstrate that our algorithms outperform human experts in terms of solution quality, scale well with the data size, and are robust against noises in monitoring data.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117252685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we characterize the problem of how to synthesize a reliable service mediator that can guarantee reliable interaction of the mediated Web services. We first present formal models of reliable protocols for Web services and service mediators. Then, we introduce an algorithm for synthesizing reliable service mediators.
{"title":"An Acknowledgement-Based Approach to Synthesizing Reliable Service Mediators","authors":"Baoping Lin, Qing Li, Naijie Gu","doi":"10.1109/ICWS.2008.66","DOIUrl":"https://doi.org/10.1109/ICWS.2008.66","url":null,"abstract":"In this paper, we characterize the problem of how to synthesize a reliable service mediator that can guarantee reliable interaction of the mediated Web services. We first present formal models of reliable protocols for Web services and service mediators. Then, we introduce an algorithm for synthesizing reliable service mediators.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121441655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：