Pub Date : 2020-01-01DOI: 10.1504/ijwgs.2020.10031654
Chunzhi Wang, Wenshuo Bian, Ruoxi Wang, Hongwe Chen, Z. Ye, Lingyu Yan
{"title":"Association rules mining in parallel conditional tree based on grid computing inspired partition algorithm","authors":"Chunzhi Wang, Wenshuo Bian, Ruoxi Wang, Hongwe Chen, Z. Ye, Lingyu Yan","doi":"10.1504/ijwgs.2020.10031654","DOIUrl":"https://doi.org/10.1504/ijwgs.2020.10031654","url":null,"abstract":"","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"126 1","pages":"321-339"},"PeriodicalIF":1.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79530072","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-01-01DOI: 10.1504/ijwgs.2020.10031637
Jianlan Ren, Zhongsheng Chen, Zheng Zhang
{"title":"Distributed data mining in grid computing environment","authors":"Jianlan Ren, Zhongsheng Chen, Zheng Zhang","doi":"10.1504/ijwgs.2020.10031637","DOIUrl":"https://doi.org/10.1504/ijwgs.2020.10031637","url":null,"abstract":"","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"67 1","pages":"305-320"},"PeriodicalIF":1.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86965787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-01-01DOI: 10.1504/ijwgs.2020.10031647
Xiaokan Wang, Qiong Wang
{"title":"Green lighting intelligent control system with web services based on back propagation algorithm","authors":"Xiaokan Wang, Qiong Wang","doi":"10.1504/ijwgs.2020.10031647","DOIUrl":"https://doi.org/10.1504/ijwgs.2020.10031647","url":null,"abstract":"","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"5 1","pages":"273-286"},"PeriodicalIF":1.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83263291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-01-01DOI: 10.1504/ijwgs.2020.10031644
Mei-Feng You, Wenping Luo, Meizhang He
{"title":"Resource scheduling of information platform for general grid computing framework","authors":"Mei-Feng You, Wenping Luo, Meizhang He","doi":"10.1504/ijwgs.2020.10031644","DOIUrl":"https://doi.org/10.1504/ijwgs.2020.10031644","url":null,"abstract":"","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"26 1","pages":"254-272"},"PeriodicalIF":1.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82619635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-21DOI: 10.1504/ijwgs.2019.103233
R. Kuchumov, Andrey Sokolov, V. Korkhov
Work-stealing is one of the popular ways to schedule near-optimal task distribution across multiple CPU cores with low overheads on time, memory and inter-thread synchronisations. In the work-stealing strategy, workers that run out of tasks for execution start claiming tasks from other workers' queues. Double ended queues (deques) based on circular arrays proved to be an effective solution for such scenario. In this paper we investigate ways to improve performance of work-stealing schedulers based on deques by enhancing internal data handling mechanisms. Traditionally, deques are designed with an assumption that task pointers are stored within these data structures, while task objects reside in the heap memory. By modifying task queues so that they can hold task objects instead of pointers we managed to increase the performance more than 2.5 times on CPU-bound applications and decrease last-level cache misses up to 30% compared to Intel TBB and Intel/MIT Cilk work-stealing schedulers.
{"title":"Staccato: shared-memory work-stealing task scheduler with cache-aware memory management","authors":"R. Kuchumov, Andrey Sokolov, V. Korkhov","doi":"10.1504/ijwgs.2019.103233","DOIUrl":"https://doi.org/10.1504/ijwgs.2019.103233","url":null,"abstract":"Work-stealing is one of the popular ways to schedule near-optimal task distribution across multiple CPU cores with low overheads on time, memory and inter-thread synchronisations. In the work-stealing strategy, workers that run out of tasks for execution start claiming tasks from other workers' queues. Double ended queues (deques) based on circular arrays proved to be an effective solution for such scenario. In this paper we investigate ways to improve performance of work-stealing schedulers based on deques by enhancing internal data handling mechanisms. Traditionally, deques are designed with an assumption that task pointers are stored within these data structures, while task objects reside in the heap memory. By modifying task queues so that they can hold task objects instead of pointers we managed to increase the performance more than 2.5 times on CPU-bound applications and decrease last-level cache misses up to 30% compared to Intel TBB and Intel/MIT Cilk work-stealing schedulers.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"18 1","pages":"394-407"},"PeriodicalIF":1.0,"publicationDate":"2019-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82182513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-21DOI: 10.1504/ijwgs.2019.103216
N. Kulabukhova
In this paper the problems of using the existing methods and algorithms for applied science with the help of high performance techniques is described. The idea is to provide the scientists with an easy to use tools for constructing the implementation of their research working on heterogeneous systems. Without a doubt the problem-solving environment for these purposes must give the exact solution in a reasonable time. The concept which is described in the article was devised specifically for such kind of tasks. The application of it in terms of high energy physics is given. To illustrate the work of the concept the analysis of the distribution of the particles in the beam under the influence of the space charge is done.
{"title":"Natural parallelisation paradigm on accelerator physics example","authors":"N. Kulabukhova","doi":"10.1504/ijwgs.2019.103216","DOIUrl":"https://doi.org/10.1504/ijwgs.2019.103216","url":null,"abstract":"In this paper the problems of using the existing methods and algorithms for applied science with the help of high performance techniques is described. The idea is to provide the scientists with an easy to use tools for constructing the implementation of their research working on heterogeneous systems. Without a doubt the problem-solving environment for these purposes must give the exact solution in a reasonable time. The concept which is described in the article was devised specifically for such kind of tasks. The application of it in terms of high energy physics is given. To illustrate the work of the concept the analysis of the distribution of the particles in the beam under the influence of the space charge is done.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"240 1","pages":"340-352"},"PeriodicalIF":1.0,"publicationDate":"2019-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73533145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-21DOI: 10.1504/ijwgs.2019.10024787
Ming Zhu, Guodong Fan, Jing Li, Fengying Wang
Increasing emphasis on users' preferences and the growth of services on the web make service composition a time consuming and complicated work. In this paper, an approach for web service composition that combines overall QoS and modified graphplan is proposed. Fuzzy logic is applied to handle uncertainty and support decision making. Specifically, values of overall QoS of services are generated by using fuzzy analytical hierarchy process, entropy and user's preferences. The graphplan is modified by pruning services according to the values of overall QoS of services in forward and backward expansions, while producing solutions of compositions. Furthermore, case studies and experiments are performed and show that our approach has better solutions compared with original graphplan and some other approaches.
{"title":"A service composition approach based on overall QoS and modified graphplan","authors":"Ming Zhu, Guodong Fan, Jing Li, Fengying Wang","doi":"10.1504/ijwgs.2019.10024787","DOIUrl":"https://doi.org/10.1504/ijwgs.2019.10024787","url":null,"abstract":"Increasing emphasis on users' preferences and the growth of services on the web make service composition a time consuming and complicated work. In this paper, an approach for web service composition that combines overall QoS and modified graphplan is proposed. Fuzzy logic is applied to handle uncertainty and support decision making. Specifically, values of overall QoS of services are generated by using fuzzy analytical hierarchy process, entropy and user's preferences. The graphplan is modified by pruning services according to the values of overall QoS of services in forward and backward expansions, while producing solutions of compositions. Furthermore, case studies and experiments are performed and show that our approach has better solutions compared with original graphplan and some other approaches.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"30 1","pages":"319-339"},"PeriodicalIF":1.0,"publicationDate":"2019-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72979240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-21DOI: 10.1504/ijwgs.2019.103221
Shinji Sakamoto, L. Barolli, S. Okamoto
Networks of today are going through a rapid evolution. Recently, many new networks, especially wireless networks, are appearing. The wireless mesh networks (WMNs) are wireless networks having mesh topology. They have many advantages, such as high robustness and easiness for maintenance. However, WMNs have some problems that need to be solved. One important problem for WMNs is the node placement problem, which is an NP-hard problem. In this work, we propose and implement an intelligent hybrid simulation system based on particle swarm optimisation (PSO) and simulated annealing (SA) for node placement problem in WMNs, called WMN-PSOSA. We evaluate the performance of WMN-PSOSA system considering different distributions of mesh clients such as Weibull, chi-square, and uniform distributions. The simulation results show that the WMN-PSOSA performs better for Weibull distribution compared with the case of chi-square and uniform distributions.
{"title":"WMN-PSOSA: an intelligent hybrid simulation system for WMNs and its performance evaluations","authors":"Shinji Sakamoto, L. Barolli, S. Okamoto","doi":"10.1504/ijwgs.2019.103221","DOIUrl":"https://doi.org/10.1504/ijwgs.2019.103221","url":null,"abstract":"Networks of today are going through a rapid evolution. Recently, many new networks, especially wireless networks, are appearing. The wireless mesh networks (WMNs) are wireless networks having mesh topology. They have many advantages, such as high robustness and easiness for maintenance. However, WMNs have some problems that need to be solved. One important problem for WMNs is the node placement problem, which is an NP-hard problem. In this work, we propose and implement an intelligent hybrid simulation system based on particle swarm optimisation (PSO) and simulated annealing (SA) for node placement problem in WMNs, called WMN-PSOSA. We evaluate the performance of WMN-PSOSA system considering different distributions of mesh clients such as Weibull, chi-square, and uniform distributions. The simulation results show that the WMN-PSOSA performs better for Weibull distribution compared with the case of chi-square and uniform distributions.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"16 1","pages":"353-366"},"PeriodicalIF":1.0,"publicationDate":"2019-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81863468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-10-21DOI: 10.1504/ijwgs.2019.103222
Danilo Oliveira, J. Dantas, N. Rosa, P. Maciel, Rúbens de Souza Matos Júnior, A. Brinkmann
Creating a cost-effective and highly available private cloud infrastructure from scratch is challenging. In order to improve availability, system administrators commonly employ redundant hardware, which incurs increased acquisition cost. There are plenty of decisions involved in this process. It is necessary to specify how many servers will be employed, and each of them will have a role in the infrastructure either as a worker node or as a management node. One question that arises is: among all possible ways to arrange the servers, and considering a set of requirements (e.g., the minimum number of available workers, minimum availability), which configurations can sustain a minimal availability level (steady state and capacity oriented)? This work proposes an optimisation model for private clouds planning supported by analytical modelling for computing the cost of solutions. By combining the optimisation model with the bisection method, it is possible to minimise the acquisition cost while maintaining the high availability of the cloud. The proposed method can also be applied to other parallel or distributed systems with the same properties as the private clouds used in this study.
{"title":"A dependability and cost optimisation method for private cloud infrastructures","authors":"Danilo Oliveira, J. Dantas, N. Rosa, P. Maciel, Rúbens de Souza Matos Júnior, A. Brinkmann","doi":"10.1504/ijwgs.2019.103222","DOIUrl":"https://doi.org/10.1504/ijwgs.2019.103222","url":null,"abstract":"Creating a cost-effective and highly available private cloud infrastructure from scratch is challenging. In order to improve availability, system administrators commonly employ redundant hardware, which incurs increased acquisition cost. There are plenty of decisions involved in this process. It is necessary to specify how many servers will be employed, and each of them will have a role in the infrastructure either as a worker node or as a management node. One question that arises is: among all possible ways to arrange the servers, and considering a set of requirements (e.g., the minimum number of available workers, minimum availability), which configurations can sustain a minimal availability level (steady state and capacity oriented)? This work proposes an optimisation model for private clouds planning supported by analytical modelling for computing the cost of solutions. By combining the optimisation model with the bisection method, it is possible to minimise the acquisition cost while maintaining the high availability of the cloud. The proposed method can also be applied to other parallel or distributed systems with the same properties as the private clouds used in this study.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"17 1","pages":"367-393"},"PeriodicalIF":1.0,"publicationDate":"2019-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83016398","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-07-04DOI: 10.1504/IJWGS.2019.10022422
B. Bani-Ismail, Y. Baghdadi
There are many service identification methods (SIMs) to simplify service identification in SOA lifecycle. These SIMs vary in terms of their features (e.g., input artefact, technique). Due to this diversity, few evaluation frameworks have been proposed to guide organisations in selecting a suitable SIM based on their available input artefacts (e.g., source code, business process). This research concerns with SIMs that consider data flow diagram (DFD) as an input artefact, in order to migrate two legacy systems, modelled with DFD, to SOA. Only two SIMs are found in the literature to identify services based on DFD. However, these SIMs do not provide a way to select among the services identified to be implemented as web services. Therefore, this paper aims to bridge this gap by proposing a new approach for service selection based on DFD to assist organisations in speeding up the process of migrating their legacy systems to SOA.
{"title":"Migrating two legacy systems to SOA: a new approach for service selection based on data flow diagram","authors":"B. Bani-Ismail, Y. Baghdadi","doi":"10.1504/IJWGS.2019.10022422","DOIUrl":"https://doi.org/10.1504/IJWGS.2019.10022422","url":null,"abstract":"There are many service identification methods (SIMs) to simplify service identification in SOA lifecycle. These SIMs vary in terms of their features (e.g., input artefact, technique). Due to this diversity, few evaluation frameworks have been proposed to guide organisations in selecting a suitable SIM based on their available input artefacts (e.g., source code, business process). This research concerns with SIMs that consider data flow diagram (DFD) as an input artefact, in order to migrate two legacy systems, modelled with DFD, to SOA. Only two SIMs are found in the literature to identify services based on DFD. However, these SIMs do not provide a way to select among the services identified to be implemented as web services. Therefore, this paper aims to bridge this gap by proposing a new approach for service selection based on DFD to assist organisations in speeding up the process of migrating their legacy systems to SOA.","PeriodicalId":54935,"journal":{"name":"International Journal of Web and Grid Services","volume":"93 1","pages":"251-281"},"PeriodicalIF":1.0,"publicationDate":"2019-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82772741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：